A critical point for random graphs with a given degree sequence
Random Graphs 93 Proceedings of the sixth international seminar on Random graphs and probabilistic methods in combinatorics and computer science
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
Journal of the ACM (JACM)
A random graph model for massive graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Near-optimal fully-dynamic graph connectivity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
Combinatorics, Probability and Computing
Percolation Search in Power Law Networks: Making Unstructured Peer-to-Peer Networks Scalable
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Graphs and Hypergraphs
Systematic topology analysis and generation using degree correlations
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
A Robust Spanning Tree Topology for Data Collection and Dissemination in Distributed Environments
IEEE Transactions on Parallel and Distributed Systems
Semi-supervised Classification from Discriminative Random Walks
ECML PKDD '08 Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I
Using circuit structural analysis techniques for networks in systems biology
Proceedings of the 11th international workshop on System level interconnect prediction
A benchmark diagnostic model generation system
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans - Special issue on model-based diagnostics
DSI: a method for indexing large graphs using distance set
WAIM'10 Proceedings of the 11th international conference on Web-age information management
Evaluation of a new method for measuring the internet degree distribution: Simulation results
Computer Communications
TAGs: scalable threshold-based algorithms for proximity computation in graphs
Proceedings of the 14th International Conference on Extending Database Technology
A structural approach to the temporal modeling of networks
Winter Simulation Conference
Generating random graphic sequences
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Insomnia in the access: or how to curb access network related energy consumption
Proceedings of the ACM SIGCOMM 2011 conference
BR-index: an indexing structure for subgraph matching in very large dynamic graphs
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Generating constrained random graphs using multiple edge switches
Journal of Experimental Algorithmics (JEA)
Answering pattern match queries in large graph databases via graph embedding
The VLDB Journal — The International Journal on Very Large Data Bases
Sampling connected induced subgraphs uniformly at random
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
Discovery of top-k dense subgraphs in dynamic graph collections
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
Implementation and comparison of heuristics for the vertex cover problem on huge graphs
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Pedestrian quantity estimation with trajectory patterns
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II
Evidence of community structure in Biomedical Research Grant Collaborations
Journal of Biomedical Informatics
Generating synthetic task graphs for simulating stream computing systems
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
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, specifically designed for typical real-world degree distributions, which outperforms the first one. Assuming a conjecture, we finally obtain an O(n log n) algorithm, which, in spite of being very simple, improves the best known complexity.