2000 character limit reached
Long-range percolation on the hierarchical lattice
Published 8 Apr 2010 in math.PR | (1004.1251v1)
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 $N < \beta < N<sup>2$. 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.
Paper Prompts
Sign up for free to create and run prompts on this paper.