A mathematical analysis of the R-MAT random graph generator

DOI10.1002/NET.20417zbMATH Open1233.05185OpenAlexW2081819442MaRDI QIDQ3100696FDOQ3100696

Authors: Chris Groër, Steve Poole, Blair D. Sullivan 

Publication date: 21 November 2011

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20417

Recommendations

• Techniques for analyzing dynamic random graph models of web-like networks: An overview
• Constructing and sampling graphs with a prescribed joint degree distribution
• An in-depth analysis of stochastic Kronecker graphs
• Efficient generation of networks with given expected degrees
• A Scalable Generative Graph Model with Community Structure

zbMATH Keywords

random graphscale-free graphoccupancy problemR-MAT generator

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Kronecker graphs: an approach to modeling networks
• Title not available (Why is that?)
• Local limit theorems for finite and infinite urn models
• Title not available (Why is that?)
• On the calculation of the power of the test of empty boxes

Cited In (4)

• Random graph generator for bipartite networks modeling
• Coin-flipping, Ball-dropping, and Grass-hopping for generating random graphs from matrices of edge probabilities
• Techniques for analyzing dynamic random graph models of web-like networks: An overview
• Limitations of Chung Lu random graph generation

Uses Software

• GTgraph

This page was built for publication: A mathematical analysis of the R-MAT random graph generator

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3100696)