Uniform Generation of Random Regular Graphs
نویسندگان
چکیده
منابع مشابه
Uniform Generation of Random Regular Graphs of Moderate Degree
We show how to generate k-regular graphs on n vertices uniformly at random in expected time O(nk3), provided k = O(n1/3). The algorithm employs a modification of a switching argument previously used to count such graphs asymptotically for k = o(n1/3). The asymptotic formula is re-derived, using the new switching argument. The method is applied also to graphs with given degree sequences, provide...
متن کاملUniform generation of random graphs with power-law degree sequences
We give a linear-time algorithm that approximately uniformly generates a randomsimple graph with a power-law degree sequence whose exponent is at least 2.8811.While sampling graphs with power-law degree sequence of exponent at least 3 is fairlyeasy, and many samplers work efficiently in this case, the problem becomes dramaticallymore difficult when the exponent drops below 3; ou...
متن کاملUniform Random Generation of Graphs with Graph Grammars
The aim of the project is to develop a graph generator that provides users with a powerful method to specify graph classes from which the generated graphs are drawn. This is achieved by adapting a method for string generation over context-free grammars to hyperedge replacement grammars, and implementing this method in Scala.
متن کاملColouring Random Regular Graphs
In a previous paper we showed that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6-regular graph asymptotically almost surely (a.a.s.) has chromatic number 4 and that the chromatic number of a random d-regular graph for other d between 5 and 10 inclusive is a.a.s. restricted to a range of two integer values...
متن کاملLearning Random Regular Graphs
The family of random regular graphs is a classic topic in the realms of graph theory, combinatorics and computer science. In this paper we study the problem of learning random regular graphs from random paths. A random regular graph is generated uniformly at random and in a standard label-guided graph exploration setting, the edges incident from a node in the graph have distinct local labels. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2017
ISSN: 0097-5397,1095-7111
DOI: 10.1137/15m1052779