2017
DOI: 10.1103/physreve.96.042116
|View full text |Cite
|
Sign up to set email alerts
|

Percolation thresholds in hyperbolic lattices

Abstract: We use invasion percolation to compute numerical values for bond and site percolation thresholds p_{c} (existence of an infinite cluster) and p_{u} (uniqueness of the infinite cluster) of tesselations {P,Q} of the hyperbolic plane, where Q faces meet at each vertex and each face is a P-gon. Our values are accurate to six or seven decimal places, allowing us to explore their functional dependency on P and Q and to numerically compute critical exponents. We also prove rigorous upper and lower bounds for p_{c} an… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

2
28
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 17 publications
(30 citation statements)
references
References 39 publications
2
28
0
Order By: Relevance
“…The limit (1) has been established rigorously for invasion bond percolation in Z 2 [10], but it is believed to hold on general lattices. Moreover, it appears to be an excellent numerical estimator for p c , and in [12] we used it to estimate p c to high precision on hyperbolic lattices. Based on these facts, we estimate p c by extrapolating the measured values N/B(N) to N = ∞.…”
Section: Measuring the Thresholdmentioning
confidence: 99%
See 1 more Smart Citation
“…The limit (1) has been established rigorously for invasion bond percolation in Z 2 [10], but it is believed to hold on general lattices. Moreover, it appears to be an excellent numerical estimator for p c , and in [12] we used it to estimate p c to high precision on hyperbolic lattices. Based on these facts, we estimate p c by extrapolating the measured values N/B(N) to N = ∞.…”
Section: Measuring the Thresholdmentioning
confidence: 99%
“…We find that the convergence of this estimator is almost as good on d-dimensional lattices as it is on the tree. As in [12] we assume the form…”
Section: Measuring the Thresholdmentioning
confidence: 99%
“…However, the relevance of extremal animals in this setting to other extremal combinatorial problems has already been established. These include optimal disk packing problems [4], the calculation of Cheeger constants [9], the establishment of the exponential growth constant of regular hyperbolic tessellations [13], and the implementation of algorithms to sample certain hyperbolic animals to approximate hyperbolic percolation thresholds [22].…”
Section: Introductionmentioning
confidence: 99%

Extremal $\{p, q\}$-Animals

Malen,
Roldán,
Toalá-Enríquez
2021
Preprint
“…Several works have studied percolation [26][27][28][44][45][46][47] and the Ising and Potts models [48,49] on other hierarchical networks, finding both continuous and discontinous phase transitions. However most of the results on percolation in hyperbolic networks [50,51] are restricted to d = 2 spaces. Here we explore how the scenario change in dimension d = 3 and we ad-dress the general question whether the nature of the transition changes with the dimension of the manifold.…”
Section: Introductionmentioning
confidence: 99%