Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adamic, L., Puniyani, H.: Search in power-law networks. Phys. Rev. EÂ 64, 46135 (2001)
Aiello, Chung, Lu: A random graph model for massive graphs. In: Proc. of the 32nd ACM STOC, pp. 171–180 (2000)
Berge, C.: Graphs and Hypergraphs. North-Holland, Amsterdam (1973)
Erdos, Gallai: Graphs with prescribed degree of vertices. Mat. Lapok 11, 264– 274 (1960)
Faloutsos, Faloutsos, Faloutsos: On power-law relationships of the internet topology. In: Proc. ACM SIGCOMM, vol. 29, pp. 251–262 (1999)
Gkantsidis, Mihail, Zegura: The markov chain simulation method for generating connected power law random graphs. In: Proc. ALENEX (2003)
Hakimi, S.L.: On the realizability of a set of integers as degrees of the vertices of a linear graph. SIAM Journal 10(3), 496–506 (1962)
Havel, V.: A remark on the existence of finite graphs. Caposis Pest. Mat. 80, 496–506 (1955)
Henzinger, King: Randomized fully dynamic graph algorithms with polylogarithmic time per operation. J. of ACM 46(4) (1999)
Holm, de Lichtenberg, Thorup: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. In: STOC 1998, pp. 79–89 (1998)
Roberts Jr., J.M.: Simple methods for simulating sociomatrices with given marginal totals. Social Networks 22, 273–283 (2000)
Milo, Kashtan, Itzkovitz, Newman, Alon: Uniform generation of random graphs with arbitrary degree seq. sub. Phys. Rev. E (2001)
Molloy, Reed: A critical point for random graphs with a given degree sequence. Random Struct. and Algo., pp. 161–179 (1995)
Molloy, Reed: The size of the giant component of a random graph with a given degree sequence. Comb., Prob. and Comp. 7, 295 (1998)
Taylor, R.: Constrained switchings in graphs. Comb. Mat. 8 (1980)
Sarshar, Boykin, Roychowdhury: Scalable percolation search in power law networks. In: P2P 2004, pp. 2–9 (2004)
Thorup, M.: Near-optimal fully-dynamic graph connectivity. In: Proc. of the 32nd ACM STOC, pp. 343–350 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Viger, F., Latapy, M. (2005). Efficient and Simple Generation of Random Simple Connected Graphs with Prescribed Degree Sequence. In: Wang, L. (eds) Computing and Combinatorics. COCOON 2005. Lecture Notes in Computer Science, vol 3595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533719_45
Download citation
DOI: https://doi.org/10.1007/11533719_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28061-3
Online ISBN: 978-3-540-31806-4
eBook Packages: Computer ScienceComputer Science (R0)