Percolation on correlated networks
classification
❄️ cond-mat.stat-mech
math.PRphysics.soc-ph
keywords
percolationcriticalcorrelationsdegree-degreenetworkssingularitiesassortativecorrelated
read the original abstract
We reconsider the problem of percolation on an equilibrium random network with degree-degree correlations between nearest-neighboring vertices focusing on critical singularities at a percolation threshold. We obtain criteria for degree-degree correlations to be irrelevant for critical singularities. We present examples of networks in which assortative and disassortative mixing leads to unusual percolation properties and new critical exponents.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.