Scalable generation of scale-free graphs

<a class="pub-badge pub-badge--doi" href="https://doi.org/10.1016/J.IPL.2016.02.004" rel="nofollow">DOI 10.1016/J.IPL.2016.02.004</a><a class="pub-badge pub-badge--grey" href="https://zbmath.org/1356.68163" rel="nofollow">zbMATH</a><a class="pub-badge pub-badge--grey" href="https://openalex.org/works/W2964251804" rel="nofollow">OpenAlex</a><a class="pub-badge pub-badge--mardi" href="https://portal.mardi4nfdi.de/wiki/Item:Q269740" rel="nofollow">MaRDI QID Q269740</a><a class="pub-badge pub-badge--grey" href="https://fdo.portal.mardi4nfdi.de/fdo/Q269740" rel="nofollow">FDO</a>

Authors Christian Schulz, Peter Sanders

Publication date 6 April 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1602.07106

zbMATH Keywords

graph generatorsparallel processingscale-free graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Abstract: We explain how massive instances of scale-free graphs following the Barabasi-Albert model can be generated very quickly in an embarrassingly parallel way. This makes this popular model available for studying big data graph problems. As a demonstration, we generated a Petaedge graph in less than an hour.

Recommendations

• Generating Massive Scale-Free Networks under Resource Constraints
• Large-scale graph generation and big data: an overview on recent results
• Scale Free Interval Graphs
• Publication:4552043
• Scale free interval graphs

Cites work

• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• Emergence of Scaling in Random Networks
• Generating Massive Scale-Free Networks under Resource Constraints
• The degree sequence of a scale-free random graph process

Cited in

(9)

• Generating Massive Scale-Free Networks under Resource Constraints
• Large-scale graph generation and big data: an overview on recent results
• Parallel and I/O-efficient algorithms for non-linear preferential attachment
• Distributed network generation based on preferential attachment in ABS
• Sublinear Random Access Generators for Preferential Attachment Graphs.
• I/O-efficient generation of massive graphs following the \textit{LFR} benchmark
• I/O-efficient generation of massive graphs following the LFR benchmark
• A Scalable Generative Graph Model with Community Structure
• Parallelism in simulation and modeling of scale-free complex networks

This page was built for publication: Scalable generation of scale-free graphs

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