A carregar...
Randomized near-neighbor graphs, giant components and applications in data science
If we pick n random points uniformly in [0, 1](d) and connect each point to its c(d) log n–nearest neighbors, where d ≥ 2 is the dimension and c(d) is a constant depending on the dimension, then it is well known that the graph is connected with high probability. We prove that it suffices to connect...
Na minha lista:
| Publicado no: | J Appl Probab |
|---|---|
| Main Authors: | , , , , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
2020
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7480951/ https://ncbi.nlm.nih.gov/pubmed/32913373 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1017/jpr.2020.21 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|