A program generating homogeneous random graphs with given weights
From MaRDI portal
Abstract: We present a program package which generates homogeneous random graphs with probabilities prescribed by the user. The statistical weight of a labeled graph is given in the form , where is an arbitrary user function and 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).
Recommendations
Cites work
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- scientific article; zbMATH DE number 1528424 (Why is no real title available?)
- scientific article; zbMATH DE number 2121582 (Why is no real title available?)
- Emergence of Scaling in Random Networks
- Equation of state calculations by fast computing machines
- Evolution of scale-free random graphs: Potts model formulation
- Principles of statistical mechanics of uncorrelated random networks
- Statistical mechanics of complex networks
- The Structure and Function of Complex Networks
This page was built for publication: A program generating homogeneous random graphs with given weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709838)