论文信息 - Critical Probabilities of 1-Independent Percolation Models

Critical Probabilities of 1-Independent Percolation Models

Given a locally finite connected infinite graph G, let the interval [pmin(G), pmax(G)] be the smallest interval such that if p >pmax(G), then every 1-independent bond percolation model on G with bond probability p percolates, and for p <pmin(G) none does. We determine this interval for trees in terms of the branching number of the tree. We also give some general bounds for other graphs G, in particular for lattices.

Béla Bollobás | Paul N. Balister

[1] André Pönitz,et al. Improved Upper Bounds for Self-Avoiding Walks in ${\bf Z}^{d}$ , 2000 .

[2] R. Schonmann,et al. Domination by product measures , 1997 .

[3] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.

[4] R. Lyons. Random Walks and Percolation on Trees , 1990 .

[5] R. Ziff,et al. Spanning probability in 2D percolation. , 1992, Physical review letters.

[6] J. Berg,et al. A new lower bound for the critical probability of site percolation on the square lattice , 1996 .

[7] John C. Wierman,et al. Substitution Method Critical Probability Bounds for the Square Lattice Site Percolation Model , 1995, Combinatorics, Probability and Computing.

[8] B. Bollobás,et al. Continuum percolation with steps in the square or the disc , 2005, Random Struct. Algorithms.

[9] Peter Tittmann,et al. Improved Upper Bounds for Self-Avoiding Walks in Zd , 2000, Electron. J. Comb..

[10] H. Poincaré,et al. Percolation ? , 1982 .

[11] Jennifer Morse,et al. Determinantal Expression and Recursion for Jack Polynomials , 1999, Electron. J. Comb..

[12] Béla Bollobás,et al. Continuum percolation with steps in the square or the disc , 2005, Random Struct. Algorithms.

[13] Uniqueness in percolation theory , 1994 .