Spread-out percolation in R^d
Loading...
Date
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
Let $X$ be either $Z^d$ or the points of a Poisson process in $R^d$ of intensity 1. Given parameters $r$ and $p$, join each pair of points of $X$ within distance $r$ independently with probability $p$. This is the simplest case of a `spread-out' percolation model studied by Penrose, who showed that, as $r\to\infty$, the average degree of the corresponding random graph at the percolation threshold tends to 1, i.e., the percolation threshold and the threshold for criticality of the naturally associated branching process approach one another. Here we show that this result follows immediately from of a general result of the authors on inhomogeneous random graphs.
9 pages. Title changed. Minor changes to text, including updated references to [3]. To appear in Random Structures and Algorithms
9 pages. Title changed. Minor changes to text, including updated references to [3]. To appear in Random Structures and Algorithms