arXiv · 0705.4551
Site Percolation on Planar $Φ^{3}$ Random Graphs
Abstract
In this paper, site percolation on random $Φ^{3}$ planar graphs is studied by Monte-Carlo numerical techniques. The method consists in randomly removing a fraction $q=1-p$ of vertices from graphs generated by Monte-Carlo simulations, where $p$ 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 $p_{c}$=0.7360(5). Moreover, critical exponents are compatible with those analytically known for bond percolation.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
J. -P. Kownacki. 2008-01-11. Site Percolation on Planar $Φ^{3}$ Random Graphs. https://doi.org/10.1103/physreve.77.021121
Cite the original work for its findings. Save a collection to share your selection of sources.