English

Restoring site percolation on a damaged square lattice

Statistical Mechanics 2007-05-23 v1 Disordered Systems and Neural Networks

Abstract

We study how to restore site percolation on a damaged square lattice with nearest neighbor (N2^2) interactions. Two strategies are suggested for a density xx of destroyed sites by a random attack at pcp_c. In the first one, a density yy of new sites are created with longer range interactions, either next nearest neighbor (N3^3) or next next nearest neighbor (N4^4). In the second one, new longer range interactions N3^3 or N4^4 are created for a fraction vv of the remaining (pcx)(p_c-x) sites in addition to their N2^2 interactions. In both cases, the values of yy and vv are tuned in order to restore site percolation which then occurs at new percolation thresholds, respectively π3\pi_3, π4\pi_4, π23\pi_{23} and π24\pi_{24}. Using Monte Carlo simulations the values of the pairs {y,π3}\{y, \pi_3 \}, {y,π4}\{y, \pi_4\} and {v,π23}\{v, \pi_{23}\}, {v,π24}\{v, \pi_{24}\} are calculated for the whole range 0xpc(N2)0\leq x \leq p_c(\text{N}^2). Our schemes are applicable to all regular lattices.

Keywords

Cite

@article{arxiv.cond-mat/0408359,
  title  = {Restoring site percolation on a damaged square lattice},
  author = {Serge Galam and Krzysztof Malarz},
  journal= {arXiv preprint arXiv:cond-mat/0408359},
  year   = {2007}
}

Comments

5 pages, revtex4

R2 v1 2026-07-22T11:06:50.750Z