A homological upper bound on critical probabilities for hyperbolic percolation
classification
🧮 math.PR
math.CO
keywords
graphspercolationboundcriticalhyperbolicinfiniteprobabilitiesupper
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.