{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:12:02Z","timestamp":1743077522057,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":53,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781461492412"},{"type":"electronic","value":"9781461492429"}],"license":[{"start":{"date-parts":[[2013,11,28]],"date-time":"2013-11-28T00:00:00Z","timestamp":1385596800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,11,28]],"date-time":"2013-11-28T00:00:00Z","timestamp":1385596800000},"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":[[2014]]},"DOI":"10.1007\/978-1-4614-9242-9_6","type":"book-chapter","created":{"date-parts":[[2014,1,8]],"date-time":"2014-01-08T09:18:53Z","timestamp":1389172733000},"page":"155-187","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Large-Scale Social Network Analysis"],"prefix":"10.1007","author":[{"given":"Mattia","family":"Lambertini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matteo","family":"Magnani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moreno","family":"Marzolla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danilo","family":"Montesi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carmine","family":"Paolino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,11,28]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Anderson, W., Briggs, P., Hellberg, C.S., Hess, D.W., Khokhlov, A., Lanzagorta, M., Rosenberg, R.: Early experience with scientific programs on the cray MTA-2. In: Proceedings of 2003 ACM\/IEEE Conference on Supercomputing, SC\u201903, Phoenix, p.\u00a046. ACM, New York, (2003). doi:10.1145\/1048935.1050196","DOI":"10.1145\/1048935.1050196"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Aragon, C.R., GSeidel, R.: Randomized search trees. In: Annual IEEE Symposium on Foundations of Computer Science, Research Triangle Park. IEEE Computer Society, Los Alamitos, pp\u00a0540\u2013545 (1989). doi:10.1109\/SFCS.1989.63531","DOI":"10.1109\/SFCS.1989.63531"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/1562764.1562783","volume":"52","author":"K. Asanovic","year":"2009","unstructured":"Asanovic, K., Bodik, R., Demmel, J., Keaveny, T., Keutzer, K., Kubiatowicz, J., Morgan, N., Patterson, D., Sen, K., Wawrzynek, J., Wessel, D., Yelick, K.: A view of the parallel computing landscape. Commun ACM 52, 56\u201367 (2009)","journal-title":"Commun ACM"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Bader, D.A., Madduri, K.: Designing multithreaded algorithms for breadth-first search and st-connectivity on the Cray MTA-2. In: Proceedings of International Conference on Parallel Processing, Columbus. IEEE Computer Society, Los Alamitos, pp\u00a0523\u2013530 (2006). doi:10.1109\/ICPP.2006.34","DOI":"10.1109\/ICPP.2006.34"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Bader, D.A., Madduri, K.: Parallel algorithms for evaluating centrality indices in real-world networks. In: Proceedings of 2006 International Conference on Parallel Processing, ICPP\u201906, Columbus, pp.\u00a0539\u2013550. IEEE Computer Society, Washington, DC (2006). doi:10.1109\/ICPP.2006.57","DOI":"10.1109\/ICPP.2006.57"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Bader, D.A., Madduri, K.: SNAP, small-world network analysis and partitioning: an open-source parallel graph framework for the exploration of large-scale networks. In: Proceedings of International Symposium on Parallel and Distributed Processing, IPDPS, Miami, pp.\u00a01\u201312 (2008). doi:10.1109\/IPDPS.2008.4536261","DOI":"10.1109\/IPDPS.2008.4536261"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/MC.2010.184","volume":"43","author":"H.E. Bal","year":"2010","unstructured":"Bal, H.E., Maassen, J., van Nieuwpoort, R.V., Drost, N., Kemp, R., Palmer, N., Wrzesinska, G., Kielmann, T., Seinstra, F., Jacobs, C.: Real-world distributed computing with Ibis. Computer 43, 54\u201362 (2010). doi:10.1109\/MC.2010.184","journal-title":"Computer"},{"issue":"5439","key":"6_CR8","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A.L. Barabasi","year":"1999","unstructured":"Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 11 (1999)","journal-title":"Science"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Barrett, B.W., Berry, J.W., Murphy, R.C., Wheeler, K.B.: Implementing a portable multi-threaded graph library: the MTGL on Qthreads. In: IEEE International Symposium on Parallel & Distributed Processing, IPDPS, Rome, pp.\u00a01\u20138 (2009). doi:10.1109\/IPDPS.2009.5161102","DOI":"10.1109\/IPDPS.2009.5161102"},{"key":"6_CR10","unstructured":"Berry, J.W., Hendrickson, B., Kahan, S., Konecny, P.: Graph software development and performance on the MTA-2 and Eldorado. In: 48th Cray Users Group Meeting, Lugano (2006)"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Boost: Boost C++ Libraries. Available at http:\/\/www.boost.org\/ (2011)","DOI":"10.1002\/wilm.10057"},{"issue":"4","key":"6_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/40.782564","volume":"19","author":"S. Borkar","year":"1999","unstructured":"Borkar, S.: Design challenges of technology scaling. IEEE Micro 19(4), 23\u201329 (1999)","journal-title":"IEEE Micro"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","volume":"25","author":"U. Brandes","year":"2001","unstructured":"Brandes, U.: A faster algorithm for betweenness centrality. J. Math. Sociol. 25, 163\u2013177 (2001)","journal-title":"J. Math. Sociol."},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1177\/1094342011403516","volume":"25","author":"A. Bulu\u00e7","year":"2011","unstructured":"Bulu\u00e7, A., Gilbert, J.R.: The combinatorial BLAS: design, implementation, and applications. Int. J. High Perform. Comput. Appl. 25, 496\u2013509 (2011). doi:10.1177\/1094342011403516","journal-title":"Int. J. High Perform. Comput. Appl."},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-642-12079-4_43","volume-title":"Advances in Social Computing. LNCS","author":"F. Celli","year":"2010","unstructured":"Celli, F., Di Lascio, F., Magnani, M., Pacelli, B., Rossi, L.: Social network data and practices: the case of friendfeed. In: Chai, S.K., Salerno, J., Mabry, P. (eds.) Advances in Social Computing. LNCS, vol. 6007, pp\u00a0346\u2013353. Springer, Berlin\/Heidelberg (2010). doi:10.1007\/978-3-642-12079-4_43"},{"key":"6_CR16","unstructured":"Combinatorial BLAS: Combinatorial BLAS Library (MPI reference implementation). Version 1.1, Available at http:\/\/gauss.cs.ucsb.edu\/~aydin\/CombBLAS\/html\/index.html (2011)"},{"key":"6_CR17","volume-title":"Parallel Computer Architecture \u2013 A Hardware\/Software Approach","author":"D. Culler","year":"1998","unstructured":"Culler, D., Singh, K.P., Gupta, A.: Parallel Computer Architecture \u2013 A Hardware\/Software Approach. Morgan Kaufmann, San Francisco (1998)"},{"issue":"1","key":"6_CR18","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1145\/1629175.1629198","volume":"53","author":"J. Dean","year":"2010","unstructured":"Dean, J., Ghemawat, S.: Mapreduce: a flexible data processing tool. Commun. ACM 53(1), 72\u201377 (2010). doi:10.1145\/1629175.1629198","journal-title":"Commun. ACM"},{"key":"6_CR19","unstructured":"DisNet: DisNet, A Framework for Distributed Graph Computation. Available at http:\/\/nd.edu\/~dial\/software.html (2011)"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Du, N., Wang, H., Faloutsos, C.: Analysis of large multi-modal social networks: patterns and a generator. In: Proceedings of the 2010 European conference on Machine Learning and Knowledge Discovery in Databases: Part I, ECML PKDD\u201910, Barcelona, pp.\u00a0393\u2013408. Springer, Berlin\/Heidelberg, (2010). http:\/\/portal.acm.org\/citation.cfm?id=1888258.1888291","DOI":"10.1007\/978-3-642-15880-3_31"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Edmonds, N., Hoefler, T., Lumsdaine, A.: A space-efficient parallel algorithm for computing betweenness centrality in distributed memory. In: Proceedings of International Conference on High Performance Computing (HiPC), Dona Paula, pp.\u00a01\u201310 (IEEE, 2010). doi:10.1109\/HIPC.2010.5713180","DOI":"10.1109\/HIPC.2010.5713180"},{"key":"6_CR22","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P. Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs I. Publ Math Debrecen 6, 290\u2013297, 156 (1959)","journal-title":"Publ Math Debrecen"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Evans, B.M., Chi, E.H.: Towards a model of understanding social search. In: Proceedings of the 2008 ACM Conference on Computer Supported Cooperative Work, CSCW \u201908, San Diego. ACM, New York, pp.\u00a0485\u2013494 (2008). doi:10.1145\/1460563.1460641","DOI":"10.1145\/1460563.1460641"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Feo, J., Harper, D., Kahan, S., Konecny, P.: Eldorado. In: Proceedings of 2nd Conference on Computing Frontiers, CF \u201905, Ischia. ACM, New York, pp.\u00a028\u201334 (2005)","DOI":"10.1145\/1062261.1062268"},{"key":"6_CR25","volume-title":"Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering","author":"I. Foster","year":"1995","unstructured":"Foster, I.: Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering. Addison-Wesley Longman, Boston (1995)"},{"issue":"3","key":"6_CR26","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"L.C. Freeman","year":"1978","unstructured":"Freeman, L.C.: Centrality in social networks: a conceptual clarification. Soc. Netw. 1(3), 215\u2013239 (1978\u20131979)","journal-title":"Soc. Netw."},{"key":"6_CR27","volume-title":"The Parallel BGL: A generic library for distributed graph computations","author":"D. Gregor","year":"2005","unstructured":"Gregor, D., Lumsdaine, A.: The Parallel BGL: A generic library for distributed graph computations. In: Parallel Object-Oriented Scientific Computing, POOSC, Glasgow (2005)"},{"key":"6_CR28","unstructured":"Hadoop.: Apache hadoop. Available at http:\/\/hadoop.apache.org\/ (2011)"},{"key":"6_CR29","unstructured":"HipG.: HipG: High-level distributed processing of large-scale graphs. Available at http:\/\/www.cs.vu.nl\/~ekr\/hipg\/ (2011)"},{"issue":"2","key":"6_CR30","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10115-010-0305-0","volume":"27","author":"U. Kang","year":"2011","unstructured":"Kang, U., Tsourakakis, C.E., Faloutsos, C.: PEGASUS: mining peta-scale graphs. Knowl. Inf. Syst. 27(2), 303\u2013325 (2011). doi:10.1007\/s10115-010-0305-0","journal-title":"Knowl. Inf. Syst."},{"key":"6_CR31","doi-asserted-by":"crossref","unstructured":"Krepska, E., Kielmann, T., Fokkink, W., Bal, H.: A high-level framework for distributed processing of large-scale graphs. In: Proceedings of the 12th International Conference on Distributed Computing and Networking, ICDCN\u201911, Bangalore, pp.\u00a0155\u2013166. Springer, Berlin\/Heidelberg (2011)","DOI":"10.1007\/978-3-642-17679-1_14"},{"key":"6_CR32","volume-title":"Introduction to Parallel Computing","author":"V. Kumar","year":"2003","unstructured":"Kumar, V., Gupta, A.G.A., Karpis, G.: Introduction to Parallel Computing, 2nd edn. Addison Wesley, Harlow (2003)","edition":"2"},{"key":"6_CR33","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1145\/355841.355847","volume":"5","author":"C.L. Lawson","year":"1979","unstructured":"Lawson, C.L., Hanson, R.J., Kincaid, D.R., Krogh, F.T.: Basic linear algebra subprograms for fortran usage. ACM Trans Math Softw 5, 308\u2013323 (1979). doi:10.1145\/355841.355847","journal-title":"ACM Trans Math Softw"},{"key":"6_CR34","doi-asserted-by":"crossref","unstructured":"Lichtenwalter, R.N., Chawla, N.V.: DisNet: A framework for distributed graph computation. In: Proceedings 2011 International Conference on Social Networks Analysis and Mining (ASONAM), Kaohsiung (2011, to appear)","DOI":"10.1109\/ASONAM.2011.55"},{"issue":"1","key":"6_CR35","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1142\/S0129626407002843","volume":"17","author":"A. Lumsdaine","year":"2007","unstructured":"Lumsdaine, A., Gregor, D., Hendrickson, B., Berry, J.W.: Challenges in parallel graph processing. Parallel Process. Lett. 17(1), 5\u201320 (2007)","journal-title":"Parallel Process. Lett."},{"key":"6_CR36","doi-asserted-by":"crossref","unstructured":"Madduri, K., Bader, D.A.: Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis. In: Proceedings of International Parallel and Distributed Processing Symposium, IPDPS, Rome. IEEE Computer Society, Los Alamitos, pp.\u00a01\u201311 (2009)","DOI":"10.1109\/IPDPS.2009.5161060"},{"key":"6_CR37","unstructured":"Madduri, K., Bader, D.A.: Small-world Network Analysis and Partitioning\u2013Version 0.4. Available at http:\/\/snap-graph.sourceforge.net\/ (2010)"},{"key":"6_CR38","volume-title":"The ml-model for multi layer network analysis","author":"M. Magnani","year":"2011","unstructured":"Magnani, M., Rossi, L.: The ml-model for multi layer network analysis. In: IEEE International Conference on Advances in Social Network Analysis and Mining, Kaohsiung (2011)"},{"key":"6_CR39","doi-asserted-by":"crossref","unstructured":"Magnani, M., Rossi, L., Montesi, D.: Information propagation analysis in a social network site. In: 2010 International Conference on Advances in Social Networks Analysis and Mining, Odense, pp.\u00a0296\u2013300. IEEE Computer Society, Los Alamitos (2010)","DOI":"10.1109\/ASONAM.2010.62"},{"key":"6_CR40","unstructured":"Message Passing Interface Forum MPI: A Message-Passing Interface Standard\u2013Version 2.2. Available at http:\/\/www.mpi-forum.org\/docs\/ (2009)"},{"issue":"1","key":"6_CR41","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/JPROC.1998.658762","volume":"86","author":"G.E. Moore","year":"1998","unstructured":"Moore, G.E.: Cramming more components onto integrated circuits. Proc. IEEE 86(1), 82 (1998). doi:10.1109\/JPROC.1998.658762","journal-title":"Proc. IEEE"},{"key":"6_CR42","doi-asserted-by":"publisher","DOI":"10.1037\/10648-000","volume-title":"Who Shall Survive?: A New Approach to the Problem of Human Interrelations","author":"J.L. Moreno","year":"1934","unstructured":"Moreno, J.L., Jennings, H.H.: Who Shall Survive?: A New Approach to the Problem of Human Interrelations. Nervous and Mental Disease Publishing Co., Washington, D.C. (1934)"},{"key":"6_CR43","unstructured":"OpenMP Architecture Review Board: OpenMP Application Program Interface\u2013Version 3.1. Available at http:\/\/openmp.org\/wp\/ (2011)"},{"issue":"3","key":"6_CR44","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.socnet.2010.03.006","volume":"32","author":"T. Opsahl","year":"2010","unstructured":"Opsahl, T., Agneessens, F., Skvoretz, J.: Node centrality in weighted networks: Generalizing degree and shortest paths. Soc. Netw. 32(3), 245\u2013251 (2010)","journal-title":"Soc. Netw."},{"key":"6_CR45","volume-title":"The pagerank citation ranking: bringing order to the web","author":"L. Page","year":"1998","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: bringing order to the web. Technical report, Stanford Digital Library Technologies Project (1998)"},{"key":"6_CR46","unstructured":"Pegasus: Project Pegasus. Available at http:\/\/www.cs.cmu.edu\/~pegasus\/ (2011)"},{"key":"6_CR47","unstructured":"Sandia National Laboratories: Multi-Threaded Graph Library\u2013Version 1.0. Available at https:\/\/software.sandia.gov\/trac\/mtgl (2011)"},{"key":"6_CR48","volume-title":"The Boost Graph Library: User Guide and Reference Manual","author":"J. Siek","year":"2002","unstructured":"Siek, J., Lee, L.Q., Lumsdaine, A.: The Boost Graph Library: User Guide and Reference Manual. Addison-Wesley, Boston (2002)"},{"key":"6_CR49","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-409-6_1","volume-title":"Parallel Computing: Numerics, Applications, and Trends","year":"2009","unstructured":"Trobec, R., Vajter\u0161ic, M., Zinterhof, P. (eds.): Parallel Computing: Numerics, Applications, and Trends. Springer, Dordrecht\/New York (2009). doi:10.1007\/978-1-84882-409-6_1"},{"issue":"6684","key":"6_CR50","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D.J. Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u201csmall-world\u201d networks. Nature 393(6684), 440\u2013442 (1998)","journal-title":"Nature"},{"key":"6_CR51","doi-asserted-by":"crossref","unstructured":"Weng, J., Lim, E.P., Jiang, J., He, Q.: Twitterrank: finding topic-sensitive influential twitterers. In: Proceedings of Third ACM International Conference on Web Search and Data Mining, WSDM \u201910, New York, pp.\u00a0261\u2013270. ACM, New York (2010). doi:10.1145\/1718487.1718520","DOI":"10.1145\/1718487.1718520"},{"key":"6_CR52","doi-asserted-by":"crossref","unstructured":"Wheeler, K.B., Murphy, R.C., Thain, D.: Qthreads: an api for programming with millions of lightweight threads. In: 22nd IEEE International Symposium on Parallel and Distributed Processing, IPDPS. IEEE, Miami, pp.\u00a01\u20138 (2008). doi:10.1109\/IPDPS.2008.4536359","DOI":"10.1109\/IPDPS.2008.4536359"},{"issue":"4","key":"6_CR53","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0378-8733(94)90015-9","volume":"16","author":"D. White","year":"1994","unstructured":"White, D., Borgatti, S.: Betweenness centrality measures for directed graphs. Soc. Netw. 16(4), 335\u2013346 (1994). doi:10.1016\/0378-8733(94)90015-9","journal-title":"Soc. Netw."}],"container-title":["Large-Scale Data Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4614-9242-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T12:16:21Z","timestamp":1706184981000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4614-9242-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,28]]},"ISBN":["9781461492412","9781461492429"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-1-4614-9242-9_6","relation":{},"subject":[],"published":{"date-parts":[[2013,11,28]]},"assertion":[{"value":"28 November 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}