Long-range percolation on the hierarchical lattice
Probability
2013-05-01 v1
Abstract
We study long-range percolation on the hierarchical lattice of order , where any edge of length is present with probability , independently of all other edges. For fixed , we show that the critical value is non-trivial if and only if . Furthermore, we show uniqueness of the infinite component and continuity of the percolation probability and of as a function of . This means that the phase diagram of this model is well understood.
Cite
@article{arxiv.1004.1251,
title = {Long-range percolation on the hierarchical lattice},
author = {Vyacheslav Koval and Ronald Meester and Pieter Trapman},
journal= {arXiv preprint arXiv:1004.1251},
year = {2013}
}
Comments
24 pages