Indistinguishability of percolation clusters (Q1577738)

From MaRDI portal
Revision as of 19:32, 19 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Indistinguishability of percolation clusters
scientific article

    Statements

    Indistinguishability of percolation clusters (English)
    0 references
    0 references
    0 references
    13 May 2001
    0 references
    The authors show that when percolation produces infinitely many clusters on a Cayley graph, one cannot distinguish the clusters from each other by any invariantly defined property. This implies that uniqueness of the infinite cluster is equivalent to nondecay of connectivity (long-range order of the process). The authors then derive applications concerning uniqueness in Kazhdan groups and in wreath products and inequalities for \(p_u\) (the infimum of \(p\) in the uniqueness phase). Crucial techniques for the proofs are the mass-transport principle and stationarity of delayed simple random walk.
    0 references
    finite energy
    0 references
    Cayley graph
    0 references
    Kazhdan group
    0 references
    wreath product
    0 references
    connectivity
    0 references
    percolation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references