A program generating homogeneous random graphs with given weights
نویسندگان
چکیده
We present a program package to generate homogeneous random graphs with probabilities prescribed by the user. The statistical weight of a labeled graph α is given in the form W(α)=∏Ni=1 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).
منابع مشابه
Scale-Free properties of weighted random graphs: Minimum Spanning Trees and Percolation
We study Erdös-Rényi random graphs with random weights associated with each link. In our approach, nodes connected by links having weights below the percolation threshold form clusters, and each cluster merges into a single node, thus generating a new “clusters network”. We show that this network is scale-free with λ = 2.5. Furthermore, we show that optimization causes the percolation threshold...
متن کاملAn almost-linear time algorithm for uniform random spanning tree generation
We give an mβ-time algorithm for generating a uniformly random spanning tree in an undirected, weighted graph with max-to-min weight ratio β. We also give an m −o(1)time algorithm for generating a random spanning tree with total variation distance from the true uniform distribution. Our second algorithm’s runtime does not depend on the edge weights. Our mβ-time algorithm is the first almost-lin...
متن کاملInteractive Random Graph Generation with Evolutionary Algorithms
This paper introduces an interactive system called GraphCuisine that lets users steer an Evolutionary Algorithm (EA) to create random graphs that match user-specified measures. Generating random graphs with particular characteristics is crucial for evaluating graph algorithms, layouts and visualization techniques. Current random graph generators provide limited control of the final characterist...
متن کاملGenerating Realistic Labelled, Weighted Random Graphs
Generative algorithms for random graphs have yielded insights into the structure and evolution of real-world networks. Most networks exhibit a well-known set of properties, such as heavy-tailed degree distributions, clustering and community formation. Usually, random graph models consider only structural information, but many real-world networks also have labelled vertices and weighted edges. I...
متن کاملA Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
Random graphs with a given degree sequence are a useful model capturing several features absent in the classical Erdős-Rényi model, such as dependent edges and non-binomial degrees. In this paper, we use a characterization due to Erdős and Gallai to develop a sequential algorithm for generating a random labeled graph with a given degree sequence. The algorithm is easy to implement and allows su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Physics Communications
دوره 173 شماره
صفحات -
تاریخ انتشار 2005