Document

# Bond Percolation in Small-World Graphs with Power-Law Distribution

## File

LIPIcs.SAND.2023.3.pdf
• Filesize: 0.9 MB
• 22 pages

## Cite As

Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, and Isabella Ziccardi. Bond Percolation in Small-World Graphs with Power-Law Distribution. In 2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 257, pp. 3:1-3:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.SAND.2023.3

## Abstract

Full-bond percolation with parameter p is the process in which, given a graph, for every edge independently, we keep the edge with probability p and delete it with probability 1-p. Bond percolation is studied in parallel computing and network science to understand the resilience of distributed systems to random link failure and the spread of information in networks through unreliable links. Moreover, the full-bond percolation is equivalent to the Reed-Frost process, a network version of SIR epidemic spreading. We consider one-dimensional power-law small-world graphs with parameter α obtained as the union of a cycle with additional long-range random edges: each pair of nodes {u,v} at distance L on the cycle is connected by a long-range edge {u,v}, with probability proportional to 1/L^α. Our analysis determines three phases for the percolation subgraph G_p of the small-world graph, depending on the value of α. - If α < 1, there is a p < 1 such that, with high probability, there are Ω(n) nodes that are reachable in G_p from one another in 𝒪(log n) hops; - If 1 < α < 2, there is a p < 1 such that, with high probability, there are Ω(n) nodes that are reachable in G_p from one another in log^{𝒪(1)}(n) hops; - If α > 2, for every p < 1, with high probability all connected components of G_p have size 𝒪(log n).

## Subject Classification

##### ACM Subject Classification
• Theory of computation → Random network models
##### Keywords
• gossiping
• epidemics
• fault-tolerance
• network self-organization and formation
• complex systems
• social and transportation networks

## Metrics

• Access Statistics
• Total Accesses (updated on a weekly basis)
0

## References

1. Noga Alon, Benjamini Itai, and Stacey Alan. Percolation on finite graphs and isoperimetric inequalities. Annals of Probability, 32:1727-1745, 2004.
2. Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, and Isabella Ziccardi. Bond percolation in small-world graphs with power-law distribution. arXiv preprint, 2022. URL: https://arxiv.org/abs/2205.08774.
3. Luca Becchetti, Andrea E. F. Clementi, Riccardo Denni, Francesco Pasquale, Luca Trevisan, and Isabella Ziccardi. Percolation and epidemic processes in one-dimensional small-world networks - (extended abstract). In Proceedings of LATIN 2022: the 15th Latin American Symposium, volume 13568 of Lecture Notes in Computer Science, pages 476-492. Springer, 2022. URL: https://doi.org/10.1007/978-3-031-20624-5_29.
4. Itai Benjamini and Noam Berger. The diameter of long-range percolation clusters on finite cycles. Random Struct. Algorithms, 19(2):102-111, 2001. URL: https://doi.org/10.1002/rsa.1022.
5. Marek Biskup. On the scaling of the chemical distance in long-range percolation models. The Annals of Probability, 32(4):2938-2977, 2004. URL: https://doi.org/10.1214/009117904000000577.
6. Marek Biskup. Graph diameter in long-range percolation. Random Structures & Algorithms, 39(2):210-227, 2011. URL: https://doi.org/10.1002/rsa.20349.
7. Duncan S. Callaway, John E. Hopcroft, Jon Kleinberg, Mark E. J. Newman, and Steven H. Strogatz. Are randomly grown graphs really random? Phys. Rev. E, 64:041902, September 2001. URL: https://doi.org/10.1103/PhysRevE.64.041902.
8. Wei Chen, Laks Lakshmanan, and Carlos Castillo. Information and influence propagation in social networks. Synthesis Lectures on Data Management, 5:1-177, October 2013. URL: https://doi.org/10.2200/S00527ED1V01Y201308DTM037.
9. Hyeongrak Choi, Mihir Pant, Saikat Guha, and Dirk Englund. Percolation-based architecture for cluster state creation using photon-mediated entanglement between atomic memories. npj Quantum Information, 5(1):104, 2019.
10. Easley David and Kleinberg Jon. Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, USA, 2010.
11. Michele Garetto, Weibo Gong, and Donald F. Towsley. Modeling malware spreading dynamics. In Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30 - April 3, 2003, pages 1869-1879. IEEE Computer Society, 2003. URL: https://doi.org/10.1109/INFCOM.2003.1209209.
12. Anna R. Karlin, Greg Nelson, and Hisao Tamaki. On the fault tolerance of the butterfly. In Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing, pages 125-133, 1994.
13. David Kempe, Jon Kleinberg, and Éva Tardos. Maximizing the spread of influence through a social network. Theory of Computing, 11(4):105-147, 2015. URL: https://doi.org/10.4086/toc.2015.v011a004.
14. Harry Kesten. The critical probability of bond percolation on the square lattice equals 1/2. Communications in mathematical physics, 74(1):41-59, 1980.
15. Jon Kleinberg. Navigation in a small world. Nature, 406:845, 2000.
16. Alexander Kott and Igor Linkov. Cyber resilience of systems and networks. Springer, 2019.
17. Rémi Lemonnier, Kevin Seaman, and Nicolas Vayatis. Tight bounds for influence in diffusion networks and application to bond percolation and epidemiology. In Proceedings of the 27th International Conference on Neural Information Processing Systems - Volume 1, NIPS'14, pages 846-854, Cambridge, MA, USA, 2014. MIT Press.
18. Cristopher Moore and Mark E. J. Newman. Epidemics and percolation in small-world networks. Physical Review E, 61(5):5678, 2000.
19. Cristopher Moore and Mark E. J. Newman. Exact solution of site and bond percolation on small-world networks. Phys. Rev. E, 62:7059-7064, November 2000. URL: https://doi.org/10.1103/PhysRevE.62.7059.
20. Charles M. Newman and Lawrence S. Schulman. One dimensional 1/|j-i|^s percolation models: The existence of a transition for s ≦ 2. Communications in Mathematical Physics, 104(4):547-571, 1986.
21. Mark E. J. Newman and Duncan J. Watts. Scaling and percolation in the small-world network model. Physical review E, 60(6):7332, 1999.
22. Romualdo Pastor-Satorras, Claudio Castellano, Piet Van Mieghem, and Alessandro Vespignani. Epidemic processes in complex networks. Rev. Mod. Phys., 87:925-979, August 2015. URL: https://doi.org/10.1103/RevModPhys.87.925.
23. Vinod K.S. Shante and Scott Kirkpatrick. An introduction to percolation theory. Advances in Physics, 20(85):325-357, 1971. URL: https://doi.org/10.1080/00018737100101261.
24. Wei Wang, Ming Tang, H Eugene Stanley, and Lidia A Braunstein. Unification of theoretical approaches for epidemic spreading on complex networks. Reports on Progress in Physics, 80(3):036603, February 2017. URL: https://doi.org/10.1088/1361-6633/aa5398.
25. Duncan J. Watts and Steven H. Strogatz. Collective dynamics of "small-world" networks. Nature, 393(6684):440-442, 1998.
26. Tongfeng Weng, Michael Small, Jie Zhang, and Pan Hui. Lévy walk navigation in complex networks: A distinct relation between optimal transport exponent and network dimension. Scientific Reports, 5(1):17309, 2015.
X

Feedback for Dagstuhl Publishing