Affiliation networks

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 427-434

  Lattanzi, Silvio ^a   Sivakumar, D ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b GOOGLE INC   (United States)

Author keywords

Densification; Diameter; Social networks; Sparsification

Indexed keywords

BREAKING WORK; DEGREE DISTRIBUTIONS; DIAMETER; GENERATIVE MODEL; GRAPH MODEL; HEAVY-TAILED; MODULAR APPROACH; PREFERENTIAL ATTACHMENTS; RANDOM GRAPHS; REAL-WORLD; REALISTIC GRAPHS; RUN COUNTERS; SHORTEST DISTANCE; SOCIAL NETWORKS; SPARSIFICATION; SUBGRAPHS; WEB GRAPHS;

COMPUTATION THEORY; SHRINKAGE;

GRAPH THEORY;

EID: 70350690697     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536474     Document Type: Conference Paper

References (33)

1. W. Aiello, F. Chung, L. Lu, "Random Evolution in Massive Graphs." in 42nd IEEE symposium on Foundations of Computer Science, FOCS 2001.
2. R. Albert and A.-L. Barabasi. "Emergence of scaling in random networks." Science, pages 509-512, 1999.
3. N.Alon, S. Hoory and N. Linial. "The moore bound for irregular graphs." in Graphs and Combinatorics 18 (2002), pages 53-57.
4. I. Althófer, G. Das, D. Dobkin, D. Joseph, and J. Soares, "On sparse spanners of weighted graph." in Discrete and Computational Geometry, 9:81-100, 1993.
5. S.Baswana, S. Sen, "A simple linear time algorithm for computing sparse spanners in weighted graphs." in 30th International Colloquium on Automata, Languages and Programming(ICALP), pages 384-396, 2003.
6. B. Bollobás, O. Riordan, J. Spencer, and G. E. Tusnády. "The degree sequence of a scale-free random graph process." Random Structures and Algorithms, 18(3):279-290, 2001.
7. B. Bollobás, O. Riordan, "The Diameter of a Scale-Free Random Graph." Combinatorica 24(1): 5-34 2004.
8. B. Bollobás, "The Diameter of Random Graphs." IEEE Trans. Inform.Theory 36 (1990), no. 2, 285-288.
9. R. L. Breiger "The Duality of Persons and Groups." Social Forces, University of North Carolina Press, 1974.
10. A. Z. Broder, S. R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins and J. Wiener. "Graph structure in the web." In Proc. 9th International World Wide Web Conference, pages 309-320, 2000.
11. F. Chierichetti, S. Lattanzi and A. Panconesi, "Gossiping in Social Networks." to be submitted.
12. C. Cooper and A. M. Frieze. "A general model of web graphs." Random Structures and Algorithms, 22(3):311-335, 2003.
13. M. Dodds and Watts. "An experimental study of search in global social networks." Science, 301(5634):827-829, 2003.
14. D. Dubhashi, "Talagrand's inequality in hereditary settings." in Technical report, Dept. CS, Indian Istitute of Technology, 1998.
15. A. Fabrikant, E. Koutsoupias, and C. H. Papadimitriou. "Heuristically optimized trade-offs: A new paradigm for power laws in the internet." In Proc. 29th International Colloquium on Automata, Languages and Programming, pages 110-122, 2002.
16. M. Faloutsos, P. Faloutsos, C. Faloutsos. "On Power-law Relationships of the Internet Topology." SIGCOMM 1999: 251-262.
17. J. Kleinberg. "Navigation in a small world." Nature, 406:845, 2000.
18. J. Kleinberg. "The small-world phenomenon: An algorithmic perspective." In Proc. 37th Annual ACM Symposium on Theory of Computing, pages 163-170, 2000.
19. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal. "Stochastic models for the web graph." In Proc. 41st IEEE Symposium on Foundations of Computer Science, pages 57-65, 2000.
20. J. Leskovec, L. Backstrom, R. Kumar, A. Tomkins "Microscopic evolution of social networks." KDD 2008:462-470.
21. J. Leskovec, D. Chakrabarti, J.M. Kleinberg, C. Faloutsos, "Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication." PKDD 2005: 133-145.
22. J. Leskovec, J. Kleinberg, C. Faloutsos, "Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations." ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 2005.
23. M. Mahdian, Y. Xu, "Stochastic Kronecker Graphs." WAW 2007: 179-186.
24. B. Mandelbrot. "An informational theory of the statistical structure of languages." In W. Jackson, editor, Communication Theory, pages 486-502. Butterworth, 1953.
25. C.J.H. McDiarmid "On the method of bounded differences." In J. Siemons editor, Surveys in Combinatorics: Invited Papers at the 12th British Combinatorial Conference, number 141 in London Mathematical Society Lecture Notes Series, pages 148-188. Cambridge University Press, 1989.
26. M. Mitzenmacher. "A brief history of generative models for power law and lognormal distributions." Internet Mathematics, 1(2), 2003.
27. M. Mitzenmacher. "Editorial: The Future of Power Law Research." Internet Mathematics, vol. 2. no. 4, pp. 525-534, 2006.
28. D. L. Nowell, J. Novak, R. Kumar, P. Raghavan, A. Tomkins "Geographic Routing in Social Networks." Proceedings of the National Academy of Sciences, Vol. 102, No. 33. (August 2005), pp. 11623-11628.
29. D. Peleg and E. Upfal, "A trade-off between space and efficiency for routing tables." in Journal of Assoc. Comp. Mach., 36(3):510-530, 1989.
30. H. Simon. "On a class of skew distribution functions." Biometrika, 42:425-440, 1955.
31. J. Travers and S. Milgram. "An experimental study of the small world problem." Sociometry, 32(4):425-443, 1969.
32. D. Watts and S. Strogatz. "Collective dynamics of small-world networks." Nature, 393(6684):409-410, 1998.
33. G. K. Zipf. "Human Behavior and the Principle of Least Effort." Addison-Wesley, 1949.