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 α is given in the form W(α)=Πi=1N p(qi), where p(q) is an arbitrary user function and qi 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).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.