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

Simple item page
dc.creatorKownacki, J. -P.
dc.date2007-05-31
dc.date2008-01-11
dc.date.accessioned2026-07-07T11:12:05Z
dc.date.available2026-07-07T11:12:05Z
dc.descriptionIn 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.
dc.description8 pages, 10 figures. Accepted in Phys. Rev. E ; published version
dc.identifierhttps://arxiv.org/abs/0705.4551
dc.identifierhttp://arxiv.org/abs/0705.4551
dc.identifierPhys.Rev.E77:021121,2008
dc.identifierdoi:10.1103/PhysRevE.77.021121
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/191264
dc.subjectStatistical Mechanics
dc.subjectHigh Energy Physics - Lattice
dc.titleSite Percolation on Planar $Φ^{3}$ Random Graphs
dc.typetext

Files

Collections

arXiv