A homological upper bound on critical probabilities for hyperbolic percolation
Probability
2016-11-29 v2 Combinatorics
Abstract
We study bond percolation for a family of infinite hyperbolic graphs. We relate percolation to the appearance of homology in finite versions of these graphs. As a consequence, we derive an upper bound on the critical probabilities of the infinite graphs.
Cite
@article{arxiv.1408.4031,
title = {A homological upper bound on critical probabilities for hyperbolic percolation},
author = {Nicolas Delfosse and Gilles Zémor},
journal= {arXiv preprint arXiv:1408.4031},
year = {2016}
}