Abstract

Percolation on complex networks is used both as a model for dynamics on networks, such as network robustness or epidemic spreading, and as a benchmark for our models of networks, where our ability to predict percolation measures our ability to describe the networks themselves. In many applications, correctly identifying the phase transition of percolation on real-world networks is of critical importance. Unfortunately, this phase transition is obfuscated by the finite size of real systems, making it hard to distinguish finite size effects from the inaccuracy of a given approach that fails to capture important structural features. Here, we borrow the perspective of smeared phase transitions and argue that many observed discrepancies are due to the complex structure of real networks rather than to finite size effects only. In fact, several real networks often used as benchmarks feature a smeared phase transition where inhomogeneities in the topological distribution of the order parameter do not vanish in the thermodynamic limit. We find that these smeared transitions are sometimes better described as sequential phase transitions within correlated subsystems. Our results shed light not only on the nature of the percolation transition in complex systems, but also provide two important insights on the numerical and analytical tools we use to study them. First, we propose a measure of local susceptibility to better detect both clean and smeared phase transitions by looking at the topological variability of the order parameter. Second, we highlight a shortcoming in state-of-the-art analytical approaches such as message passing, which can detect smeared transitions but not characterize their nature.

Highlights

  • Percolation on networks is simple to define [1]

  • We borrow the perspective of smeared phase transitions and argue that observed discrepancies may be due to the complex mesoscopic structure of real networks rather than to finite-size effects only

  • Because of the breadth and depth of its applications, percolation has become a canonical problem of network science where it reflects the current state of the field: Percolation can be solved on many ordered lattices or random networks, but it is much more complicated on the real, complex networks that exist between order and randomness

Read more

Summary

INTRODUCTION

Percolation on networks is simple to define [1]. Given an original network structure, predict the size distribution of connected components if edges (bond percolation) or nodes (site percolation) are randomly removed such that, on average, only a fraction p remain and are said to be “occupied.” Connected components are groups of nodes that are reachable from one another by following occupied edges, and the relative size of the largest component is a natural order parameter for the connectivity of the system. By using the relative size of the GCC as the order parameter, the percolation threshold pc marks the transition between two phases: (1) A disconnected phase where connectivity does not scale with system size such that the size of the largest connected component vanishes compared to the size of the system and (2) a connected phase where connectivity scales with system size such that the GCC contains a nonvanishing fraction of all nodes even in an infinite system. There is a clean phase transition where the order parameter goes from zero to a nonzero value at pc, in practice this transition is masked by noise due to the finite size of real networks. This paper studies our ability to detect and characterize the percolation phase transition in complex networks as follows. We propose a measure of local susceptibility to potentially identify smeared transitions

PHASE TRANSITION DETECTION
SMEARED PHASE TRANSITIONS
Empirical results
Synthetic results
The thermodynamic limit and message passing approaches to percolation
Local susceptibility
Findings
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.