Upgrade Report - Department of Informatics - King's College London

REFERENCES 47[17] Colin Cooper. Classifying special interest groups in web graphs. In Proc. RANDOM 2002: Randomizationand Approximation Techniques in Computer Science, pages 263–275, 2002.[18] Artur Czumaj and Christian Sohler. Testing expansion in bounded-degree graphs. In Proceedings ofthe 48th Annual IEEE Symposium on Foundations of Computer Science, pages 570–578, Washington,DC, USA, 2007. IEEE Computer Society.[19] Stephen Dill, Ravi Kumar, Kevin S. Mccurley, Sridhar Rajagopalan, D. Sivakumar, and AndrewTomkins. Self-similarity in the web. ACM Trans. Internet Technol., 2:205–223, August 2002.[20] Jozef Dodziuk. Difference equations, isoperimetric inequality and transience of certain random walks.Transactions of the American Mathematical Society, 284(2):pp. 787–794, 1984.[21] M. Enachescu E. Drinea and M. Mitzenmacher. Technical report: Variations on random graph modelsfor the web. Technical report, Harvard University, Department of Computer Science, 2001.[22] P. Erdős and A Rényi. On the evolution of random graphs. In Publication of the Mathematical Instituteof the Hungarian Academy of Sciences, pages 17–61, 1960.[23] S. Ye F. Wu, J. Lang. Crawling online social graphs. In 2010 12th International Asia-Pacific WebConference, 2010.[24] Michalis Faloutsos, Petros Faloutsos, and Christos Faloutsos. On power-law relationships of the internettopology. In Proceedings of the conference on Applications, technologies, architectures, and protocolsfor computer communication, SIGCOMM ’99, pages 251–262, New York, NY, USA, 1999. ACM.[25] Abraham D. Flaxman and Juan Vera. Bias reduction in traceroute sampling - towards a more accuratemap of the internet. In WAW, pages 1–15, 2007.[26] M. Girvan and M. E. J. Newman. Community structure in social and biological networks. In Proc NatlAcad Sci U S A, 2002.[27] Minas Gjoka, Maciej Kurant, Carter T. Butts, and Athina Markopoulou. A walk in facebook: Uniformsampling of users in online social networks. CoRR, abs/0906.0060, 2009.[28] W. K. Hastings. Monte carlo sampling methods using markov chains and their applications. Biometrika,57(1):97–109, 1970.[29] Jing He, John E. Hopcroft, Hongyu Liang, Supasorn Suwajanakorn, and Liaoruo Wang. Detecting thestructure of social networks using (α, β)-communities. In Proceedings of the 8th International Workshopin Algorithms and Models for the Web Graph (WAW), pages 26–37, 2011.[30] Satoshi Ikeda, Izumi Kubo, Norihiro Okumoto, and Masafumi Yamashita. Impact of Local TopologicalInformation on Random Walks on Finite Graphs. In Proceedings of the 32st International Colloquiumon Automata, Languages and Programming (ICALP), pages 1054–1067, Washington DC, USA, 2003.[31] J. Kleinberg J. Leskovec and M. Faloutsos. Graph evolution: Densification and shrinking diameters.In Knowledge Discovery from Data, Vol. 1, No. 1, Article 2, 2007.[32] Jon M. Kleinberg, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, and Andrew S. Tomkins.The web as a graph: measurements, models, and methods. In Proceedings of the 5th annual internationalconference on Computing and combinatorics, COCOON’99, Berlin, Heidelberg, 1999. Springer-Verlag.[33] Silvio Lattanzi and D. Sivakumar. Affiliation networks. In Proceedings of the 41st annual ACM symposiumon Theory of computing, STOC ’09, pages 427–434, New York, NY, USA, 2009. ACM.[34] Albert Leon-Garcia. Probability and Random Processes for Electrical Engineering (2nd Edition).Addison-Wesley, 2 edition, August 1993.[35] J. Leskovec and C. Faloutsos. Sampling from large graphs. In Proceedings of of ACM SIGKDD, ACMSIGKDD 2006, 2006.