Degree-degree dependencies in random graphs with heavy-tailed degrees

Internet Mathematics

Volumn 10, Issue 3-4, 2014, Pages 287-334

  van der Hofstad, Remco ^a   Litvak, Nelly ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84924096316     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2013.850455     Document Type: Article

References (46)

1. R. Albert and A. L. Barabási. “Statistical Mechanics of Complex Networks.” Reviews of Modern Physics, 74:1 (2002), 47.
2. K. Azuma. “Weighted Sums of Certain Dependent Random Variables.” Tohoku Mathematical Journal, 19:3 (1967), 357–367.
3. E.A. Bender and E.R. Canfield. “The Asymptotic Number of Labeled Graphs with Given Degree Sequences.” Journal of Combinatorial Theory, Series A, 24:3 (1978), 296–307.
4. N. H. Bingham, C. M. Goldie, and J. L. Teugels. Regular Variation of Encyclopedia of Mathematics and its Applications, 27. Cambridge, UK: Cambridge University Press, 1989.
5. P. Boldi, M. Rosa, M. Santini, and S. Vigna. “Layered Label Propagation: A Multiresolution Coordinate-Free Ordering for Compressing Social Networks.” In Proceedings of the 20th International World Wide Web Conference (WWW 2011). ACM Press, 2011.
6. P. Boldi and S. Vigna. “The WebGraph Framework I: Compression Techniques.” In Proceedings of the 13th International World Wide Web Conference (WWW 2004) pp. 595–601, Manhattan: ACM Press, 2004.
7. B. Bollobás. “A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs.” European J. Combin. 1:4 (1980), 311–316.
8. B. Bollobás. Random Graphs vol. 73. Cambridge, Cambridge, Cambridge University Press, 2001.
9. B. Bollobás, O. Riordan, J. Spencer, and G. Tusnády. The Degree Sequence of a Scale-Free Random Graph Process. Random Structures and Algorithms 18 (2001), 279–290.
10. C. B. Borkowf. “Computing the Nonnull Asymptotic Variance and the Asymptotic Relative Efficiency of Spearman’s Rank Correlation.” Computational Statistics & Data Analysis 39:3 (2002), 271–286.
11. D. Braha and Y. Bar-Yam. “The Statistical Mechanics of Complex Product Development: Empirical and Analytical Results.” Management Science 53:7 (2007), 1127–1145.
12. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Statac, A. Tomkins, and J. Wiener. “Graph Structure in the Web.” Computer Networks 33, (2000), 309–320.
13. P. G. Constantine and D. F. Gleich. “Using Polynomial Chaos to Compute the Influence of Multiple Random Surfers in the PageRank Model.” In edited by A. Bonato and F. C. Graham, pp. 82–95. Proceedings of the 5th Workshop on Algorithms and Models for the Web Graph (WAW2007), Lecture Notes in Computer Science 4863, Berlin: Springer, 2007.
14. S. N. Dorogovtsev, A. L. Ferreira, A. V. Goltsev, and J. F. F. Mendes. “Zero Pearson Coefficient for Strongly Correlated Growing Trees.” Physical Review E 81:3 (2010), 031135.
15. J. C. Doyle, D. L. Alderson, L. Li, S. Low, M. Roughan, S. Shalunov, R. Tanaka, and W. Willinger. “The Robust Yet Fragile Nature of the Internet.” PNAS 102:41 (2005), 14497–14502.
16. R. Durrett. Random Graph Dynamics. Cambridge, UK: Cambridge University Press, 2007.
17. V. M. Eguiluz and K. Klemm. “Epidemic Threshold in Structured Scale-Free Networks.” Physical Review Letters 89:10 (2002), 108701.
18. S. Eubank, H. Guclu, V. S. Anil Kumar, M. V. Marathe, A. Srinivasan, Z. Toroczkai, and N. Wang. “Modelling Disease Outbreaks in Realistic Urban Social Networks.” Nature, 429:6988 (2004), 180–184.
19. S. Fortunato, M. Boguñá, A. Flammini, and F. Menczer. “On Local Estimations of PageRank: A Mean Field Approach.” Internet Mathematics 4: 2–3 (2007), 245–266.
20. D. F. Gleich, A. P. Gray, C. Greif, and T. Lau. “An Inner-Outer Iteration for Computing PageRank.” SIAM Journal on Scientific Computing 32:1 (2010), 349.
21. B. V. Gnedenko and A. N. Kolmogorov. Limit Distributions for Sums of Independent Random Variables. Translated from the Russian, annotated, and revised by K. L. Chung. With appendices by J. L. Doob and P. L. Hsu. Revised edition. Addison-Wesley, Reading, MA; London-Don Mills., Ont: Addison-Wesley, 1968.
22. W. Hoeffding. “Probability Inequalities for Sums of Bounded Random Variables.” Journal of the American Statistical Association 58:301 (1963), 13–30.
23. R. van der Hofstad. “Random Graphs and Complex Networks 2013. Available at http://www.win.tue.nl/∼rhofstad/NotesRGCN.pdf.
24. R. van der Hofstad and N. Litvak. “Uncovering Disassortativity in Large Scale-Free Networks.” Physical Review E 87:2 (2013), 022801.
25. S. Janson. “The Probability that a Random Multigraph is Simple.” Combinatorics, Probability and Computing, 18:1–2 (2009), 205–225.
26. M. Kendall. Rank Correlation Methods. London, UK: Charles Griffin & Company, 1975.
27. M. G. Kendall. “A New Measure of Rank Correlation”. Biometrika 30:1-2 (1938), 81–93.
28. R. Kumar and S. Vassilvitskii. “Generalized Distances Between Rankings.” In Proceedings of the 19th International Conference on World Wide Web, pp. 571–580. New York, NY: ACM, 2010.
29. L. Li, D.L. Alderson, J.C. Doyle, and W. Willinger. “Towards a Theory of Scale-Free Graphs: Definition, Properties, and implications.” Internet Mathematics 2:4 (2005), 431–523.
30. P. Mahadevan, D. Krioukov, K. Fall, and A. Vahdat. “Systematic Topology Analysis and Generation Using Degree Correlations.” ACM SIGCOMM Computer Communication Review, 36:4 (2006), 135–146.
31. M. Mesfioui and A. Tajar. “On the Properties of Some Nonparametric Concordance Measures in the Discrete Case.” Nonparametric Statistics 17:5 (2005), 541–554.
32. T. Mikosch. “Copulas: Tales and Facts.” Extremes 9:1 (2006), 3–20.
33. M. Mitzenmacher. “A Brief History of Generative Models for Power Law and Lognormal distributions.” Internet Mathematics 1:2 (2004), 226–251.
34. M. Molloy and B. Reed. “A Critical Point for Random Graphs with a Given Degree Sequence.” Random Structures & Algorithms 6:2–3 (1995), 161–180.
35. M. Molloy and B. Reed. “The Size of the Giant Component of a Random Graph with a Given Degree Sequence.” Combinatorics Probability and Computing 7:3 (1998), 295–305.
36. J. Nevslehová. “On Rank Correlation Measures for Non-Continuous Random Variables.” Journal of Multivariate Analysis 98:3 (2007), 544–567.
37. M. E. J. Newman. “Assortative Mixing in Networks. Physical Review Letters 89:20 (2002), 208701.
38. M. E. J. Newman. “Mixing Patterns in Networks.” Physical Review E 67:2 (2003), 026126.
39. M. E. J. Newman. “The Structure and Function of Complex Networks.” SIAM Review 45:2 (2003), 167–256.
40. M. Newman. Networks: An Introduction.” New York, NY: Oxford University Press, 2010.
41. M. E. J. Newman, S.H. Strogatz, and D.J. Watts. “Random Graphs with Arbitrary Degree Distributions and Their Applications.” Physical Review E 64:2 (2001), 026118.
42. M. Raschke, M. Schläpfer, and R. Nibali. “Measuring Degree-Degree Association in Networks.” Physical Review E 82:3 (2010), 037102.
43. S. I. Resnick. Heavy-Tail Phenomena. Berlin, Heidelberg: Springer, 2007.
44. C. Spearman. “The Proof and Measurement of Association Between Two Things.” The American Journal of Psychology 15:1 (1904), 72–101.
45. Y. Volkovich, N. Litvak, and B. Zwart. “Measuring Extremal Dependencies in Web Graphs.” In WWW’ 08: Proceedings of the 17th International conference on World Wide Web, pp. 1113–1114. New York, NY: ACM Press, 2008.
46. Y. Volkovich, N. Litvak, and B. Zwart. “Extremal Dependencies and Rank Correlations in Power Law Networks.” In Complex Sciences, vol. 5, edited by J. Zhou, O. Akan, and P. Bellavista et al. pp. 1642–1653. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering. Berlin, Heidelberg: Springer, 2009.