Percolation threshold on planar Euclidean Gabriel Graphs
Statistical Mechanics
2014-06-04 v1
Abstract
In the present article, numerical simulations have been performed to find the bond and site percolation thresholds on two-dimensional Gabriel graphs (GG) for Poisson point processes. GGs belong to the family of proximity graphs and are discussed, e.g., in context of the construction of backbones for wireless ad-hoc networks. In order to find the critical points, finite-size scaling analyses have been performed for several observables. The critical exponents obtained this way verify that the associated universality class is that of standard percolation.
Cite
@article{arxiv.1406.0663,
title = {Percolation threshold on planar Euclidean Gabriel Graphs},
author = {Christoph Norrenbrock},
journal= {arXiv preprint arXiv:1406.0663},
year = {2014}
}
Comments
6 pages, 4 figures