Generating Connected Random Graphs

06/29/2018

∙

by   Caitlin Gray, et al.

∙

0

∙

share

We present an algorithm to produce connected random graphs using a Metropolis-Hastings framework. The algorithm extends to a general framework for sampling from a known distribution of graphs, conditioned on a desired property. We demonstrate the method to generate connected spatially embedded random graphs, specifically the well known Waxman network, and illustrate the convergence and practicalities of the algorithm.