Spectral estimation of the percolation transition in clustered networks
There have been several spectral bounds for the percolation transition in networks, using spectrum of matrices associated with the network such as the adjacency matrix and the non-backtracking matrix. However they are far from being tight when the network is sparse and displays clustering or transitivity, which is represented by existence of short loops e.g. triangles. In this work, for the bond percolation, we first propose a message passing algorithm for calculating size of percolating clusters considering effects of triangles, then relate the percolation transition to the leading eigenvalue of a matrix that we name the triangle-non-backtracking matrix, by analyzing stability of the message passing equations. We establish that our method gives a tighter lower-bound to the bond percolation transition than previous spectral bounds, and it becomes exact for an infinite network with no loops longer than 3. We evaluate numerically our methods on synthetic and real-world networks, and discuss further generalizations of our approach to include higher-order sub-structures.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringSimilar Papers 제목 키워드 기반
Transfer learning of phase transitions in percolation and directed percolation
The latest advances of statistical physics have shown remarkable performance of machine learning in identifying phase transitions. In this paper, we apply domain adversarial neural network (DANN) based on transfer learni…
Transfer LearningFunctional Percolation: Criticality of Form and Function
Understanding how network structure constrains and enables information processing is a central problem in the statistical mechanics of interacting systems. Here we study random networks across the structural percolation …
Siamese Neural Network for Label-Efficient Critical Phenomena Prediction in 3D Percolation Models
Predicting critical phenomena from limited labeled data remains a challenging task in statistical physics. As percolation theory provides a canonical model for phase transitions with well-established critical exponents, …
Determination of the critical points for systems of directed percolation class using machine learning
Recently, machine learning algorithms have been used remarkably to study the equilibrium phase transitions, however there are only a few works have been done using this technique in the nonequilibrium phase transitions. …
Transfer LearningManifold Percolation: from generative model to Reinforce learning
Generative modeling is typically framed as learning mapping rules, but from an observer's perspective without access to these rules, the task becomes disentangling the geometric support from the probability distribution.…
Density EstimationDecision Making