Efficient generation of networks with given expected degrees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6732 LNCS, Issue , 2011, Pages 115-126

  Miller, Joel C ^a,b   Hagberg, Aric ^c  

^a HARVARD SCHOOL OF PUBLIC HEALTH   (United States)

^b NATIONAL INSTITUTES OF HEALTH   (United States)

^c LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EFFICIENT ALGORITHM; EXPECTED TIME; RANDOM GRAPHS;

ALGORITHMS; USER INTERFACES; COMPUTER SCIENCE; COMPUTERS;

MATHEMATICAL MODELS; ARTIFICIAL INTELLIGENCE;

EID: 79958229328     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21286-4_10     Document Type: Conference Paper

References (17)

1. Batagelj, V., Brandes, U.: Efficient generation of large random networks. Physical Review E 71, 036113 (2005)
2. Bollobás, B., Janson, S., Riordan, O.: The phase transition in inhomogeneous random graphs. Random Structures and Algorithms 31(1), 3 (2007)
3. 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)
4. 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)
5. Chung, F., Lu, L.: Connected components in random graphs with given expected degree sequences. Annals of Combinatorics 6(2), 125-145 (2002)
6. Chung, F., Lu, L.: The average distance in a random graph with given expected degrees. Internet Mathematics 1(1), 91-113 (2004)
7. 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)
8. Chung, F., Lu, L., Vu, V.: The spectra of random graphs with given expected degrees. Internet Mathematics 1(3), 257-275 (2004)
9. 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)
10. 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)
11. 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)
12. van der Hofstad, R.: Critical behavior in inhomogeneous random graphs, arXiv:0902.0216v2 [math.PR] (2010)
13. 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
14. Kleinberg, J.: Complex networks and decentralized search algorithms. In: Proceedings of the International Congress of Mathematicians, ICM (2006)
15. Newman, M.E.J.: Spread of epidemic disease on networks. Physical Review E 66(1), 016128 (2002)
16. Newman, M.E.J.: The structure and function of complex networks. SIAM Review 45, 167-256 (2003)
17. Norros, I., Reittu, H.: On a conditionally Poissonian graph process. Advances in Applied Probability 38(1), 59-75 (2006)