Abstract
We present an efficient algorithm to generate random graphs with a given sequence of expected degrees. Existing algorithms run in \(\mathcal{O}(N^2)\) time where N is the number of nodes. We prove that our algorithm runs in \(\mathcal{O}(N+M)\) expected time where M is the expected number of edges. If the expected degrees are chosen from a distribution with finite mean, this is \(\mathcal{O}(N)\) as Nāāāā.
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
Batagelj, V., Brandes, U.: Efficient generation of large random networks. Physical Review EĀ 71, 036113 (2005)
BollobĆ”s, B., Janson, S., Riordan, O.: The phase transition in inhomogeneous random graphs. Random Structures and AlgorithmsĀ 31(1), 3 (2007)
Britton, T., Deijfen, M., Martin-Lƶf, A.: Generating simple random graphs with prescribed degree distribution. Journal of Statistical PhysicsĀ 124(6), 1377ā1397 (2006)
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.: Graph structure in the Web. In: WWW9: 9th International World Wide Web Conference, vol.Ā 33, pp. 309ā320 (2000)
Chung, F., Lu, L.: Connected components in random graphs with given expected degree sequences. Annals of CombinatoricsĀ 6(2), 125ā145 (2002)
Chung, F., Lu, L.: The average distance in a random graph with given expected degrees. Internet MathematicsĀ 1(1), 91ā113 (2004)
Chung, F., Lu, L.: The volume of the giant component of a random graph with given expected degrees. SIAM Journal on Discrete MathematicsĀ 20(2), 395ā411 (2007)
Chung, F., Lu, L., Vu, V.: The spectra of random graphs with given expected degrees. Internet MathematicsĀ 1(3), 257ā275 (2004)
Draief, M., Ganesh, A.: A random walk model for infection on graphs: spread of epidemics & rumours with mobile agents. Discrete Event Dynamic SystemsĀ 21, 41ā61 (2011)
Eubank, S., Kumar, V.S., Marathe, M.V., Srinivasan, A., Wang, N.: Structural and algorithmic aspects of massive social networks. In: Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 718ā727 (2004)
del Genio, C.I., Kim, H., Toroczkai, Z., Bassler, K.E.: Efficient and exact sampling of simple graphs with given arbitrary degree sequence. PloS ONEĀ 5(4), e10012 (2010)
van der Hofstad, R.: Critical behavior in inhomogeneous random graphs, arXiv:0902.0216v2 [math.PR] (2010)
Keeling, M.J., Eames, K.T.D.: Networks and epidemic models. Journal of The Royal Society InterfaceĀ 2(4), 295ā307 (2005), doi:10.1098/rsif.2005.0051
Kleinberg, J.: Complex networks and decentralized search algorithms. In: Proceedings of the International Congress of Mathematicians, ICM (2006)
Newman, M.E.J.: Spread of epidemic disease on networks. Physical Review EĀ 66(1), 016128 (2002)
Newman, M.E.J.: The structure and function of complex networks. SIAM ReviewĀ 45, 167ā256 (2003)
Norros, I., Reittu, H.: On a conditionally Poissonian graph process. Advances in Applied ProbabilityĀ 38(1), 59ā75 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miller, J.C., Hagberg, A. (2011). Efficient Generation of Networks with Given Expected Degrees. In: Frieze, A., Horn, P., PraÅat, P. (eds) Algorithms and Models for the Web Graph. WAW 2011. Lecture Notes in Computer Science, vol 6732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21286-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-21286-4_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21285-7
Online ISBN: 978-3-642-21286-4
eBook Packages: Computer ScienceComputer Science (R0)