Defining statistical ensembles of random graphs

Simple item page
dc.creatorKrzywicki, A.
dc.date2001-10-27
dc.date2001-11-26
dc.date.accessioned2026-07-07T02:43:17Z
dc.date.available2026-07-07T02:43:17Z
dc.descriptionThe problem of defining a statistical ensemble of random graphs with an arbitrary connectivity distribution is discussed. Introducing such an ensemble is a step towards uderstanding the geometry of wide classes of graphs independently of any specific model. This research was triggered by the recent interest in the so-called scale-free networks.
dc.description11 latex pages, 4 eps figures, talk at the workshop "Discrete random geometries and quantum gravity", Utrecht, October 2001, cosmetic corrections
dc.identifierhttps://arxiv.org/abs/cond-mat/0110574
dc.identifierhttp://arxiv.org/abs/cond-mat/0110574
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/18442
dc.subjectStatistical Mechanics
dc.subjectDisordered Systems and Neural Networks
dc.titleDefining statistical ensembles of random graphs
dc.typetext

Files

Collections

arXiv