Restoring site percolation on a damaged square lattice
Serge Galam, Krzysztof Malarz
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.
Create a lesson
Related papers
Competitive scaling of small-subsystem-optimization heuristics for LABS
Ginger E. Lau, Adil A. Gangat
IceCube data for astrophysical neutrinos exhibit q-statistical behavior
Constantino Tsallis, Ugur Tirnakli
Robust Golden Ratio universality as a consequence of a circulant symmetry
Luka Paljk, Johannes Schmidt, Vladislav Popkov
Replica Transition at Measurement-Altered Ising Criticality
Kabir Khanna, Sara Murciano, Romain Vasseur
Scalene Yang-Baxter triples realize all nearest-neighbour Hamiltonians with global additive symmetries
Pramod Padmanabhan, Somnath Maity, Akash Sinha et al.
Graph-theoretic framework for semi-Markov networks: transient and stationary occupation probabilities, hitting times and weak ergodicity breaking
Julian Voits