Percolation Critical Exponents in Scale-Free Networks
Reuven Cohen, Daniel ben-Avraham, Shlomo Havlin
Abstract
We study the behavior of scale-free networks, having connectivity distribution P(k) k-a, close to the percolation threshold. We show that for networks with 3<a<4, known to undergo a transition at a finite threshold of dilution, the critical exponents are different than the expected mean-field values of regular percolation in infinite dimensions. Networks with 2<a<3 possess only a percolative phase. Nevertheless, we show that in this case percolation critical exponents are well defined, near the limit of extreme dilution (where all sites are removed), and that also then the exponents bear a strong a-dependence. The regular mean-field values are recovered only for a>4.
Create a lesson
Related papers
The Stone-Wales trefoil: a new topological defect in graphene
M. V. Kondrin, Y. B. Lebed, V. V. Brazhkin
Short-Range Vector Spin Glasses: Parisi Hierarchies and Real-Space Ultrametricity
Akash Vijay, Jaewon Kim, Jong Yeon Lee
Lyapunov spectrum of random neural networks
David G. Clark
Revealing more on complex energy landscapes by passing less local information: Cavity approach with trust region in non-convex optimization problems
Zhiqi Xu, Chi Ho Yeung
Predicting activation-barrier and plasticity-onset statistics in a model of glasses
Makoto Suda, Edan Lerner, Eran Bouchbinder
Classifications in modular restricted Boltzmann machines
Elena Agliari, Andrea Lepre, Edoardo Roscani