Counterexamples for percolation on unimodular random graphs
Probability
2017-10-10 v1
Abstract
We construct an example of a bounded degree, nonamenable, unimodular random rooted graph with for Bernoulli bond percolation, as well as an example of a bounded degree, unimodular random rooted graph with but with an infinite cluster at criticality. These examples show that two well-known conjectures of Benjamini and Schramm are false when generalised from transitive graphs to unimodular random rooted graphs.
Cite
@article{arxiv.1710.03003,
title = {Counterexamples for percolation on unimodular random graphs},
author = {Omer Angel and Tom Hutchcroft},
journal= {arXiv preprint arXiv:1710.03003},
year = {2017}
}
Comments
20 pages, 3 figures