Efficient and Simple Generation of Random Simple Connected Graphs with Prescribed Degree Sequence

  • Fabien Viger
  • Matthieu Latapy
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3595)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Adamic, L., Puniyani, H.: Search in power-law networks. Phys. Rev. E 64, 46135 (2001)CrossRefGoogle Scholar
  2. 2.
    Aiello, Chung, Lu: A random graph model for massive graphs. In: Proc. of the 32nd ACM STOC, pp. 171–180 (2000)Google Scholar
  3. 3.
    Berge, C.: Graphs and Hypergraphs. North-Holland, Amsterdam (1973)MATHGoogle Scholar
  4. 4.
    Erdos, Gallai: Graphs with prescribed degree of vertices. Mat. Lapok 11, 264– 274 (1960)Google Scholar
  5. 5.
    Faloutsos, Faloutsos, Faloutsos: On power-law relationships of the internet topology. In: Proc. ACM SIGCOMM, vol. 29, pp. 251–262 (1999)Google Scholar
  6. 6.
    Gkantsidis, Mihail, Zegura: The markov chain simulation method for generating connected power law random graphs. In: Proc. ALENEX (2003)Google Scholar
  7. 7.
    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)MathSciNetMATHGoogle Scholar
  8. 8.
    Havel, V.: A remark on the existence of finite graphs. Caposis Pest. Mat. 80, 496–506 (1955)Google Scholar
  9. 9.
    Henzinger, King: Randomized fully dynamic graph algorithms with polylogarithmic time per operation. J. of ACM 46(4) (1999)Google Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    Roberts Jr., J.M.: Simple methods for simulating sociomatrices with given marginal totals. Social Networks 22, 273–283 (2000)CrossRefGoogle Scholar
  12. 12.
    Milo, Kashtan, Itzkovitz, Newman, Alon: Uniform generation of random graphs with arbitrary degree seq. sub. Phys. Rev. E (2001)Google Scholar
  13. 13.
    Molloy, Reed: A critical point for random graphs with a given degree sequence. Random Struct. and Algo., pp. 161–179 (1995)Google Scholar
  14. 14.
    Molloy, Reed: The size of the giant component of a random graph with a given degree sequence. Comb., Prob. and Comp. 7, 295 (1998)Google Scholar
  15. 15.
    Taylor, R.: Constrained switchings in graphs. Comb. Mat. 8 (1980)Google Scholar
  16. 16.
    Sarshar, Boykin, Roychowdhury: Scalable percolation search in power law networks. In: P2P 2004, pp. 2–9 (2004)Google Scholar
  17. 17.
    Thorup, M.: Near-optimal fully-dynamic graph connectivity. In: Proc. of the 32nd ACM STOC, pp. 343–350 (2000)Google Scholar
  18. 18.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Fabien Viger
    • 1
    • 2
  • Matthieu Latapy
    • 2
  1. 1.LIP6University Pierre and Marie CurieParisFrance
  2. 2.LIAFAUniversity Denis DiderotParisFrance

Personalised recommendations