Multisource invasion percolation on the complete graph

DOI10.1214/23-aop1641arXiv2208.06509MaRDI QIDQ6183248

Jordan Mitchell Barrett, Louigi Addario-Berry

Publication date: 26 January 2024

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

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

zbMATH Keywords

minimum spanning treesinvasion percolationcritical percolationErdős-Rényi random graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Percolation (82B43) Time-dependent percolation in statistical mechanics (82C43)

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Limit theorems for 2D invasion percolation
• Invasion percolation on the Poisson-weighted infinite tree
• Cutting down trees with a Markov chainsaw
• Critical random graphs: limiting constructions and distributional properties
• The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
• The continuum random tree. I
• École d'été de probabilités de Saint-Flour XIII - 1983
• The fractal volume of the two-dimensional invasion percolation cluster
• Random walk in a strongly inhomogeneous environment and invasion percolation
• Ground-state structure in a highly disordered spin-glass model.
• The scaling limits of the minimal spanning tree and invasion percolation in the plane
• The scaling limit of the minimum spanning tree of the complete graph
• The scaling limits of near-critical and dynamical percolation
• Scaling limit of the invasion percolation cluster on a regular tree
• Geometry of the minimal spanning tree of a random 3-regular graph
• Universal height and width bounds for random trees
• The continuum limit of critical random graphs
• The size of a pond in 2D invasion percolation
• Invasion percolation on regular trees
• Invasion percolation on Galton-Watson trees
• On finding a minimum spanning tree in a network with random weights
• Capillary displacement and percolation in porous media
• Component behavior near the critical point of the random graph process
• Geometry of the vacant set left by random walk on random graphs, Wright's constants, and critical random graphs with prescribed degrees
• A variant of the Erdős–Rényi random graph process

This page was built for publication: Multisource invasion percolation on the complete graph