  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.
