The probability of unusually large components for critical percolation on random \(d\)-regular graphs

DOI10.1214/23-ejp982arXiv2112.05002MaRDI QIDQ6110546

Umberto De Ambroggio, Matthew I. Roberts

Publication date: 2 August 2023

Published in: Electronic Journal of Probability (Search for Journal in Brave)

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

zbMATH Keywords

percolationrandom regular graphexploration processcomponent size

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items (2)

Enumerative combinatorics. Abstracts from the workshop held December 11--17, 2022 ⋮ Unnamed Item

Cites Work

• 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
• Scaling limits for critical inhomogeneous random graphs with finite third moments
• A new approach to strong embeddings
• Novel scaling limits for critical inhomogeneous random graphs
• Asymptotic normality of the size of the giant component via a random walk
• The critical random graph, with martingales
• A local limit theorem for the critical random graph
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Growth of random walks conditioned to stay positive
• Conditioned limit theorems for some null recurrent Markov processes
• Brownian excursions, critical random graphs and the multiplicative coalescent
• Some large deviation results for sparse random graphs
• Exceptional times of the critical dynamical Erdős-Rényi graph
• Cluster tails for critical power-law inhomogeneous random graphs
• On the largest component of the random graph at a nearcritical stage
• Percolation on finite graphs and isoperimetric inequalities.
• Ballot theorems revisited
• Noise sensitivity and exceptional times of transience for a simple symmetric random walk in one dimension
• Scaling limit of dynamical percolation on critical Erdős-Rényi random graphs
• Component sizes for large quantum Erdős-Rényi graph near criticality
• The continuum limit of critical random graphs
• The Phase Transition in the Configuration Model
• The scaling window for a random graph with a given degree sequence
• Critical percolation on random regular graphs
• Critical epidemics, random graphs, and Brownian motion with a parabolic drift
• The Hitting Time Theorem Revisited
• An Elementary Proof of the Hitting Time Theorem
• Symmetric sampling procedures, general epidemic processes and their threshold limit theorems
• An approximation of partial sums of independent RV'-s, and the sample DF. I
• The Structure of a Random Graph at the Point of the Phase Transition
• Critical percolation on random regular graphs
• An elementary approach to component sizes in critical random graphs
• The probability of unusually large components in the near-critical Erdős–Rényi graph
• A Tauberian Theorem and Its Probability Interpretation
• Unusually large components in near-critical Erdős–Rényi graphs via ballot theorems
• A large‐deviations principle for all the cluster sizes of a sparse Erdős–Rényi graph

This page was built for publication: The probability of unusually large components for critical percolation on random \(d\)-regular graphs