Cargando…
Isolation and Connectivity in Random Geometric Graphs with Self-similar Intensity Measures
Random geometric graphs consist of randomly distributed nodes (points), with pairs of nodes within a given mutual distance linked. In the usual model the distribution of nodes is uniform on a square, and in the limit of infinitely many nodes and shrinking linking range, the number of isolated nodes...
| Autor principal: | |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer US
2018
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6434978/ https://www.ncbi.nlm.nih.gov/pubmed/30996473 http://dx.doi.org/10.1007/s10955-018-2059-0 |