Maximal entropy random networks with given degree distribution
M. Bauer, D. Bernard
Abstract
Using a maximum entropy principle to assign a statistical weight to any graph, we introduce a model of random graphs with arbitrary degree distribution in the framework of standard statistical mechanics. We compute the free energy and the distribution of connected components. We determine the size of the percolation cluster above the percolation threshold. The conditional degree distribution on the percolation cluster is also given. We briefly present the analogous discussion for oriented graphs, giving for example the percolation criterion.
Create a lesson
Related papers
Orbital cancellation and reentrant localization in a quasiperiodic trimer ladder
Xin Wang, Pei-Jie Chang, Quanfeng Lu et al.
Quantum Localization in Geometric Complex Networks
Jan Lewenstein-Sanpera, Tobias Grass, M. Àngeles Serrano et al.
Eigenstate transitions and critical transport in 3D Aubry-André model
Pragna Das, Lev Vidmar, Miroslav Hopjan
Weyl's theorem and the theoretical origin of Boson peak in two-dimensional scalar spring network
Cunyuan Jiang
On physical implementability of reinforcement-learning-driven reasoning
Eiji Konishi
The Stone-Wales trefoil: a new topological defect in graphene
M. V. Kondrin, Y. B. Lebed, V. V. Brazhkin