Finite size percolation in regular trees
From MaRDI portal
Publication:625024
DOI10.1016/j.spl.2010.10.017zbMath1216.60063arXiv1007.4508OpenAlexW1982497293MaRDI QIDQ625024
Publication date: 11 February 2011
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.4508
longest success runGalton-Watson processesChen-Stein method for Poisson approximationlargest open clusterpercolation on trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two moments suffice for Poisson approximations: The Chen-Stein method
- Catalan numbers, their generalization, and their uses
- Tree-indexed processes
- Geographic and network surveillance via scan statistics for critical area detection
- Adaptive multiscale detection of filamentary structures in a background of uniform random points
- On a new law of large numbers
- Probability on Trees and Networks
- The Galton-Watson process conditioned on the total progeny
- Percolation
- The Distribution of Heights of Binary Trees and Other Simple Trees
- Large deviations for discrete and continuous percolation
- The total progeny in a branching process and a related random walk
- Distribution of the Length of the Longest Significance Run on a Bernoulli Net and Its Applications
- The birth of the infinite cluster: Finite-size scaling in percolation
