Generating Scaled Replicas of Real-World Complex Networks

  title={Generating Scaled Replicas of Real-World Complex Networks},
  author={Christian Staudt and Michael Hamann and Ilya Safro and Alexander Gutfraind and Henning Meyerhenke},
  booktitle={COMPLEX NETWORKS},
Research on generative models plays a central role in the emerging field of network science, studying how statistical patterns found in real networks can be generated by formal rules. During the last two decades, a variety of models has been proposed with an ultimate goal of achieving comprehensive realism for the generated networks. In this study, we (a) introduce a new generator, termed ReCoN; (b) explore how models can be fitted to an original network to produce a structurally similar… 

Generating realistic scaled complex networks

It is argued that ReCoN is a scalable and effective tool for modeling a given network while preserving important properties at both micro- and macroscopic scales, and for scaling the exemplar data by orders of magnitude in size.

Reproducing Network Structure: A Comparative Study of Random Graph Generators

This work has compared three state-of-the-art graph generators, Embedding based Random Graph Generator, Gscaler, and Stochastic Kronecker Graph, and found that ERGG and GScaler greatly outperform SKG in graph reproducing accuracy in terms of graph metrics.

Planar Graph Generation with Application to Water Distribution Networks

This thesis presents a flexible method to generate realistic water distribution networks with optimized network parameters such as pipe and tank diameters, tank minimum and maximum levels, and pump sizes using the multi-scale randomized editing of a known water network.

Algorithm for multiplex network generation with shared links

A Sampling-Based Tool for Scaling Graph Datasets

This work proposes a heuristic method for scaling existing graphs, which can provide a scaled "version" of a given graph, and provides analytical models to predict the topological properties of the scaled graphs, and enables the user to tweak these properties.

Large-scale graph generation: Recent results of the SPP 1736 – Part II

A previous survey on results for large-scale graph generation obtained within the DFG priority programme SPP 1736 (Algorithms for Big Data); to this end, the scope is broadened and includes recently published results.

Scalable generation of graphs for benchmarking HPC community-detection algorithms

This work provides an alternative, based on the scalable Block Two-Level Erdos-Renyi (BTER) graph generator, that enables HPC-scale evaluation of solution quality in the style of LFR, and demonstrates the capability by showing that label-propagation community-detection algorithm can be strong-scaled with negligible solution-quality loss.

A Generative Model for Sparse, Evolving Digraphs

This paper proposes SEDGE, an algorithm meant to generate series of graphs similar to a real series and considers graphs that are representations of software programs and shows experimentally that this approach outperforms other existing approaches.

Random Graph Modeling

This work analyzes random graph models, extracts their basic principles, and builds a taxonomy of concepts they are based on, and discusses how these concepts are combined in RG models and how they work in typical applications like benchmarks, null models, and data anonymization.

Updating Dynamic Random Hyperbolic Graphs in Sublinear Time

This work presents a fast, sublinear-time query algorithm to sample probabilistic neighborhoods from planar point sets, and proves that the algorithm answers a query in O((|N(q, f)| + √n) log n) time with high probability.



Multiscale network generation

This paper introduces a novel strategy for synthesizing artificial networks that can realistically model a variety of network properties and that is termed multiscale network generation, or as a specific algorithm, MUSKETEER.

Statistical mechanics of complex networks

A simple model based on these two principles was able to reproduce the power-law degree distribution of real networks, indicating a heterogeneous topology in which the majority of the nodes have a small degree, but there is a significant fraction of highly connected nodes that play an important role in the connectivity of the network.

Complex Networks: Structure and Dynamics

The major concepts and results recently achieved in the study of the structure and dynamics of complex networks are reviewed, and the relevant applications of these ideas in many different disciplines are summarized, ranging from nonlinear science to biology, from statistical mechanics to medicine and engineering.

A Scalable Generative Graph Model with Community Structure

It is proposed that the proposed Block Two-Level Erdss-Renyi (BTER) model can be used as a graph generator for benchmarking purposes and provide idealized degree distributions and clustering coefficient profiles that can be tuned for user specifications.

NetworKit: A tool suite for large-scale complex network analysis

The methodology applied to develop scalable solutions to network analysis problems, including techniques like parallelization, heuristics for computationally expensive problems, efficient data structures, and modular software architecture are described.

Benchmark graphs for testing community detection algorithms.

This work introduces a class of benchmark graphs, that account for the heterogeneity in the distributions of node degrees and of community sizes, and uses this benchmark to test two popular methods of community detection, modularity optimization, and Potts model clustering.

Generating Random Hyperbolic Graphs in Subquadratic Time

Complex networks have become increasingly popular for modeling various real-world phenomena. Realistic generative network models are important in this context as they simplify complex network

Different flavors of randomness: comparing random graph models with fixed degree sequences

Whether one of the following three approximative models can replace the fixed degree sequence model (FDSM): the configuration model, its simplified version (eCFG), and the mathematical approximation the authors term simple independence model are discussed.

Structure-preserving sparsification methods for social networks

The first systematic conceptual and experimental comparison of edge sparsification methods on a diverse set of network properties is contributed and it is shown that they can be understood as methods for rating edges by importance and then filtering globally or locally by these scores.