On sparsity, power-law and clustering properties of graphex processes
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2017
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866913678083751936 |
|---|---|
| author | Caron, François Panero, Francesca Rousseau, Judith |
| author_facet | Caron, François Panero, Francesca Rousseau, Judith |
| contents | This paper investigates properties of the class of graphs based on exchangeable point processes. We provide asymptotic expressions for the number of edges, number of nodes and degree distributions, identifying four regimes: (i) a dense regime, (ii) a sparse almost dense regime, (iii) a sparse regime with power-law behaviour, and (iv) an almost extremely sparse regime. We show that under mild assumptions, both the global and local clustering coefficients converge to constants which may or may not be the same. We also derive a central limit theorem for the number of nodes. Finally, we propose a class of models within this framework where one can separately control the latent structure and the global sparsity/power-law properties of the graph. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1708_03120 |
| institution | arXiv |
| publishDate | 2017 |
| record_format | arxiv |
| spellingShingle | On sparsity, power-law and clustering properties of graphex processes Caron, François Panero, Francesca Rousseau, Judith Statistics Theory Probability This paper investigates properties of the class of graphs based on exchangeable point processes. We provide asymptotic expressions for the number of edges, number of nodes and degree distributions, identifying four regimes: (i) a dense regime, (ii) a sparse almost dense regime, (iii) a sparse regime with power-law behaviour, and (iv) an almost extremely sparse regime. We show that under mild assumptions, both the global and local clustering coefficients converge to constants which may or may not be the same. We also derive a central limit theorem for the number of nodes. Finally, we propose a class of models within this framework where one can separately control the latent structure and the global sparsity/power-law properties of the graph. |
| title | On sparsity, power-law and clustering properties of graphex processes |
| topic | Statistics Theory Probability |
| url | https://arxiv.org/abs/1708.03120 |