Critical percolation on any nonamenable group has no infinite clusters (Q1568289): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / reviewed by
 
Property / reviewed by: Nicko G. Gamkrelidze / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Nicko G. Gamkrelidze / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1214/aop/1022677450 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3196309622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees and amenable equivalence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness of the infinite cluster and continuity of connectivity functions for short and long range percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut sets and normed cohomology with applications to percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group-invariant percolation on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Percolation beyond \(\mathbb{Z}^ d\), many questions and a few answers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conformal invariance of Voronoi percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Density and uniqueness in percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stochastic random-cluster process and the uniqueness of random-cluster measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5753352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The random-cluster model on a homogeneous tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite clusters in dependent automorphism invariant percolation on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity of uniqueness for percolation on Cayley graphs: All infinite clusters are born simultaneously / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4848553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5734790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The critical probability of bond percolation on the square lattice equals 1/2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Percolation on Fuchsian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indistinguishability of percolation clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite clusters in percolation models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability properties of a flow process in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical behavior of percolation and Markov fields on branching planes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:47, 29 May 2024

scientific article
Language Label Description Also known as
English
Critical percolation on any nonamenable group has no infinite clusters
scientific article

    Statements

    Critical percolation on any nonamenable group has no infinite clusters (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 May 2001
    0 references
    The authors show that independent percolation on any Cayley graph of a nonamenable group has no infinite components at the critical parameter. This result was obtained by them earlier as a corollary of the general study of group-invariant percolation. The goal here is to present a simpler self-contained proof that easily extends to quasi-transitive graphs with a unimodular automorphism group. The key tool is a ``mass-transport'' method, which is a technique of averaging in nonamenable settings.
    0 references
    0 references
    0 references
    0 references
    0 references
    percolation
    0 references
    Cayley graphs
    0 references
    0 references