{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:22:03Z","timestamp":1742955723568,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":38,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9781441984616"},{"type":"electronic","value":"9781441984623"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-1-4419-8462-3_2","type":"book-chapter","created":{"date-parts":[[2011,3,16]],"date-time":"2011-03-16T12:24:37Z","timestamp":1300278277000},"page":"17-42","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Statistical Properties of Social Networks"],"prefix":"10.1007","author":[{"given":"Mary","family":"McGlohon","sequence":"first","affiliation":[]},{"given":"Leman","family":"Akoglu","sequence":"additional","affiliation":[]},{"given":"Christos","family":"Faloutsos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,3,17]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"L. Akoglu, M. McGlohon, and C. Faloutsos. RTM: Laws and a recursive generator for weighted time-evolving graphs. Carnegie Mellon University Technical Report, Oct, 2008.","DOI":"10.1109\/ICDM.2008.123"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1038\/43601","volume":"401","author":"Albert Reka","year":"1999","unstructured":"Reka Albert, Hawoong Jeong, and Albert-Laszlo Barabasi. Diameter of the world wide web. Nature, (401):130\u2013131, 1999.","journal-title":"Nature"},{"issue":"5439","key":"2_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A. L. Barabasi","year":"1999","unstructured":"A. L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286(5439):509\u2013512, October 1999.","journal-title":"Science"},{"key":"2_CR4","unstructured":"Albert-Laszlo Barabasi. Linked: How Everything Is Connected to Everything Else and What It Means for Business, Science, and Everyday Life. Plume Books, April 2003."},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Robert Bell, Yehuda Koren, and Chris Volinsky. Modeling relationships at multiple scales to improve accuracy of large recommender systems. In KDD \u201907: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 95\u2013104, New York, NY, USA, 2007. ACM.","DOI":"10.1145\/1281192.1281206"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Zhiqiang Bi, Christos Faloutsos, and Filip Korn. The DGX distribution for mining massive, skewed data. In KDD, pages 17\u201326, ACMA, 2001. ACM.","DOI":"10.1145\/502512.502521"},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1145\/1052934.1052942","volume":"5","author":"Borodin Allan","year":"2005","unstructured":"Allan Borodin, Gareth O. Roberts, Jeffrey S. Rosenthal, and Panayiotis Tsaparas. Link analysis ranking: algorithms, theory, and experiments. ACM Trans. Inter. Tech., 5(1):231\u2013297, 2005.","journal-title":"ACM Trans. Inter. Tech."},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Deepayan Chakrabarti, Yiping Zhan, and Christos Faloutsos. R-MAT: A recursive model for graph mining. SIAM Int. Conf. on Data Mining, April 2004.","DOI":"10.1137\/1.9781611972740.43"},{"issue":"8","key":"2_CR9","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1109\/2.781636","volume":"32","author":"E Byron","year":"1999","unstructured":"Soumen Chakrabarti, Byron E. Dom, S. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins, David Gibson, and Jon Kleinberg. Mining the web\u2019s link structure. Computer, 32(8):60\u201367, 1999.","journal-title":"Computer"},{"issue":"4","key":"2_CR10","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1137\/070710111","volume":"51","author":"Clauset Aaron","year":"2009","unstructured":"Aaron Clauset, Cosma R. Shalizi, and M. E. J. Newman. Power-law distributions in empirical data. SIAM Review, 51(4):661+, Feb 2009.","journal-title":"SIAM Review"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Pedro Domingos and Matt Richardson. Mining the network value of customers. KDD, pages 57\u201366, 2001.","DOI":"10.1145\/502512.502525"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Michalis Faloutsos, Petros Faloutsos, and Christos Faloutsos. On powerlaw relationships of the internet topology. SIGCOMM, pages 251\u2013262, Aug-Sept. 1999.","DOI":"10.1145\/316194.316229"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Gary Flake, Steve Lawrence, C. Lee Giles, and Frans Coetzee. Selforganization and identification of web communities. IEEE Computer, 35(3), March 2002.","DOI":"10.1109\/2.989932"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"Girvan Michelle","year":"2002","unstructured":"Michelle Girvan and M. E. J. Newman. Community structure in social and biological networks. PNAS, 99:7821, 2002.","journal-title":"PNAS"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Jon M. Kleinberg, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, and Andrew S. Tomkins. The Web as a graph: Measurements, models and methods. Lecture Notes in Computer Science, 1627:1\u201317, 1999.","DOI":"10.1007\/3-540-48686-0_1"},{"issue":"2","key":"2_CR16","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1145\/1149121.1149123","volume":"6","author":"Ravi Kumar","year":"2006","unstructured":"Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, and Andrew Tomkins. Core algorithms in the clever system. ACM Trans. Inter. Tech., 6(2):131\u2013152, 2006.","journal-title":"ACM Trans. Inter. Tech."},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Aleksandar Lazarevic, Levent Ert\u00f6z, Vipin Kumar, Aysel Ozgur, and Jaideep Srivastava. A comparative study of anomaly detection schemes in network intrusion detection. In Proceedings of the Third SIAM International Conference on Data Mining, 2003.","DOI":"10.1137\/1.9781611972733.3"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Jure Leskovec, Jon Kleinberg, and Christos Faloutsos. Graphs over time: densification laws, shrinking diameters and possible explanations. In Proc. of ACM SIGKDD, pages 177\u2013187, Chicago, Illinois, USA, 2005. ACM Press.","DOI":"10.1145\/1081870.1081893"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Jure Leskovec, Jon Kleinberg, and Christos Faloutsos. Graphs over time: densification laws, shrinking diameters and possible explanations. In KDD \u201905: Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, pages 177\u2013187, New York, NY, USA, 2005. ACM Press.","DOI":"10.1145\/1081870.1081893"},{"key":"2_CR20","unstructured":"Jure Leskovec, Kevin Lang, Anirban Dasgupta, and Michael Mahoney. Community structure in real graphs: The \u201cnegative dimensionality\" paradox. In International World Wide Web Conference, 2008."},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Jure Leskovec, Mary Mcglohon, Christos Faloutsos, Natalie Glance, and Matthew Hurst. Cascading behavior in large blog graphs: Patterns and a model. In Society of Applied and Industrial Mathematics: Data Mining (SDM07), 2007.","DOI":"10.1137\/1.9781611972771.60"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Mary Mcglohon, Leman Akoglu, and Christos Faloutsos. Weighted graphs and disconnected components: Patterns and a generator. In ACM Special Interest Group on Knowledge Discovery and Data Mining (SIGKDD), August 2008.","DOI":"10.1145\/1401890.1401955"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"M. Mihail and C. Papadimitriou. The eigenvalue power law, 2002.","DOI":"10.1007\/3-540-45726-7_20"},{"key":"2_CR24","first-page":"60","volume":"2","author":"S. Milgram","year":"1967","unstructured":"S. Milgram. The small-world problem. Psychology Today, 2:60\u201367, 1967.","journal-title":"Psychology Today"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Alan L. Montgomery and Christos Faloutsos. Identifying web browsing trends and patterns. IEEE Computer, 34(7):94\u201395, July 2001.","DOI":"10.1109\/2.933515"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"M. E. J. Newman. Power laws, pareto distributions and zipf\u2019s law. Contemporary Physics, 46, 2005.","DOI":"10.1080\/00107510500052444"},{"key":"2_CR27","doi-asserted-by":"crossref","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"M. E. J. Newman","year":"2004","unstructured":"M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review E, 69:026113, 2004.","journal-title":"Physical Review E"},{"key":"2_CR28","unstructured":"C. R. Palmer, P. B. Gibbons, and C. Faloutsos. Anf: A fast and scalable tool for data mining in massive graphs. In SIGKDD, Edmonton, AB, Canada, 2002."},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Shashank Pandit, Duen H. Chau, Samuel Wang, and Christos Faloutsos. Netprobe: a fast and scalable system for fraud detection in online auction networks. InWWW\u201907: Proceedings of the 16th international conference on World Wide Web, pages 201\u2013210, New York, NY, USA, 2007.","DOI":"10.1145\/1242572.1242600"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"M. Richardson and P. Domingos. Mining knowledge-sharing sites for viral marketing, 2002.","DOI":"10.1145\/775047.775057"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Manfred Schroeder. Fractals, Chaos, Power Laws: Minutes from an Infinite Paradise. W.H. Freeman and Company, New York, 1991.","DOI":"10.1063\/1.2810323"},{"key":"2_CR32","first-page":"78","volume":"36","author":"F Michael","year":"1992","unstructured":"Michael F. Schwartz and David C. M. Wood. Discovering shared interests among people using graph analysis of global electronic mail traffic. Communications of the ACM, 36:78\u201389, 1992.","journal-title":"Communications of the ACM"},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"G. Siganos, M. Faloutsos, P. Faloutsos, and C. Faloutsos. Power laws and the AS-level internet topology, 2003.","DOI":"10.1109\/TNET.2003.815300"},{"key":"2_CR34","doi-asserted-by":"crossref","unstructured":"G. Siganos, S. L. Tauro, and M. Faloutsos. Jellyfish: a conceptual model for the as internet topology. Journal of Communications and Networks, 2006.","DOI":"10.1109\/JCN.2006.6182774"},{"key":"2_CR35","unstructured":"SL Tauro, C. Palmer, G. Siganos, and M. Faloutsos. A simple conceptual model for the Internet topology. 2001."},{"key":"2_CR36","doi-asserted-by":"crossref","unstructured":"Charalampos E. Tsourakakis. Fast counting of triangles in large real networks without counting: Algorithms and laws. In ICDM, 2008.","DOI":"10.1109\/ICDM.2008.72"},{"key":"2_CR37","unstructured":"Mengzhi Wang, Tara Madhyastha, Ngai Hang Chang, Spiros Papadimitriou, and Christos Faloutsos. Data mining meets performance evaluation: Fast algorithms for modeling bursty traffic. ICDE, February 2002."},{"key":"2_CR38","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"J. Watts Duncan","year":"1998","unstructured":"Duncan J. Watts and Steven H. Strogatz. Collective dynamics of \u2018smallworld\u2019 networks. Nature, (393):440\u2013442, 1998.","journal-title":"Nature"}],"container-title":["Social Network Data Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4419-8462-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T15:26:08Z","timestamp":1741101968000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4419-8462-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9781441984616","9781441984623"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-1-4419-8462-3_2","relation":{},"subject":[],"published":{"date-parts":[[2011]]},"assertion":[{"value":"17 March 2011","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}