Critical percolation on any quasi-transitive graph of exponential growth has no infinite clusters
View / Open Files
Authors
Hutchcroft, Tom
Publication Date
2016-09-01Journal Title
Comptes Rendus Mathematique (Academie des Sciences)
ISSN
0764-4442
Publisher
Elsevier
Volume
354
Issue
9
Pages
944-947
Type
Article
Metadata
Show full item recordCitation
Hutchcroft, T. (2016). Critical percolation on any quasi-transitive graph of exponential growth
has no infinite clusters. Comptes Rendus Mathematique (Academie des Sciences), 354 (9), 944-947. https://doi.org/10.1016/j.crma.2016.07.013
Abstract
We prove that critical percolation on any quasi-transitive graph of
exponential volume growth does not have a unique infinite cluster. This allows us to deduce from earlier results that critical percolation on any graph in this class does not have any infinite clusters. The result is new when the graph in question is either amenable or nonunimodular.
Keywords
math.PR, math.PR, math-ph, math.MP
Identifiers
External DOI: https://doi.org/10.1016/j.crma.2016.07.013
This record's URL: https://www.repository.cam.ac.uk/handle/1810/283543
Rights
Licence:
http://www.rioxx.net/licenses/all-rights-reserved
Statistics
Total file downloads (since January 2020). For more information on metrics see the
IRUS guide.
Recommended or similar items
The current recommendation prototype on the Apollo Repository will be turned off on 03 February 2023. Although the pilot has been fruitful for both parties, the service provider IKVA is focusing on horizon scanning products and so the recommender service can no longer be supported. We recognise the importance of recommender services in supporting research discovery and are evaluating offerings from other service providers. If you would like to offer feedback on this decision please contact us on: support@repository.cam.ac.uk