Universality for critical heavy-tailed network models: Metric structure of maximal components

Shankar Bhamidi, Souvik Dhara, Remco van der Hofstad, Sanchayan Sen

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)

Abstract

We study limits of the largest connected components (viewed as metric spaces) obtained by critical percolation on uniformly chosen graphs and configuration models with heavy-tailed degrees. For rank-one inhomogeneous random graphs, such results were derived by Bhamidi, van der Hofstad, Sen (2018) [15]. We develop general principles under which the identical scaling limits as in [15] can be obtained. Of independent interest, we derive refined asymptotics for various susceptibility functions and the maximal diameter in the barely subcritical regime.

Original languageEnglish
Article number47
Number of pages57
JournalElectronic Journal of Probability
Volume25
DOIs
Publication statusPublished - 2020

Keywords

  • Critical configuration model
  • Critical percolation
  • Gromov-weak convergence
  • Heavy-tailed degrees
  • Multiplicative coalescent
  • Universality

Fingerprint Dive into the research topics of 'Universality for critical heavy-tailed network models: Metric structure of maximal components'. Together they form a unique fingerprint.

Cite this