2009 50th Annual IEEE Symposium on Foundations of Computer Science (2009)
Oct. 25, 2009 to Oct. 27, 2009
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FOCS.2009.63
Graphs resulting from human behavior (the web graph, friendship graphs, etc.) have hitherto been viewed as a monolithic class of graphs with similar characteristics; for instance, their degree distributions are markedly heavy-tailed. In this paper we take our understanding of behavioral graphs a step further by showing that an intriguing empirical property of web graphs --- their compressibility--- cannot be exhibited by well-known graph models for the web and for social networks. We then develop amore nuanced model for web graphs and show that it does exhibit compressibility, in addition to previously modeled web graph properties.
A. Panconesi, S. Lattanzi, F. Chierichetti, R. Kumar and P. Raghavan, "Models for the Compressible Web," 2009 50th Annual IEEE Symposium on Foundations of Computer Science(FOCS), Atlanta, Georgia, 2009, pp. 331-340.