The diameter of KPKVB random graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2017
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914252189597696 |
|---|---|
| author | Müller, Tobias Staps, Merlijn |
| author_facet | Müller, Tobias Staps, Merlijn |
| contents | We consider a model for complex networks that was recently proposed as a model for complex networks by Krioukov et al. In this model, nodes are chosen randomly inside a disk in the hyperbolic plane and two nodes are connected if they are at most a certain hyperbolic distance from each other. It has been previously shown that this model has various properties associated with complex networks, including a power-law degree distribution and a strictly positive clustering coefficient. The model is specified using three parameters : the number of nodes $N$, which we think of as going to infinity, and $α, ν> 0$ which we think of as constant. Roughly speaking $α$ controls the power law exponent of the degree sequence and $ν$ the average degree.
Earlier work of Kiwi and Mitsche has shown that when $α< 1$ (which corresponds to the exponent of the power law degree sequence being $< 3$) then the diameter of the largest component is a.a.s.~polylogarithmic in $N$. Friedrich and Krohmer have shown it is a.a.s.~$Ω(\log N)$ and they improved the exponent of the polynomial in $\log N$ in the upper bound. Here we show the maximum diameter over all components is a.a.s.~$O(\log N)$ thus giving a bound that is tight up to a multiplicative constant. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1707_09555 |
| institution | arXiv |
| publishDate | 2017 |
| record_format | arxiv |
| spellingShingle | The diameter of KPKVB random graphs Müller, Tobias Staps, Merlijn Probability Combinatorics 05C80, 05C82 We consider a model for complex networks that was recently proposed as a model for complex networks by Krioukov et al. In this model, nodes are chosen randomly inside a disk in the hyperbolic plane and two nodes are connected if they are at most a certain hyperbolic distance from each other. It has been previously shown that this model has various properties associated with complex networks, including a power-law degree distribution and a strictly positive clustering coefficient. The model is specified using three parameters : the number of nodes $N$, which we think of as going to infinity, and $α, ν> 0$ which we think of as constant. Roughly speaking $α$ controls the power law exponent of the degree sequence and $ν$ the average degree. Earlier work of Kiwi and Mitsche has shown that when $α< 1$ (which corresponds to the exponent of the power law degree sequence being $< 3$) then the diameter of the largest component is a.a.s.~polylogarithmic in $N$. Friedrich and Krohmer have shown it is a.a.s.~$Ω(\log N)$ and they improved the exponent of the polynomial in $\log N$ in the upper bound. Here we show the maximum diameter over all components is a.a.s.~$O(\log N)$ thus giving a bound that is tight up to a multiplicative constant. |
| title | The diameter of KPKVB random graphs |
| topic | Probability Combinatorics 05C80, 05C82 |
| url | https://arxiv.org/abs/1707.09555 |