DeepAI AI Chat
Log In Sign Up

Fast uniform generation of random graphs with given degree sequences

05/09/2019
by   Andrii Arman, et al.
University of Waterloo
Monash University
0

In this paper we provide an algorithm that generates a graph with given degree sequence uniformly at random. Provided that Δ^4=O(m), where Δ is the maximal degree and m is the number of edges,the algorithm runs in expected time O(m). Our algorithm significantly improves the previously most efficient uniform sampler, which runs in expected time O(m^2Δ^2) for the same family of degree sequences. Our method uses a novel ingredient which progressively relaxes restrictions on an object being generated uniformly at random, and we use this to give fast algorithms for uniform sampling of graphs with other degree sequences as well. Using the same method, we also obtain algorithms with expected run time which is (i) linear for power-law degree sequences in cases where the previous best was O(n^4.081), and (ii) O(nd+d^4) for d-regular graphs when d=o(√(n)), where the previous best was O(nd^3).

READ FULL TEXT

page 1

page 2

page 3

page 4

04/19/2023

Uniform Generation of Temporal Graphs with Given Degrees

Uniform sampling from the set 𝒢(𝐝) of graphs with a given degree-sequenc...
11/02/2022

The degree-restricted random process is far from uniform

The degree-restricted random process is a natural algorithmic model for ...
07/03/2018

Uniform generation of spanning regular subgraphs of a dense graph

Let H_n be a graph on n vertices and let H_n denote the complement of H_...
10/28/2021

Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence

We consider the following common network analysis problem: given a degre...
10/11/2017

Subsampling large graphs and invariance in networks

Specify a randomized algorithm that, given a very large graph or network...
06/22/2020

Sampling hypergraphs with given degrees

There is a well-known connection between hypergraphs and bipartite graph...
09/09/2021

Degrees of randomized computability: decomposition into atoms

In this paper we study structural properties of LV-degrees of the algebr...