Corpus ID: 1593183

Fast generation of random connected graphs with prescribed degrees

@article{Viger2005FastGO,
  title={Fast generation of random connected graphs with prescribed degrees},
  author={Fabien Viger and Matthieu Latapy},
  journal={ArXiv},
  year={2005},
  volume={abs/cs/0502085}
}
We address here the problem of generating random graphs uniformly from the set of simple connected graphs having a prescribed degree sequence. Our goal is to provide an algorithm designed for practical use both because of its ability to generate very large graphs (efficiency) and because it is easy to implement (simplicity). We focus on a family of heuristics for which we prove optimality conditions, and show how this optimality can be reached in practice. We then propose a different approach… Expand
A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
TLDR
An extension of a combinatorial characterization due to Erdős and Gallai is used to develop a sequential algorithm for generating a random labeled graph with a given degree sequence, which allows for surprisingly efficient sequential importance sampling. Expand
Basic Notions for the Analysis of Large Affiliation Networks / Bipartite Graphs
Many real-world complex networks actually have a bipartite nature: their nodes may be separated into two classes, the links being between nodes of different classes only. Despite this, and despiteExpand
Synthetic generation of spatial graphs
TLDR
A greedy algorithm is constructed that generates nodes proportional to an underlying probability distribution from the spatial structure, and then generates edges inversely proportional to the Euclidean distance between nodes. Expand
Graph Generation with Prescribed Feature Constraints
TLDR
A simple switching based graph generation approach to generate graphs preserving features of a real graph is presented and potential disclosures of sensitive links due to the preserved features are investigated. Expand
Recent Advances in Scalable Network Generation
TLDR
This survey explores crucial aspects of random graph models with known scalable generators with a focus on modelling techniques and algorithmic primitives that have proven successful in obtaining massive graphs. Expand
A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer Networks
TLDR
It is shown that the flip Markov chain on regular graphs is rapidly mixing, thus justifying this widely used peer-to-peer networking practice and extending this technique to embedded arguments where the compared Markov chains are defined on different state spaces. Expand
An I/O-efficient Generator for Massive Complex Networks with Explicit Community Structure
TLDR
This work presents the first external memory algorithm that is able to generate massive complex networks following the LFR model, and is competitive with a parallel massively distributed algorithm and on smaller instances faster than a state-of-the-art internal memory implementation. Expand
Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades
TLDR
The first efficient Curveball algorithms are introduced: the I/O-efficient EM-CB for simple undirected graphs and its internal memory pendant IM-CB and experimental evidence that EM-PGCB achieves the quality of the state-of-the-art ESMC algorithm EM-ES nearly one order of magnitude faster. Expand
I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark
TLDR
EM-LFR is presented, the first external memory algorithm able to generate massive complex networks following the LFR benchmark and evidence that both implementations yield graphs with matching properties by applying clustering algorithms to generated instances is given. Expand
I/O-efficient Generation of Massive Graphs Following the LFR Benchmark
TLDR
EM-LFR is presented, the first external memory algorithm able to generate massive complex networks following the LFR benchmark and evidence that both implementations yield graphs with matching properties by applying clustering algorithms to generated instances is given. Expand
...
1
2
3
...

References

SHOWING 1-10 OF 31 REFERENCES
A Critical Point for Random Graphs with a Given Degree Sequence
TLDR
It is shown that if Σ i(i - 2)λi > 0, then such graphs almost surely have a giant component, while if λ0, λ1… which sum to 1, then almost surely all components in such graphs are small. Expand
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. Expand
Random graphs with arbitrary degree distributions and their applications.
TLDR
It is demonstrated that in some cases random graphs with appropriate distributions of vertex degree predict with surprising accuracy the behavior of the real world, while in others there is a measurable discrepancy between theory and reality, perhaps indicating the presence of additional social structure in the network that is not captured by the random graph. Expand
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
TLDR
The size of the giant component in the former case, and the structure of the graph formed by deleting that component is analyzed, which is basically that of a random graph with n′=n−∣C∣ vertices, and with λ′in′ of them of degree i. Expand
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. Expand
Graphs and Hypergraphs
Independence densities of hypergraphs We consider the number of independent sets in hypergraphs, which allows us to define the independence density of countable hypergraphs. Hypergraph independenceExpand
Scalable Percolation Search in Power Law Networks
TLDR
It is shown that if each node caches its directory via a short random walk, then the total number of accessible contents exhibits a first-order phase transition, ensuring very high hit rates just above the percolation threshold. Expand
Traceroute sampling makes random graphs appear to have power law degree distributions
The topology of the Internet has typically been measured by sampling traceroutes, which are roughly shortest paths from sources to destinations. The resulting measurements have been used to inferExpand
Accuracy and scaling phenomena in Internet mapping.
TLDR
It is found that in order to accurately estimate alpha, one must use a number of sources which grows linearly in the mean degree of the underlying graph, and comment on the accuracy of the published values of alpha for the Internet. Expand
On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
This paper is mainly concerned with the realizability of a set of n integers as the degrees of vertices of an n-vertex linear graph. Other related problems, such as when a set of integers isExpand
...
1
2
3
4
...