Defining statistical ensembles of random graphs
Statistical Mechanics
2007-05-23 v3 Disordered Systems and Neural Networks
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 so-called scale-free networks.
Cite
@article{arxiv.cond-mat/0110574,
title = {Defining statistical ensembles of random graphs},
author = {A. Krzywicki},
journal= {arXiv preprint arXiv:cond-mat/0110574},
year = {2007}
}
Comments
11 latex pages, 4 eps figures, talk at the workshop "Discrete random geometries and quantum gravity", Utrecht, October 2001, cosmetic corrections