Coin-flipping, ball-dropping, and grass-hopping for generating random graphs from matrices of edge probabilities

09/11/2017
by   Arjun S. Ramani, et al.
0

Common models for random graphs, such as Erdős-Rényi and Kronecker graphs, correspond to generating random adjacency matrices where each entry is non-zero based on a large matrix of probabilities. Generating an instance of a random graph based on these models is easy, although inefficient, by flipping biased coins (i.e. sampling binomial random variables) for each possible edge. This process is inefficient because most large graph models correspond to sparse graphs where the vast majority of coin flips will result in no edges. We describe some not-entirely-well-known, but not-entirely-unknown, techniques that will enable us to sample a graph by finding only the coin flips that will produce edges. Our analogies for these procedures are ball-dropping, which is easier to implement, but may need extra work due to duplicate edges, and grass-hopping, which results in no duplicated work or extra edges. Grass-hopping does this using geometric random variables. In order to use this idea on complex probability matrices such as those in Kronecker graphs, we decompose the problem into three steps, each of which are independently useful computational primitives: (i) enumerating non-decreasing sequences, (ii) unranking multiset permutations, and (iii) decoding and encoding z-curve and Morton codes and permutations. The third step is the result of a new connection between repeated Kronecker product operations and Morton codes. Throughout, we draw connections to ideas underlying applied math and computer science including coupon collector problems.

READ FULL TEXT
research
11/18/2020

Prague dimension of random graphs

The Prague dimension of graphs was introduced by Nesetril, Pultr and Rod...
research
02/03/2018

Typicality Matching for Pairs of Correlated Graphs

In this paper, the problem of matching pairs of correlated random graphs...
research
12/03/2020

A General Dependency Structure for Random Graphs and Its Effect on Monotone Properties

We consider random graphs in which the edges are allowed to be dependent...
research
04/13/2022

LDPC codes: comparing cluster graphs to factor graphs

We present a comparison study between a cluster and factor graph represe...
research
10/05/2022

A spectral algorithm for finding maximum cliques in dense random intersection graphs

In a random intersection graph G_n,m,p, each of n vertices selects a ran...
research
06/18/2016

Mathematical Foundations of the GraphBLAS

The GraphBLAS standard (GraphBlas.org) is being developed to bring the p...
research
12/25/2021

Modularity and edge sampling

Suppose that there is an unknown underlying graph G on a large vertex se...

Please sign up or login with your details

Forgot password? Click here to reset