Critical percolation on scale-free random graphs: new universality class for the configuration model

DOI10.1007/s00220-021-03957-8zbMath1461.05184arXiv1909.05590OpenAlexW3131190609MaRDI QIDQ2662082

Remco van der Hofstad, Souvik Dhara, Johan S. H. van Leeuwaarden

Publication date: 8 April 2021

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.05590

zbMATH Keywords

bond percolationscale-free networks

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Distance in graphs (05C12) Boundary theory for Markov processes (60J50) Random walks on graphs (05C81)

Related Items

The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The component sizes of a critical random graph with given degree sequence
• Critical window for the configuration model: finite third moment degrees
• Susceptibility of random graphs with given vertex degrees
• Scaling limits for critical inhomogeneous random graphs with finite third moments
• The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
• Novel scaling limits for critical inhomogeneous random graphs
• Critical random graphs: Diameter and mixing time
• The critical random graph, with martingales
• Martingale proofs of many-server heavy-traffic limits for Markovian queues
• On percolation in random graphs with given vertex degrees
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The asymptotic number of labeled graphs with given degree sequences
• Brownian excursions, critical random graphs and the multiplicative coalescent
• The entrance boundary of the multiplicative coalescent
• On the critical probability in percolation
• Eternal additive coalescents and certain bridges with exchangeable increments
• Progress in high-dimensional percolation and random graphs
• The continuum limit of critical random graphs
• Stochastic-Process Limits
• Random Graphs and Complex Networks
• The Phase Transition in the Configuration Model
• Critical percolation on random regular graphs
• Statistical mechanics of complex networks
• OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS
• A new approach to the giant component problem
• Compensators and Cox convergence
• On a random graph with immigrating vertices: Emergence of the giant component
• Robustness and Vulnerability of Scale-Free Random Graphs
• A critical point for random graphs with a given degree sequence
• Component structure of the configuration model: Barely supercritical case
• Random subgraphs of finite graphs: I. The scaling window under the triangle condition
• On a conditionally Poissonian graph process
• Percolation on Sparse Random Graphs with Given Degree Sequence
• Networks