DeepAI
Log In Sign Up

Linear Work Generation of R-MAT Graphs

R-MAT is a simple, widely used recursive model for generating `complex network' graphs with a power law degree distribution and community structure. We make R-MAT even more useful by reducing the required work per edge from logarithmic to constant. The algorithm works in an embarrassingly parallel way.

READ FULL TEXT

page 1

page 2

page 3

page 4

02/13/2018

A Faster Isomorphism Test for Graphs of Small Degree

Luks's algorithm (JCSS 1982) to test isomorphism of bounded degree graph...
02/27/2017

Bayesian inference on random simple graphs with power law degree distributions

We present a model for random simple graphs with a degree distribution t...
10/01/2021

Spirality and Rectilinear Planarity Testing of Independent-Parallel SP-Graphs

We study the long-standing open problem of efficiently testing rectiline...
10/03/2018

A Bayesian model for sparse graphs with flexible degree distribution and overlapping community structure

We consider a non-projective class of inhomogeneous random graph models ...
02/23/2021

The Power of D-hops in Matching Power-Law Graphs

This paper studies seeded graph matching for power-law graphs. Assume th...
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...
06/26/2014

Edge Label Inference in Generalized Stochastic Block Models: from Spectral Theory to Impossibility Results

The classical setting of community detection consists of networks exhibi...