Critical percolation on any quasi-transitive graph of exponential growth has no infinite clusters (Q309776): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / review text | |||
Quasi-transitive graphs can be thought of as natural generalisations of \(\mathbb{Z}^d\). In this paper, the author considers bond percolation in a quasi-transitive graph of exponential growth and shows that there are no infinite clusters almost surely at the critical probability. The main lemma relates the decay of the connection probability with the size of the graph distance ball. | |||
Property / review text: Quasi-transitive graphs can be thought of as natural generalisations of \(\mathbb{Z}^d\). In this paper, the author considers bond percolation in a quasi-transitive graph of exponential growth and shows that there are no infinite clusters almost surely at the critical probability. The main lemma relates the decay of the connection probability with the size of the graph distance ball. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Arvind Ayyer / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 60K35 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 60K37 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6624612 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
critical percolation | |||
Property / zbMATH Keywords: critical percolation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
quasi-transitive graph | |||
Property / zbMATH Keywords: quasi-transitive graph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
exponential growth | |||
Property / zbMATH Keywords: exponential growth / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2963735720 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1605.05301 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sharpness of the phase transition in percolation models / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sharpness of the phase transition and exponential decay of the subcritical cluster size for percolation on quasi-transitive graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Amenability via random walks. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Critical percolation on any nonamenable group has no infinite clusters / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4946127 / 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: Density and uniqueness in percolation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Elementary amenable groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new proof of the sharpness of the phase transition for Bernoulli percolation and the Ising model / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Uniqueness of the infinite component in a random graph with applications to percolation and spin glasses / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4524280 / 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: Q4850458 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Poisson boundaries of lamplighter groups: proof of the Kaimanovich-Vershik conjecture / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Probability on Trees and Networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimal spanning forests / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Growth of finitely generated solvable groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Infinite clusters in percolation models / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Critical percolation on certain nonunimodular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the critical percolation probabilities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Percolation on nonunimodular transitive graphs / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 13:49, 12 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Critical percolation on any quasi-transitive graph of exponential growth has no infinite clusters |
scientific article |
Statements
Critical percolation on any quasi-transitive graph of exponential growth has no infinite clusters (English)
0 references
7 September 2016
0 references
Quasi-transitive graphs can be thought of as natural generalisations of \(\mathbb{Z}^d\). In this paper, the author considers bond percolation in a quasi-transitive graph of exponential growth and shows that there are no infinite clusters almost surely at the critical probability. The main lemma relates the decay of the connection probability with the size of the graph distance ball.
0 references
critical percolation
0 references
quasi-transitive graph
0 references
exponential growth
0 references
0 references
0 references