arXiv · cond-mat/0206150
Maximal entropy random networks with given degree distribution
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
M. Bauer, D. Bernard. 2002-06-10. Maximal entropy random networks with given degree distribution. https://arxiv.org/abs/cond-mat/0206150
Cite the original work for its findings. Save a collection to share your selection of sources.