### Generating constrained random graphs using multiple edge switchesGenerating constrained random graphs using multiple edge switches

Access Restriction
Subscribed

 Author Tabourier, Lionel ♦ Roth, Camille ♦ Cointet, Jean-Philippe Source ACM Digital Library Content type Text Publisher Association for Computing Machinery (ACM) File Format PDF Copyright Year ©2012 Language English
 Subject Domain (in DDC) Computer science, information & general works ♦ Computer programming, programs & data Subject Keyword Markov chain mixing ♦ Random graphs ♦ Constrained graphs generation method ♦ Edge switching Abstract The generation of random graphs using edge swaps provides a reliable method to draw uniformly random samples of sets of graphs respecting some simple constraints (e.g., degree distributions). However, in general, it is not necessarily possible to access all graphs obeying some given constraints through a classical switching procedure calling on pairs of edges. Therefore, we propose to get around this issue by generalizing this classical approach through the use of higher-order edge switches. This method, which we denote by $“\textit{k}-edge$ switching,” makes it possible to progressively improve the covered portion of a set of constrained graphs, thereby providing an increasing, asymptotically certain confidence on the statistical representativeness of the obtained sample. ISSN 10846654 Age Range 18 to 22 years ♦ above 22 year Educational Use Research Education Level UG and PG Learning Resource Type Article Publisher Date 2011-12-01 Publisher Place New York e-ISSN 10846654 Journal Journal of Experimental Algorithmics (JEA) Volume Number 16 Page Count 15 Starting Page 1.1 Ending Page 1.15

#### Open content in new tab

Source: ACM Digital Library