A program generating homogeneous random graphs with given weights

Abstract

We present a program package which generates homogeneous random graphs with probabilities prescribed by the user. The statistical weight of a labeled graph $\alpha$ is given in the form $W(\alpha )={\prod }_{i=1}^{N}p(q_i)$, where $p(q)$ is an arbitrary user function and $q_i$ are the degrees of the graph nodes. The program can be used to generate two types of graphs (simple graphs and pseudo-graphs) from three types of ensembles (micro-canonical, canonical and grand-canonical).

19 pages, 3 figures

References in corpus (4)

• The statistical mechanics of networks
• Cut-offs and finite size effects in scale-free networks
• Evolution of scale-free random graphs: Potts model formulation
• Statistical mechanics of random graphs

Cited by in corpus (2)

• Correlations in connected random graphs
• Approaching the thermodynamic limit in equilibrated scale-free networks