Universality class for bootstrap percolation with $m=3$ on the cubic lattice

Physics – Condensed Matter – Statistical Mechanics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

11 pages; 4 figures; to appear in Int. J. Mod. Phys. C

Scientific paper

We study the $m=3$ bootstrap percolation model on a cubic lattice, using Monte Carlo simulation and finite-size scaling techniques. In bootstrap percolation, sites on a lattice are considered occupied (present) or vacant (absent) with probability $p$ or $1-p$, respectively. Occupied sites with less than $m$ occupied first-neighbours are then rendered unoccupied; this culling process is repeated until a stable configuration is reached. We evaluate the percolation critical probability, $p_c$, and both scaling powers, $y_p$ and $y_h$, and, contrarily to previous calculations, our results indicate that the model belongs to the same universality class as usual percolation (i.e., $m=0$). The critical spanning probability, $R(p_c)$, is also numerically studied, for systems with linear sizes ranging from L=32 up to L=480: the value we found, $R(p_c)=0.270 \pm 0.005$, is the same as for usual percolation with free boundary conditions.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Universality class for bootstrap percolation with $m=3$ on the cubic lattice 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 Universality class for bootstrap percolation with $m=3$ on the cubic lattice, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Universality class for bootstrap percolation with $m=3$ on the cubic lattice will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-309619

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.