Scaling limit of dynamical percolation on critical Erdős-Rényi random graphs

DOI10.1214/20-AOP1472zbMath1483.60148arXiv1710.09101OpenAlexW3121646137MaRDI QIDQ2227717

Raphaël Rossignol

Publication date: 15 February 2021

Published in: The Annals of Probability (Search for Journal in Brave)

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

zbMATH Keywords

scaling limitcoalescencefragmentationrandom graphdynamical percolationFeller propertyErdős-RényiGromov-Hausdorff-Prokhorov distance

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items

Unusually large components in near-critical Erdős–Rényi graphs via ballot theorems ⋮ Noise sensitivity of percolation via differential inequalities ⋮ The probability of unusually large components for critical percolation on random \(d\)-regular graphs ⋮ Parking on Cayley trees and frozen Erdős-Rényi ⋮ Noise sensitivity of critical random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new encoding of coalescent processes: applications to the additive and multiplicative cases
• A note on the Gromov-Hausdorff-Prokhorov distance between (locally) compact metric measure spaces
• The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs
• Critical window for the configuration model: finite third moment degrees
• Critical random graphs: limiting constructions and distributional properties
• The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
• Continuum limit of critical inhomogeneous random graphs
• Rayleigh processes, real trees, and root growth with re-grafting
• The standard additive coalescent
• Brownian excursions, critical random graphs and the multiplicative coalescent
• Dynamical percolation
• Exceptional times of the critical dynamical Erdős-Rényi graph
• The scaling limit of the minimum spanning tree of the complete graph
• The scaling limits of near-critical and dynamical percolation
• Universality for critical heavy-tailed network models: metric structure of maximal components
• Heavy-tailed configuration models at criticality
• The continuum limit of critical random graphs
• Random Measures, Theory and Applications
• OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS
• Tessellations of random maps of arbitrary genus
• The birth of the giant component
• Convergence of stochastic processes
• Optimal Transport