Large-scale Graph Generation and Big Data: An Overview on Recent Results

Artificially generated input graphs play an important role in algorithm engineering for systematic testing and tuning. In big data settings, however, not only processing huge graphs but also the ecient generation of appropriate test instances itself becomes challenging. In this context we survey a number of recent results for large-scale graph generation obtained within the DFG priority programme SPP 1736 (Algorithms for Big Data).

[1]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[2]  S. Hakimi.  On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I , 1962 .

[3]  Madhav V. Marathe,et al.  Fast Parallel Algorithms for Edge-Switching to Achieve a Target Visit Rate in Heterogeneous Graphs , 2014, 2014 43rd International Conference on Parallel Processing.

[4]  Ulrik Brandes,et al.  Efficient generation of large random networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Andrea Lancichinetti,et al.  Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[7]  Katharina Anna Zweig,et al.  Different flavors of randomness: comparing random graph models with fixed degree sequences , 2015, Social Network Analysis and Mining.

[8]  Henning Meyerhenke,et al.  Generating Random Hyperbolic Graphs in Subquadratic Time , 2015, ISAAC.

[9]  Remco van der Hofstad,et al.  Random Graphs and Complex Networks , 2016, Cambridge Series in Statistical and Probabilistic Mathematics.

[10]  Ilya Safro,et al.  Generating Scaled Replicas of Real-World Complex Networks , 2016, COMPLEX NETWORKS.

[11]  Alok Aggarwal,et al.  The input/output complexity of sorting and related problems , 1988, CACM.

[12]  Ulrich Meyer,et al.  Generating Massive Scale-Free Networks under Resource Constraints , 2016, ALENEX.

[13]  Rajeev Rastogi,et al.  Data Stream Management: Processing High-Speed Data Streams (Data-Centric Systems and Applications) , 2019 .

[14]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[15]  Sören Laue,et al.  Generating massive complex networks with hyperbolic geometry faster in practice , 2016, 2016 IEEE High Performance Extreme Computing Conference (HPEC).

[16]  F. Radicchi,et al.  Benchmark graphs for testing community detection algorithms. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  Manuel Penschuck,et al.  I/O-efficient Generation of Massive Graphs Following the LFR Benchmark , 2017, ALENEX.

[18]  Sebastian Lamm,et al.  Communication Efficient Algorithms for Generating Massive Networks , 2017 .

[19]  Norbert Zeh,et al.  A Survey of Techniques for Designing I/O-Efficient Algorithms , 2002, Algorithms for Memory Hierarchies.

[20]  Amin Vahdat,et al.  Hyperbolic Geometry of Complex Networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  Jop F. Sibeyn,et al.  Algorithms for Memory Hierarchies: Advanced Lectures , 2003 .

[22]  Manuel Penschuck.  Generating Practical Random Hyperbolic Graphs in Near-Linear Time and with Sub-Linear Memory , 2017, SEA.

[23]  Henning Meyerhenke,et al.  Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently , 2016, IWOCA.

[24]  Christian Staudt,et al.  NetworKit: A tool suite for large-scale complex network analysis , 2014, Network Science.

[25]  Lars Arge,et al.  The Buffer Tree: A Technique for Designing Batched External Data Structures , 2003, Algorithmica.

[26]  Denis Turdakov,et al.  Distributed Generation of Billion-node Social Graphs with Overlapping Community Structure , 2014, CompleNet.

[27]  Guy E. Blelloch,et al.  Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel , 2015, SODA.

[28]  Luca Gugelmann,et al.  Random Hyperbolic Graphs: Degree Sequence and Clustering - (Extended Abstract) , 2012, ICALP.

[29]  Václav Havel,et al.  Poznámka o existenci konečných grafů , 1955 .

[30]  C. J. Carstens.  TOPOLOGY OF COMPLEX NETWORKS: MODELS AND ANALYSIS , 2017, Bulletin of the Australian Mathematical Society.

[31]  Peter Sanders,et al.  Scalable generation of scale-free graphs , 2016, Inf. Process. Lett..

[32]  Ralph Keusch,et al.  Geometric Inhomogeneous Random Graphs , 2015, Theor. Comput. Sci..