Percolation, first-passage percolation and covering times for Richardson's model on the \(n\)-cube
From MaRDI portal
Publication:687712
DOI10.1214/aoap/1177005440zbMath0783.60102arXivmath/0404015OpenAlexW2005443809MaRDI QIDQ687712
Robin Pemantle, James Allen Fill
Publication date: 28 October 1993
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0404015
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05)
Related Items
Diffusion limited aggregation on the Boolean lattice, Undirected polymers in random environment: path properties in the mean field limit, Interacting particle systems as stochastic social dynamics, Asynchronous rumor spreading on random graphs, The length of random subsets of Boolean lattices, On the Push&Pull Protocol for Rumor Spreading, Oriented first passage percolation in the mean field limit. II: The extremal process, Random walks and electrical resistances in products of graphs, First-passage percolation on Cartesian power graphs, Reliable Broadcasting in Hypercubes with Random Link and Node Failures, Derrida’s Random Energy Models, First passage percolation on locally treelike networks. I. Dense random graphs, Kardar–Parisi–Zhang universality in first-passage percolation: the role of geodesic degeneracy, Speeding up non-Markovian first-passage percolation with a few extra edges, Positive association of the oriented percolation cluster in randomly oriented graphs, Oriented first passage percolation in the mean field limit, Accessibility percolation with backsteps, The width of random subsets of Boolean lattices
