A mathematical analysis of the R-MAT random graph generator

DOI10.1002/net.20417zbMath1233.05185OpenAlexW2081819442MaRDI QIDQ3100696

Steve Poole, Chris Groër, 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

zbMATH Keywords

random graphscale-free graphoccupancy problemR-MAT generator

Mathematics Subject Classification ID

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

Related Items (1)

Coin-Flipping, Ball-Dropping, and Grass-Hopping for Generating Random Graphs from Matrices of Edge Probabilities

Uses Software

• GTgraph

Cites Work

• Local limit theorems for finite and infinite urn models
• On the calculation of the power of the test of empty boxes
• Unnamed Item
• Unnamed Item
• Unnamed Item

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