Upper bounds for number of removed edges in the erased configuration model

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

Volumn 9479, Issue , 2015, Pages 54-65

  van der Hoorn, Pim ^a   Litvak, Nelly ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS;

ASYMPTOTIC RESULTS; AVERAGE NUMBERS; CONFIGURATION MODEL; DEGREE DISTRIBUTIONS; FINITE SIZE EFFECT; POWER LAW EXPONENT; SPEED OF CONVERGENCE; TAUBERIAN THEOREM;

GRAPH THEORY;

EID: 84951876633     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-26784-5_5     Document Type: Conference Paper

References (24)

1. Andersson, H.: Limit theorems for a random graph epidemic model. Ann. Appl. Probab. 8, 1331–1349 (1998)
2. Artzy-Randrup, Y., Stone, L.: Generating uniformly distributed random networks. Phys. Rev. E 72(5), 056708 (2005)
3. Bingham, N.H., Doney, R.A.: Asymptotic properties of supercritical branching processes i: the galton-watson process. Adv. Appl. Probab. 6, 711–731 (1974)
4. Blitzstein, J., Diaconis, P.: A sequential importance sampling algorithm for generating random graphs with prescribed degrees. Internet Math. 6(4), 489–522 (2011)
5. Bollobás, B.: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. Eur. J. Comb. 1(4), 311–316 (1980). http://www.sciencedirect.com/science/article/pii/S0195669880800308
6. Britton, T., Deijfen, M., Martin-Löf, A.: Generating simple random graphs with prescribed degree distribution. J. Stat. Phys. 124(6), 1377–1397 (2006)
7. Cooper, C., Dyer, M., Greenhill, C.: Sampling regular graphs and a peer-to-peer network. Comb. Probab. Comput. 16(04), 557–593 (2007)
8. 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)
9. Embrechts, P., Goldie, C.M.: On closure and factorization properties of subexponential and related distributions. J. Aust. Math. Soc. (Series A) 29(02), 243–256 (1980)
10. van den Esker, H., van der Hofstad, R., Hooghiemstra, G., Znamenski, D.: Distances in random graphs with infinite mean degrees. Extremes 8(3), 111–141 (2005)
11. Ferreira, S.C., Castellano, C., Pastor-Satorras, R.: Epidemic thresholds of the susceptible-infected-susceptible model on networks: a comparison of numerical and theoretical results. Phys. Rev. E 86(4), 041125 (2012)
12. van der Hofstad, R.: Random graphs and complex networks. Unpublished manuscript (2007). http://www.win.tue.nl/rhofstad/NotesRGCN.pdf
13. van der Hofstad, R., Hooghiemstra, G., Van Mieghem, P.: Distances in random graphs with finite variance degrees. Random Struct. Algorithms 27(1), 76–123 (2005)
14. van der Hofstad, R., Hooghiemstra, G., Znamenski, D.: Distances in random graphs with finite mean and infinite variance degrees. Eurandom (2005)
15. van der Hoorn, P., Litvak, N.: Convergence of rank based degree-degree correlations in random directed networks. Moscow J. Comb. Number Theor. 4(4), 45–83 (2014). http://mjcnt.phystech.edu/en/article.php?id=92
16. van der Hoorn, P., Litvak, N.: Phase transitions for scaling of structural correlations in directed networks (2015). arXiv preprint arXiv:1504.01535
17. Lee, H.K., Shim, P.S., Noh, J.D.: Epidemic threshold of the susceptible-infectedsusceptible model on complex networks. Phys. Rev. E 87(6), 062812 (2013)
18. Maslov, S., Sneppen, K.: Specificity and stability in topology of protein networks. Science 296(5569), 910–913 (2002)
19. Molloy, M., Reed, B.: A critical point for random graphs with a given degree sequence. Random Struct. Algorithms 6(2–3), 161–180 (1995). http://onlinelibrary.wiley.com/doi/10.1002/rsa.3240060204/full
20. Molloy, M., Reed, B.: The size of the giant component of a random graph with a given degree sequence. Comb. Probab. Comput. 7(03), 295–305 (1998)
21. Newman, M.E., Strogatz, S.H., Watts, D.J.: Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E 64(2), 026118 (2001). http://journals.aps.org/pre/abstract/10.1103/PhysRevE.64.026118
22. Schlauch, W.E., Horvát, E. Á., Zweig, K.A.: Different flavors of randomness: comparing random graph models with fixed degree sequences. Soc. Netw. Anal. Min. 5(1), 1–14 (2015)
23. Tabourier, L., Roth, C., Cointet, J.P.: Generating constrained random graphs using multiple edge switches. J. Exp. Algorithmics (JEA) 16, 1–7 (2011)
24. Whitt, W.: Stochastic-Process Limits: An Introduction to Stochastic-Process Limits and Their Application to Queues. Springer, New York (2002)