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

More documents

Recommendations

Info

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.
REFERENCES 48[36] Jure Leskovec, Lars Backstrom, Ravi Kumar, and Andrew Tomkins. Microscopic evolution of socialnetworks. In Proceeding of the 14th ACM SIGKDD international conference on Knowledge discoveryand data mining, KDD ’08, pages 462–470, New York, NY, USA, 2008. ACM.[37] Jure Leskovec, Deepayan Chakrabarti, Jon Kleinberg, Christos Faloutsos, and Zoubin Ghahramani.Kronecker graphs: An approach to modeling networks. J. Mach. Learn. Res., 11:985–1042, March2010.[38] Jure Leskovec and Christos Faloutsos. Scalable modeling of real graphs using kronecker multiplication.In Proceedings of the 24th international conference on Machine learning, ICML ’07, pages 497–504,New York, NY, USA, 2007. ACM.[39] Jure Leskovec, Jon Kleinberg, and Christos Faloutsos. Graph evolution: Densification and shrinkingdiameters. ACM Trans. Knowl. Discov. Data, 1, March 2007.[40] Jure Leskovec, Kevin J. Lang, Anirban Dasgupta, and Michael W. Mahoney. Community structurein large networks: Natural cluster sizes and the absence of large well-defined clusters. CoRR,abs/0810.1355, 2008.[41] László Lovász. Random walks on graphs: A survey. Bolyai Society Mathematical Studies, 2:353–397,1996.[42] Mohammad Mahdian and Ying Xu. Stochastic kronecker graphs. Technical report, Proceedings of the5th Workshop on Algorithms and Models for the Web-Graph, 2007.[43] Nicholas Metropolis, Arianna W. Rosenbluth, Marshall N. Rosenbluth, Augusta H. Teller, and EdwardTeller. Equation of state calculations by fast computing machines. The Journal Of Chemical Physics,21(6):1087–1092, 1953.[44] Nina Mishra, Robert Schreiber, Isabelle Stanton, and Robert E. Tarjan. Finding strongly knit clustersin social networks. Internet Mathematics, 5(1-2):155–174, 2008.[45] Alan Mislove, Massimiliano Marcon, Krishna P. Gummadi, Peter Druschel, and Bobby Bhattacharjee.Measurement and analysis of online social networks. In Proceedings of the 5th ACM/USENIX InternetMeasurement Conference (IMC07, 2007.[46] Alexander M. Mood. Introduction to the Theory Of Statistics, pages 508–511. McGraw-Hill Inc., 1963.[47] M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Phys.Rev. E, 69(2):026113, Feb 2004.[48] Romualdo Pastor-Satorras, Alexei Vázquez, and Alessandro Vespignani. Dynamical and correlationproperties of the internet. Phys. Rev. Lett., 87:258701, Nov 2001.[49] A. Barabási R. Albert. Statistical mechanics of complex networks. In Reviews Of Modern Physics,Volume 74, 2002.[50] Amir H. Rasti, Mojtaba Torkjazi, Reza Rejaie, Nick Duffield, Walter Willinger, and Daniel Stutzbach.Evaluating sampling techniques for large dynamic graphs. 2008.[51] S. Redner. How popular is your paper? an empirical study of the citation distribution. In EuropeanPhysical Journal, B 4, 1998.[52] G. Siganos S. L. Tauro, C. Palmer and M. Faloutsos. A simple conceptual model for the internettopology. In Global Telecommunications Conference, volume 3, GLOBECOM 01, pages 1667–1671,2001.[53] Daniel Stutzbach and Reza Rejaie. On unbiased sampling for unstructured peer-to-peer networks. InProc. ACM IMC, pages 27–40, 2006.[54] Erik Volz and Douglas D. Heckathorn. Probability based estimation theory for respondent drivensampling. Journal of Official Statistics, 24:79–97, 2008.
Page 1 and 2: King’s College LondonDepartment o
Page 3 and 4: 7.5 Partitioned Preferential Attach
Page 5 and 6: List of Figures1 Erdós-Rényi Grap
Page 7 and 8: 2Part IIntroduction1 Online Social
Page 9 and 10: 4Part IIRelated Work4 Network prope
Page 11 and 12: 4 NETWORK PROPERTIES AND METRICS 6W
Page 13 and 14: 5 GRAPH GENERATION MODELS 8Figure 1
Page 15 and 16: 5 GRAPH GENERATION MODELS 10Figure
Page 17 and 18: 5 GRAPH GENERATION MODELS 12Figure
Page 19 and 20: 6 GRAPH SAMPLING AND CRAWLING 14on
Page 21 and 22: 6 GRAPH SAMPLING AND CRAWLING 16In
Page 23 and 24: 6 GRAPH SAMPLING AND CRAWLING 18{a(
Page 25 and 26: 7 GRAPH GENERATION 20(a) Constant m
Page 27 and 28: 7 GRAPH GENERATION 22Figure 9: Grow
Page 29 and 30: 7 GRAPH GENERATION 24Figure 10: Imp
Page 31 and 32: 8 EXISTING DATA SET ANALYSIS 26From
Page 33 and 34: 8 EXISTING DATA SET ANALYSIS 28From
Page 35 and 36: 9 GRAPH SAMPLING 30calls. We presen
Page 37 and 38: 9 GRAPH SAMPLING 32Figure 19: Real
Page 39 and 40: 9 GRAPH SAMPLING 34where b > 0 cons
Page 41 and 42: 9 GRAPH SAMPLING 36Theorem 3. For c
Page 43 and 44: 9 GRAPH SAMPLING 38Figure 22: Plots
Page 45 and 46: 9 GRAPH SAMPLING 40wide range of re
Page 47 and 48: 11 GRAPH SAMPLING 42In addition to
Page 49 and 50: 12 GRAPH GENERATION MODELS 4411.1.3
Page 51: 46Part VReferencesReferences[1] Dim
Page 55 and 56: 50Part VIAppendixASampling Manufact
Page 57 and 58: A SAMPLING MANUFACTURED GRAPHS: BFS

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

Create successful ePaper yourself

Delete template?

Save as template?