Systematic topology analysis and generation using degree correlations

@inproceedings{Mahadevan2006SystematicTA,
  title={Systematic topology analysis and generation using degree correlations},
  author={Priya Mahadevan and Dmitri V. Krioukov and Kevin R. Fall and Amin Vahdat},
  booktitle={SIGCOMM 2006},
  year={2006}
}
Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph metric may capture a graph's resilience to failure or its routing efficiency. Knowledge of appropriate metric values may influence the engineering of future topologies, repair strategies in the face of failure, and understanding of fundamental properties of existing networks. Unfortunately, there are typically no… 
Efficient Construction of 2 K + Graphs
I. INTRODUCTION Researchers often need to generate synthetic graphs with key properties resembling those of networks of interest. This is for example the case when the full topology is unavailable or
Modular Structures, Robustness and Protection of Complex Networks: Theory, Complexity and Algorithms
TLDR
It is proved that deciding whether a graph with a given number of links, number of communities, and modularity exists is NP-complete and subsequently a heuristic algorithm for generating random graphs with agiven modularity and number of Links is proposed, which can be used in the broad field of modeling and analyzing clustered social or organizational networks.
Constructing and sampling graphs with a prescribed joint degree distribution
TLDR
An algorithm for constructing simple graphs from a given joint degree distribution, and a Monte Carlo Markov chain method for sampling them, and it is shown that the state space of simple graphs with a fixed degree distribution is connected via endpoint switches.
Mechanisms for generating realistic annotated Internet topologies
Researchers involved in designing network services and protocols rely on results from simulation and emulation environments to evaluate correctness, performance and scalability. To better understand
Reproducing Network Structure: A Comparative Study of Random Graph Generators
TLDR
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.
Sampling Graphs with a Prescribed Joint Degree Distribution Using Markov Chains
TLDR
It is suggested that the joint degree distribution of graphs is an interesting avenue of study for further research into network structure and a simple greedy algorithm for constructing simple graphs from a given joint degree distributions, and a Monte Carlo Markov Chain method for sampling them.
Generating Synthetic Social Graphs with Darwini
TLDR
Darwini is proposed, a graph generator that captures a number of core characteristics of real graphs and can reproduce the degree distribution and, unlike existing approaches, the local clustering coefficient distribution.
Markov property of correlated random networks and its application to the analysis of the internet topologies
We propose a framework for modeling higher-order (beyond two point) degree correlation among nodes, depending on their mutual connectivity. Our focus is on the introduction of the Markov property to
2K+ Graph Construction Framework: Targeting Joint Degree Matrix and Beyond
TLDR
This paper presents an algorithmic framework that generates simple undirected graphs with the exact target joint degree matrix, which it refers to as 2K graphs, in linear time in the number of edges, and imposes minimal constraints on the graph structure.
Orbis: rescaling degree correlations to generate annotated internet topologies
TLDR
This paper proposes techniques to generate annotated, Internet router graphs of different sizes based on existing observations of Internet characteristics and finds that their generated graphs match a variety of graph properties of observed topologies for a range of target graph sizes.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 28 REFERENCES
The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs
TLDR
This paper introduces a novel heuristic to speed up the simulation of the Markov chain, and uses metrics reminiscent of quality of service and congestion to evaluate the output graphs.
Tuning clustering in random networks with arbitrary degree distributions.
TLDR
A generator of random networks where both the degree-dependent clustering coefficient and the degree distribution are tunable and an universal relation among clustering and degree-degree correlations for all networks is unveiled.
A New Perspective on the Small-World Phenomenon: Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg (2000) gave formal
A first-principles approach to understanding the internet's router-level topology
TLDR
It is claimed that very simple models that incorporate hard technological constraints on router and link bandwidth and connectivity, together with abstract models of user demand and network performance, can successfully address this challenge and further resolve much of the confusion and controversy that has surrounded topology generation and evaluation.
A random graph model for massive graphs
TLDR
A random graph model is proposed which is a special case of sparse random graphs with given degree sequences which involves only a small number of parameters, called logsize and log-log growth rate, which capture some universal characteristics of massive graphs.
Detection of topological patterns in complex networks: correlation profile of the internet
A general scheme for detecting and analyzing topological patterns in large complex networks is presented. In this scheme the network in question is compared with its properly randomized version that
Connected Components in Random Graphs with Given Expected Degree Sequences
Abstract. We consider a family of random graphs with a given expected degree sequence. Each edge is chosen independently with probability proportional to the product of the expected degrees of its
Efficient and Simple Generation of Random Simple Connected Graphs with Prescribed Degree Sequence
TLDR
This work addresses the problem of generating random graphs uniformly from the set of simple connected graphs having a prescribed degree sequence and obtains an On log n algorithm, which, in spite of being very simple, improves the best known complexity.
Network topology generators: degree-based vs. structural
TLDR
It is found that network generators based on the degree distribution more accurately capture the large-scale structure of measured topologies, and an explanation is sought by examining the nature of hierarchy in the Internet more closely.
Compact routing on Internet-like graphs
TLDR
The Thorup-Zwick (TZ) compact routing scheme is the first generic stretch-3 routing scheme delivering a nearly optimal per-node memory upper bound and the stretch distribution is derived, finding a unique critical point of the average TZ stretch as a function of d~ and /spl sigma/.
...
1
2
3
...