Restoring site percolation on a damaged square lattice
Abstract
We study how to restore site percolation on a damaged square lattice with nearest neighbor (N2) interactions. Two strategies are suggested for a density x of destroyed sites by a random attack at pc. In the first one, a density y of new sites are created with longer range interactions, either next nearest neighbor (N3) or next next nearest neighbor (N4). In the second one, new longer range interactions N3 or N4 are created for a fraction v of the remaining (pc-x) sites in addition to their N2 interactions. In both cases, the values of y and v are tuned in order to restore site percolation which then occurs at new percolation thresholds, respectively π3, π4, π23 and π24. Using Monte Carlo simulations the values of the pairs \y, π3 \, \y, π4\ and \v, π23\, \v, π24\ are calculated for the whole range 0≤ x ≤ pc(N2). Our schemes are applicable to all regular lattices.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.