Percolation theory applied to measures of fragmentation in social networks
Yiping Chen, Gerald Paul, Reuven Cohen, Shlomo Havlin, Stephen P., Borgatti, Fredrik Liljeros, H.Eugene Stanley

TL;DR
This paper applies percolation theory to a new fragmentation measure F in social networks, comparing it with traditional measures, and finds F provides a more accurate reflection of network fragmentation near critical thresholds.
Contribution
It introduces and analyzes the measure F for network fragmentation, demonstrating its advantages over traditional percolation measures through analytical and numerical methods.
Findings
F relates to P_infinity as (1-F)^{1/2} after node removal
Near the percolation threshold, 1-F better indicates fragmentation
F and P_infinity show similar behavior in real social networks
Abstract
We apply percolation theory to a recently proposed measure of fragmentation for social networks. The measure is defined as the ratio between the number of pairs of nodes that are not connected in the fragmented network after removing a fraction of nodes and the total number of pairs in the original fully connected network. We compare with the traditional measure used in percolation theory, , the fraction of nodes in the largest cluster relative to the total number of nodes. Using both analytical and numerical methods from percolation, we study Erd\H{o}s-R\'{e}nyi (ER) and scale-free (SF) networks under various types of node removal strategies. The removal strategies are: random removal, high degree removal and high betweenness centrality removal. We find that for a network obtained after removal (all strategies) of a fraction of nodes above percolation…
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.
