Site Percolation on Planar Random Graphs
arXiv:0705.4551 · doi:10.1103/PhysRevE.77.021121
Abstract
In this paper, site percolation on random planar graphs is studied by Monte-Carlo numerical techniques. The method consists in randomly removing a fraction of vertices from graphs generated by Monte-Carlo simulations, where is the occupation probability. The resulting graphs are made of clusters of occupied sites. By measuring several properties of their distribution, it is shown that percolation occurs for an occupation probability above a percolation threshold =0.7360(5). Moreover, critical exponents are compatible with those analytically known for bond percolation.
8 pages, 10 figures. Accepted in Phys. Rev. E ; published version
References in corpus (16)
- Statistical mechanics of complex networks
- Network robustness and fragility: Percolation on random graphs
- 2D Gravity and Random Matrices
- Percolation Critical Exponents in Scale-Free Networks
- Transfer Matrix Formalism for Two-Dimensional Quantum Gravity and Fractal Structures of Space-time
- Scaling in quantum gravity
- World-Sheet Geometry and Baby Universes in 2-D Quantum Gravity
- Percolation in Hierarchical Scale-Free Nets
- Percolation transition in networks with degree-degree correlation
- Scaling and the Fractal Geometry of Two-Dimensional Quantum Gravity
- Predictions of bond percolation thresholds for the kagomé and Archimedean lattices
- Numerical evaluation of the upper critical dimension of percolation in scale-free networks
- Frustration effects in antiferromagnets on planar random graphs
- Towards a Non-Perturbative Renormalization of Euclidean Quantum Gravity
- Percolation on Strings and the Cover-up of the c=1 Disaster
- Random Geometries and Real Space Renormalization Group