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 |
Changed an Item |
||
| 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 | |||
Revision as of 23:45, 27 June 2023
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
