Locality of random digraphs on expanders

DOI10.1214/22-aop1618zbMath1529.60067arXiv2103.09952OpenAlexW3137118672MaRDI QIDQ6116322

Unnamed Author, Amin Saberi, Christian Borgs

Publication date: 18 July 2023

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

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

zbMATH Keywords

percolationrandom graphslocal convergenceexpandersepidemic modelsoriented percolationgiant component

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Processes in random environments (60K37) Directed graphs (digraphs), tournaments (05C20) Expander graphs (05C48)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sharp threshold for percolation on expanders
• Is the critical percolation probability local?
• Submean variance bound for effective resistance of random electric networks
• Edge percolation on a random regular graph of low degree
• On percolation in random graphs with given vertex degrees
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Indistinguishability of percolation clusters
• Recurrence of distributional limits of finite planar graphs
• Percolation on finite graphs and isoperimetric inequalities.
• Random networks with sublinear preferential attachment: the giant component
• A note on the local weak limit of a sequence of expander graphs
• An old approach to the giant component problem
• Random networks with concave preferential attachment rule
• Asymptotic behavior and distributional limits of preferential attachment graphs
• Processes on unimodular random networks
• On certain connectivity properties of the internet topology
• Random Graphs and Complex Networks
• Emergence of Scaling in Random Networks
• The transitive closure of a random digraph
• On the continuity of the percolation probability function
• A new approach to the giant component problem
• The Evolution of Random Graphs
• On the critical percolation probabilities
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• Robustness and Vulnerability of Scale-Free Random Graphs
• The spatial general epidemic and locally dependent random graphs
• The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence
• The giant component of the directed configuration model revisited
• Asymptotics in percolation on high‐girth expanders
• Edge-Isoperimetric Inequalities and Influences
• Percolation on Sparse Random Graphs with Given Degree Sequence
• The giant component threshold for random regular graphs with edge faults H. Prodinger