Library Header Image
LSE Research Online LSE Library Services

On sparsity, power-law, and clustering properties of graphex processes

Caron, François, Panero, Francesca ORCID: 0000-0002-8287-163X and Rousseau, Judith (2023) On sparsity, power-law, and clustering properties of graphex processes. Advances in Applied Probability. ISSN 0001-8678

[img] Text (Caron_et_al__Sparsity-power-law-clustering-properties-graphex-processes--accepted) - Accepted Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (626kB)

Identification Number: 10.1017/apr.2022.75


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 subgraph counts and 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.

Item Type: Article
Additional Information: © 2023 The Author(s)
Divisions: Statistics
Subjects: H Social Sciences > HA Statistics
Q Science > QA Mathematics
Date Deposited: 21 Jul 2023 11:06
Last Modified: 15 Apr 2024 19:42

Actions (login required)

View Item View Item


Downloads per month over past year

View more statistics