Restoring site percolation on a damaged square lattice
Serge Galam, Krzysztof Malarz

TL;DR
This paper investigates methods to restore site percolation on a damaged square lattice by adding new sites or interactions, using Monte Carlo simulations to determine the thresholds for percolation under various strategies.
Contribution
It introduces two novel strategies for restoring percolation on damaged lattices by incorporating longer-range interactions and quantifies their effectiveness through simulation.
Findings
Percolation thresholds are shifted by adding longer-range interactions.
Restoration strategies depend on the fraction of new sites or interactions added.
Monte Carlo simulations provide quantitative thresholds for different scenarios.
Abstract
We study how to restore site percolation on a damaged square lattice with nearest neighbor (N) interactions. Two strategies are suggested for a density of destroyed sites by a random attack at . In the first one, a density of new sites are created with longer range interactions, either next nearest neighbor (N) or next next nearest neighbor (N). In the second one, new longer range interactions N or N are created for a fraction of the remaining sites in addition to their N interactions. In both cases, the values of and are tuned in order to restore site percolation which then occurs at new percolation thresholds, respectively , , and . Using Monte Carlo simulations the values of the pairs , and , are calculated for the whole range…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
