Defining statistical ensembles of random graphs
Abstract
The 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 socalled scalefree networks.
 Publication:

arXiv eprints
 Pub Date:
 October 2001
 arXiv:
 arXiv:condmat/0110574
 Bibcode:
 2001cond.mat.10574K
 Keywords:

 Condensed Matter  Statistical Mechanics;
 Condensed Matter  Disordered Systems and Neural Networks
 EPrint:
 11 latex pages, 4 eps figures, talk at the workshop "Discrete random geometries and quantum gravity", Utrecht, October 2001, cosmetic corrections