Critical percolation on any quasi-transitive graph of exponential growth has no infinite clusters (Q309776): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1605.05301 / rank | |||
Normal rank | |||
Revision as of 12:26, 18 April 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
