Site Percolation on Planar $Φ^{3}$ Random Graphs

Details Site Percolation on Planar $Φ^{3}$ Random Graphs Site Percolation on Planar $Φ^{3}$ Random Graphs

2007-05-31

arxiv.org/abs/0705.4551v3

Phys.Rev.E77:021121,2008

Physics

Condensed Matter

Statistical Mechanics

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

Scientific paper

10.1103/PhysRevE.77.021121

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.

Affiliated with

Also associated with

No associations

Rating

Site Percolation on Planar $Φ^{3}$ Random Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Site Percolation on Planar $Φ^{3}$ Random Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Site Percolation on Planar $Φ^{3}$ Random Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-288689