Critical percolation on random regular graphs

DOI10.1090/proc/14021zbMath1388.05170arXiv1703.03639OpenAlexW2595513744MaRDI QIDQ4563646

Felix Joos, Guillem Perarnau

Publication date: 4 June 2018

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

percolationrandom regular graph

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80)

Related Items

An elementary approach to component sizes in critical random graphs ⋮ The probability of unusually large components for critical percolation on random \(d\)-regular graphs ⋮ Unnamed Item

Cites Work

• Critical random graphs: Diameter and mixing time
• Edge percolation on a random regular graph of low degree
• The critical random graph, with martingales
• On percolation in random graphs with given vertex degrees
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• Percolation on finite graphs and isoperimetric inequalities.
• Connectivity for random graphs from a weighted bridge-addable class
• An old approach to the giant component problem
• Mean-field conditions for percolation on finite graphs
• Random regular graphs of high degree
• The phase transition in random graphs: A simple proof
• The Phase Transition in the Configuration Model
• Critical percolation on random regular graphs
• The Structure of a Random Graph at the Point of the Phase Transition
• Random subgraphs of finite graphs: I. The scaling window under the triangle condition
• Percolation on Sparse Random Graphs with Given Degree Sequence
• The giant component threshold for random regular graphs with edge faults H. Prodinger
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item