Site Percolation on Planar ${\Phi }^3$ Random Graphs

Abstract

In this paper, site percolation on random ${\Phi }^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.

8 pages, 10 figures. Accepted in Phys. Rev. E ; published version

References in corpus (3)

• Percolation transition in networks with degree-degree correlation
• Numerical evaluation of the upper critical dimension of percolation in scale-free networks
• Frustration effects in antiferromagnets on planar random graphs