Dresden 2006 – wissenschaftliches Programm
Bereiche | Tage | Auswahl | Suche | Downloads | Hilfe
DY: Dynamik und Statistische Physik
DY 12: Statistical Physics of Complex Networks II
DY 12.4: Vortrag
Montag, 27. März 2006, 11:45–12:00, H\"UL 186
A Program Generating Homogeneous Random Graphs with Given Weights — •Leszek Bogacz1, Zdzisław Burda2, Wolfhard Janke1, and Bartłomiej Wacław2 — 1Institut für Theoretische Physik, Universität Leipzig, Augustusplatz 10/11, 04109 Leipzig, Germany — 2Institute of Physics, Jagellonian University, Reymonta 4, 30-059 Krakow, Poland
We present a program package [1] 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).
Its functionality will be explained in the talk with a few simple but characteristic examples.
[1] L. Bogacz, Z. Burda, W. Janke, and B. Wacław, cond-mat/0506330, to appear in Comp. Phys. Comm. (in print).