arXiv Analytics

Sign in

arXiv:1004.1251 [math.PR]AbstractReferencesReviewsResources

Long-range percolation on the hierarchical lattice

Vyacheslav Koval, Ronald Meester, Pieter Trapman

Published 2010-04-08Version 1

We study long-range percolation on the hierarchical lattice of order $N$, where any edge of length $k$ is present with probability $p_k=1-\exp(-\beta^{-k} \alpha)$, independently of all other edges. For fixed $\beta$, we show that the critical value $\alpha_c(\beta)$ is non-trivial if and only if $N < \beta < N^2$. Furthermore, we show uniqueness of the infinite component and continuity of the percolation probability and of $\alpha_c(\beta)$ as a function of $\beta$. This means that the phase diagram of this model is well understood.

Comments: 24 pages
Journal: Electronic Journal of Probability [Online], 17 (2012): 1-21
Categories: math.PR
Subjects: 60K35, 82B28
Related articles: Most relevant | Search more
arXiv:0803.1766 [math.PR] (Published 2008-03-12, updated 2008-06-01)
Copolymers at selective interfaces: new bounds on the phase diagram
arXiv:1401.0409 [math.PR] (Published 2014-01-02, updated 2014-09-26)
Inhomogeneous Long-Range Percolation for Real-Life Network Modeling
arXiv:2309.09389 [math.PR] (Published 2023-09-17)
A limit law for the maximum of subcritical DG-model on a hierarchical lattice