Infinite and Giant Components in the Layers Percolation Model

zbMath1386.82026arXiv1611.01693MaRDI QIDQ4603437

Jonathan Hermon

Publication date: 20 February 2018

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

zbMATH Keywords

random graphsdependent percolationexponential intersection tail (EIT)layers model

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• New bounds for contagious sets
• Is the critical percolation probability local?
• On percolation in random graphs with given vertex degrees
• Random walks, capacity and percolation on trees
• Unpredictable paths and percolation
• The Ising model and percolation on trees and tree-like graphs
• On giant components and treewidth in the layers model
• Probability on Trees and Networks
• The phase transition in random graphs: A simple proof
• Recoverable Values for Independent Sets
• A Theory of Auctions and Competitive Bidding
• Percolation
• A critical point for random graphs with a given degree sequence
• Oriented percolation in dimensions d ≥ 4: bounds and asymptotic formulas
• Percolation on Sparse Random Graphs with Given Degree Sequence