Maximal entropy random networks with given degree distribution

Simple item page
dc.creatorBauer, M.
dc.creatorBernard, D.
dc.date2002-06-10
dc.date.accessioned2026-07-07T02:45:47Z
dc.date.available2026-07-07T02:45:47Z
dc.descriptionUsing 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.
dc.description22 pages, LateX, no figure
dc.identifierhttps://arxiv.org/abs/cond-mat/0206150
dc.identifierhttp://arxiv.org/abs/cond-mat/0206150
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/19429
dc.subjectDisordered Systems and Neural Networks
dc.subjectStatistical Mechanics
dc.titleMaximal entropy random networks with given degree distribution
dc.typetext

Files

Collections

arXiv