Location of Repository

Defining statistical ensembles of random graphs. arXiv cond-mat

By André Krzywicki


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. LPT Orsay 01/10

Year: 2001
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://arxiv.org/pdf/cond-mat/... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.