Percolation on complex networks: Theory and application
Ming Li, Run-Ran Liu, Linyuan L\"u, Mao-Bin Hu, Shuqi Xu, Yi-Cheng, Zhang

TL;DR
This paper provides an overview of percolation theory's role in understanding complex networks, covering its foundational concepts, analytical methods, and diverse applications across various scientific fields.
Contribution
It offers a comprehensive review of percolation theory in network science, highlighting recent advances and open questions in the field.
Findings
Percolation theory explains the emergence of giant clusters in networks.
Analytical methods like mean-field theory are used to study network robustness.
Percolation insights aid in understanding epidemic spreading and community detection.
Abstract
In the last two decades, network science has blossomed and influenced various fields, such as statistical physics, computer science, biology and sociology, from the perspective of the heterogeneous interaction patterns of components composing the complex systems. As a paradigm for random and semi-random connectivity, percolation model plays a key role in the development of network science and its applications. On the one hand, the concepts and analytical methods, such as the emergence of the giant cluster, the finite-size scaling, and the mean-field method, which are intimately related to the percolation theory, are employed to quantify and solve some core problems of networks. On the other hand, the insights into the percolation theory also facilitate the understanding of networked systems, such as robustness, epidemic spreading, vital node identification, and community detection.…
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.
