A homological upper bound on critical probabilities for hyperbolic percolation

Understand

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.