IDEAS home Printed from https://ideas.repec.org/p/ehl/lserod/119794.html
   My bibliography  Save this paper

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

Author

Listed:
  • Caron, François
  • Panero, Francesca
  • Rousseau, Judith

Abstract

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.

Suggested Citation

  • Caron, François & Panero, Francesca & Rousseau, Judith, 2023. "On sparsity, power-law, and clustering properties of graphex processes," LSE Research Online Documents on Economics 119794, London School of Economics and Political Science, LSE Library.
    • Handle: RePEc:ehl:lserod:119794
    as

    Download full text from publisher

    File URL: http://eprints.lse.ac.uk/119794/
    File Function: Open access version.
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Aldous, David J., 1981. "Representations for partially exchangeable arrays of random variables," Journal of Multivariate Analysis, Elsevier, vol. 11(4), pages 581-598, December.
    2. François Caron & Emily B. Fox, 2017. "Sparse graphs using exchangeable random measures," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 79(5), pages 1295-1366, November.
    3. Adrien Todeschini & Xenia Miscouridou & François Caron, 2020. "Exchangeable random measures for sparse and modular graphs with overlapping communities," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 82(2), pages 487-520, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bikramjit Das & Tiandong Wang & Gengling Dai, 2022. "Asymptotic Behavior of Common Connections in Sparse Random Networks," Methodology and Computing in Applied Probability, Springer, vol. 24(3), pages 2071-2092, September.
    2. Liu, Yirui & Qiao, Xinghao & Wang, Liying & Lam, Jessica, 2023. "EEGNN: edge enhanced graph neural network with a Bayesian nonparametric graph model," LSE Research Online Documents on Economics 119918, London School of Economics and Political Science, LSE Library.
    3. Yin, Mei, 2022. "Remarks on power-law random graphs," Stochastic Processes and their Applications, Elsevier, vol. 153(C), pages 183-197.
    4. Koen Jochmans, 2024. "Nonparametric identification and estimation of stochastic block models from many small networks," Post-Print hal-04672521, HAL.
    5. Pe[combining cedilla]ski, Marcin, 2011. "Prior symmetry, similarity-based reasoning, and endogenous categorization," Journal of Economic Theory, Elsevier, vol. 146(1), pages 111-140, January.
    6. Angelos Dassios & Junyi Zhang, 2023. "Exact Simulation of Poisson-Dirichlet Distribution and Generalised Gamma Process," Methodology and Computing in Applied Probability, Springer, vol. 25(2), pages 1-21, June.
    7. Riva Palacio, Alan & Leisen, Fabrizio, 2018. "Integrability conditions for compound random measures," Statistics & Probability Letters, Elsevier, vol. 135(C), pages 32-37.
    8. Olav Kallenberg, 1999. "Multivariate Sampling and the Estimation Problem for Exchangeable Arrays," Journal of Theoretical Probability, Springer, vol. 12(3), pages 859-883, July.
    9. Bryan S. Graham & Fengshi Niu & James L. Powell, 2019. "Kernel Density Estimation for Undirected Dyadic Data," Papers 1907.13630, arXiv.org.
    10. Billio, Monica & Casarin, Roberto & Rossini, Luca, 2019. "Bayesian nonparametric sparse VAR models," Journal of Econometrics, Elsevier, vol. 212(1), pages 97-115.
    11. Dmitry Arkhangelsky & Guido Imbens, 2023. "Causal Models for Longitudinal and Panel Data: A Survey," Papers 2311.15458, arXiv.org, revised Jun 2024.
    12. Griffin, Jim, 2019. "Two part envelopes for rejection sampling of some completely random measures," Statistics & Probability Letters, Elsevier, vol. 151(C), pages 36-41.
    13. Bryan S. Graham, 2020. "Sparse network asymptotics for logistic regression," Papers 2010.04703, arXiv.org.
    14. Bryan S. Graham, 2019. "Network Data," Papers 1912.06346, arXiv.org.
    15. Chen, Mingli & Kato, Kengo & Leng, Chenlei, 2019. "Analysis of Networks via the Sparse β-Model," The Warwick Economics Research Paper Series (TWERPS) 1222, University of Warwick, Department of Economics.
    16. Harold D Chiang & Yukun Ma & Joel Rodrigue & Yuya Sasaki, 2021. "Dyadic double/debiased machine learning for analyzing determinants of free trade agreements," Papers 2110.04365, arXiv.org, revised Dec 2022.
    17. Hsieh, Chih-Sheng & Hsu, Yu-Chin & Ko, Stanley I.M. & Kovářík, Jaromír & Logan, Trevon D., 2024. "Non-representative sampled networks: Estimation of network structural properties by weighting," Journal of Econometrics, Elsevier, vol. 240(1).
    18. François Caron & Emily B. Fox, 2017. "Sparse graphs using exchangeable random measures," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 79(5), pages 1295-1366, November.
    19. Mingli Chen & Kengo Kato & Chenlei Leng, 2021. "Analysis of networks via the sparse β‐model," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 83(5), pages 887-910, November.
    20. Olav Kallenberg, 2012. "Schoenberg’s Theorem and Unitarily Invariant Random Arrays," Journal of Theoretical Probability, Springer, vol. 25(4), pages 1013-1039, December.

    More about this item

    Keywords

    community structure; generalised graphon; Networks; Poisson processes; power law; sparsity; subgraph counts; transitivity; EPSRC and MRC Centre for Doctoral Training in Statistical Science (grant code EP/L016710/1; European Union’s Horizon 2020 research and innovation programme (grant agreement no. 834175;
    All these keywords.

    JEL classification:

    • C1 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods and Methodology: General

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ehl:lserod:119794. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: LSERO Manager (email available below). General contact details of provider: https://edirc.repec.org/data/lsepsuk.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.