Models for the compressible web

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2009, Pages 331-340

  Chierichetti, Flavio ^a   Kumar, Ravi ^b   Lattanzi, Silvio ^a   Panconesi, Alessandro ^a   Raghavan, Prabhakar ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b YAHOO RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DEGREE DISTRIBUTIONS; EMPIRICAL PROPERTIES; FRIENDSHIP GRAPHS; GRAPH MODEL; HEAVY-TAILED; HUMAN BEHAVIORS; SOCIAL NETWORKS; WEB GRAPHS;

BEHAVIORAL RESEARCH; COMPRESSIBILITY; COMPUTER SCIENCE; FIBER OPTIC CHEMICAL SENSORS;

GRAPHIC METHODS;

EID: 77952363244     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2009.63     Document Type: Conference Paper

References (34)

1. R. Albert and A.-L. Barabasi, "Emergence of scaling in random networks," Science, pp. 509-512, 1999.
2. 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 WWW, 2000, pp. 309-320.
3. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins, "Trawling the web for emerging cybercommunities," in Proc. 8th WWW, 1999, pp. 403-416.
4. W. Aiello, F. Chung, and L. Lu, "Random evolution in massive graphs," in Proc. 42nd FOCS, 2001, pp. 510-519.
5. 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, vol. 18, no. 3, pp. 279-290, 2001.
6. C. Borgs, J. T. Chayes, C. Daskalakis, and S. Roch, "First to market is not everything: An analysis of preferential attachment with fitness," in Proc. 39th STOC, 2007, pp. 135-144.
7. J. Carlson and J. Doyle, "Highly optimized tolerance: A mechanism for power laws in designed systems," Phys. Rev. E, vol. 60, p. 1412, 1999.
8. A. Fabrikant, E. Koutsoupias, and C. H. Papadimitriou, "Heuristically optimized trade-offs: A new paradigm for power laws in the internet," in Proc. 29th ICALP, 2002, pp. 110-122.
9. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal, "Stochastic models for the web graph," in Proc. 41st FOCS, 2000, pp. 57-65.
10. J. Leskovec, J. Kleinberg, and C. Faloutsos, "Graphs over time: Densification laws, shrinking diameters, and possible explanations," in Proc. 11th KDD, 2005, pp. 177-187.
11. I. H. Witten, A. Moffat, and T. C. Bell, Managing Gigabytes: Compressing and Indexing Documents and Images, 2nd ed. Morgan Kauffman Publishers, 1999.
12. T. Suel and J. Yuan, "Compressing the graph structure of the web," in Data Compression Conference, 2001, pp. 213-222.
13. C. Karande, K. Chellapilla, and R. Andersen, "Speeding up algorithms on compressed web graphs," in Proc. 2nd WSDM, 2009, pp. 272-281.
14. P. Boldi, M. Santini, and S. Vigna, "Permuting web graphs," in Proc. 6th WAW, 2009, pp. 116-126.
15. P. Boldi and S. Vigna, "The webgraph framework I: Compression techniques," in Proc. 13th WWW, 2004, pp. 595-601.
16. -, "Codes for the world-wide web," Internet Mathematics, vol. 2, no. 4, pp. 405-427, 2005.
17. G. Buehrer and K. Chellapilla, "A scalable pattern mining approach to web graph compression with communities," in Proc. 1st WSDM, 2008, pp. 95-106.
18. J. Leskovec, D. Chakrabarti, J. Kleinberg, and C. Faloutsos, "Realistic, mathematically tractable graph generation and evolution, using Kronecker multiplication," in Proc. 8th PKDD, 2005, pp. 133-145.
19. M. Dodds and Watts, "An experimental study of search in global social networks," Science, vol. 301, no. 5634, pp. 827-829, 2003.
20. D. Liben-Nowell, J. Novak, R. Kumar, P. Raghavan, and A. Tomkins, "Geographic routing in social networks," PNAS, vol. 102, no. 33, pp. 11 623-11 628, 2005.
21. J. Travers and S. Milgram., "An experimental study of the small world problem," Sociometry, vol. 32, no. 4, pp. 425-443, 1969.
22. F. Chierichetti, R. Kumar, M. Mitzenmacher, A. Panconesi, P. Raghavan, and S. Lattanzi, "On compressing social networks," in Proc. 15th KDD, 2009, pp. 219-228.
23. J. Kleinberg, "Navigation in a small world," Nature, vol. 406, p. 845, 2000.
24. G. K. Zipf, Human Behavior and the Principle of Least Effort. Addison-Wesley, 1949.
25. H. Simon, "On a class of skew distribution functions," Biometrika, vol. 42, pp. 425-440, 1955.
26. M. Mitzenmacher, "A brief history of generative models for power law and lognormal distributions," Internet Mathematics, vol. 1, no. 2, 2003.
27. B. Mandelbrot, "An informational theory of the statistical structure of languages," in Communication Theory, W. Jackson, Ed. Butterworth, 1953, pp. 486-502.
28. D. Watts and S. Strogatz, "Collective dynamics of 'small-world' networks," Nature, vol. 393, no. 6684, pp. 409-410, 1998.
29. C. Cooper and A. M. Frieze, "A general model of web graphs," Random Structures and Algorithms, vol. 22, no. 3, pp. 311-335, 2003.
30. S. Lattanzi and D. Sivakumar, "Affiliation networks," in Proc. 41st STOC, 2009, pp. 427-434.
31. M. Adler and M. Mitzenmacher, "Towards compressing web graphs," in Proc. DCC, 2001, pp. 203-212.
32. D. Dubhashi and A. Panconesi, Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press, 2009.
33. L. Mutafchiev, "The largest tree in certain models of random forests," Random Structures and Algorithms, vol. 13, no. 3-4, pp. 211-228, 1998.
34. C. Cooper and A. M. Frieze, "The cover time of the preferential attachment graph," Journal of Combinatorial Theory, Ser. B, vol. 97, no. 2, pp. 269-290, 2007.