Mean-field conditions for percolation on finite graphs
type: Item
instance of: scholarly article
title: Mean-field conditions for percolation on finite graphs
zbMATH Open document ID: 1182.60025
author: Asaf Nachmias
published in: Geometric and Functional Analysis. GAFA
publication date: 2010-01-25T00:00:00Z
full work available at URL: https://arxiv.org/abs/0709.1719
Mathematics Subject Classification ID: 60K35
Mathematics Subject Classification ID: 60C05
Mathematics Subject Classification ID: 05C80
zbMATH DE Number: 5662382
zbMATH Keywords: mean-field conditions
zbMATH Keywords: finite transitive graphs
zbMATH Keywords: non-backtracking random walk
zbMATH Keywords: \(p\)-bond-percolation
MaRDI profile type: Publication
OpenAlex ID: W2130134592
arXiv ID: 0709.1719
cites work: Largest random component of a k-cube
cites work: On the critical behavior of the magnetization in high-dimensional Ising models
cites work: NON-BACKTRACKING RANDOM WALKS MIX FASTER
cites work: Percolation on finite graphs and isoperimetric inequalities.
cites work: The Evolution of Random Graphs
cites work: Random subgraphs of finite graphs: I. The scaling window under the triangle condition
cites work: Random subgraphs of finite graphs. II: The lace expansion and the triangle condition
cites work: Random subgraphs of finite graphs. III: The phase transition for the \(n\)-cube
cites work: Quasi-random graphs
cites work: Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
cites work: Mean-field critical behaviour for percolation in high dimensions
cites work: Random subgraphs of the 2D Hamming graph: The supercritical phase
cites work: Expander graphs and their applications
cites work: The transitive closure of a random digraph
cites work: Explicit construction of graphs with an arbitrary large girth and of large size
cites work: Ramanujan graphs
cites work: Component behavior near the critical point of the random graph process
cites work: Random walks, capacity and percolation on trees
cites work: Explicit constructions of graphs without short cycles and low density codes
cites work: Symmetric sampling procedures, general epidemic processes and their threshold limit theorems
cites work: Critical percolation on random regular graphs
cites work: Critical random graphs: Diameter and mixing time
cites work: Edge percolation on a random regular graph of low degree
DOI: 10.1007/S00039-009-0032-4
description: scientific article