Defining statistical ensembles of random graphs
classification
❄️ cond-mat.stat-mech
cond-mat.dis-nn
keywords
graphsdefiningensemblerandomstatisticalarbitraryclassesconnectivity
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.