2007/05/31 by J. -P. Kownacki, J.-P. Kownacki
Mathematics · Physics and Astronomy · #Complex Network Analysis Techniques #Stochastic processes and statistical mechanics #Theoretical and Computational Physics #cond-mat.stat-mech #hep-lat
paper · pdf · doi:10.1103/physreve.77.021121
published as Phys.Rev.E77:021121,2008 · 8 pages, 10 figures. Accepted in Phys. Rev. E ; published version
arxiv created 2008/01/11 · openalex publication_date 2008/02/25 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
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.