Critical percolation on any quasi-transitive graph of exponential growth has no infinite clusters (Q309776)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Critical percolation on any quasi-transitive graph of exponential growth has no infinite clusters |
scientific article; zbMATH DE number 6624612
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Critical percolation on any quasi-transitive graph of exponential growth has no infinite clusters |
scientific article; zbMATH DE number 6624612 |
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
0.8647236227989197
0 references
0.8555116653442383
0 references
0.8302773833274841
0 references
0.8167609572410583
0 references
