2,789 research outputs found

    Percolation on dual lattices with k-fold symmetry

    Full text link
    Zhang found a simple, elegant argument deducing the non-existence of an infinite open cluster in certain lattice percolation models (for example, p=1/2 bond percolation on the square lattice) from general results on the uniqueness of an infinite open cluster when it exists; this argument requires some symmetry. Here we show that a simple modification of Zhang's argument requires only 2-fold (or 3-fold) symmetry, proving that the critical probabilities for percolation on dual planar lattices with such symmetry sum to 1. Like Zhang's argument, our extension applies in many contexts; in particular, it enables us to answer a question of Grimmett concerning the anisotropic random cluster model on the triangular lattice.Comment: 11 pages, 1 figure. Revised with applications added; to appear in Random Structures and Algorithm

    A derivative formula for the free energy function

    Full text link
    We consider bond percolation on the Zd{\bf Z}^d lattice. Let MnM_n be the number of open clusters in B(n)=[n,n]dB(n)=[-n, n]^d. It is well known that EpMn/(2n+1)dE_pM_n / (2n+1)^d converges to the free energy function κ(p)\kappa(p) at the zero field. In this paper, we show that σp2(Mn)/(2n+1)d\sigma^2_p(M_n)/(2n+1)^d converges to (p2(1p)+p(1p)2)κ(p)-(p^2(1-p)+p(1-p)^2)\kappa'(p).Comment: 8 pages 1 figur

    Uniqueness and multiplicity of infinite clusters

    Get PDF
    The Burton--Keane theorem for the almost-sure uniqueness of infinite clusters is a landmark of stochastic geometry. Let μ\mu be a translation-invariant probability measure with the finite-energy property on the edge-set of a dd-dimensional lattice. The theorem states that the number II of infinite components satisfies μ(I{0,1})=1\mu(I\in\{0,1\})=1. The proof is an elegant and minimalist combination of zero--one arguments in the presence of amenability. The method may be extended (not without difficulty) to other problems including rigidity and entanglement percolation, as well as to the Gibbs theory of random-cluster measures, and to the central limit theorem for random walks in random reflecting labyrinths. It is a key assumption on the underlying graph that the boundary/volume ratio tends to zero for large boxes, and the picture for non-amenable graphs is quite different.Comment: Published at http://dx.doi.org/10.1214/074921706000000040 in the IMS Lecture Notes--Monograph Series (http://www.imstat.org/publications/lecnotes.htm) by the Institute of Mathematical Statistics (http://www.imstat.org
    corecore