{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:29:16Z","timestamp":1743060556675,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642299513"},{"type":"electronic","value":"9783642299520"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29952-0_10","type":"book-chapter","created":{"date-parts":[[2012,5,3]],"date-time":"2012-05-03T06:14:09Z","timestamp":1336025649000},"page":"40-49","source":"Crossref","is-referenced-by-count":0,"title":["The Small Community Phenomenon in Networks: Models, Algorithms and Applications"],"prefix":"10.1007","author":[{"given":"Pan","family":"Peng","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","first-page":"475","volume-title":"Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science","author":"R. Andersen","year":"2006","unstructured":"Andersen, R., Chung, F., Lang, K.: Local graph partitioning using pagerank vectors. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 475\u2013486. IEEE Computer Society, Washington, DC, USA (2006)"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1145\/1135777.1135814","volume-title":"Proceedings of the 15th International Conference on World Wide Web, WWW 2006","author":"R. Andersen","year":"2006","unstructured":"Andersen, R., Lang, K.J.: Communities from seed sets. In: Proceedings of the 15th International Conference on World Wide Web, WWW 2006, pp. 223\u2013232. ACM, New York (2006)"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1145\/1536414.1536449","volume-title":"Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009","author":"R. Andersen","year":"2009","unstructured":"Andersen, R., Peres, Y.: Finding sparse cuts locally using evolving sets. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, pp. 235\u2013244. ACM, New York (2009)"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A.L. Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science\u00a0286, 509\u2013512 (1999)","journal-title":"Science"},{"issue":"7191","key":"10_CR5","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1038\/nature06830","volume":"453","author":"A. Clauset","year":"2008","unstructured":"Clauset, A., Moore, C., Newman, M.E.: Hierarchical structure and the prediction of missing links in networks. Nature\u00a0453(7191), 98\u2013101 (2008)","journal-title":"Nature"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Physical Review E, 1\u20136 (2004)","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Doerr, B., Fouz, M., Friedrich, T.: Social networks spread rumors in sublogarithmic time. In: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, STOC 2011, pp. 21\u201330 (2011)","DOI":"10.1145\/1993636.1993640"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"1551","DOI":"10.1126\/science.1073374","volume":"297","author":"E. Ravasz","year":"2002","unstructured":"Ravasz, E., Somera, A.L., D.M.Z.O., Barab\u00e1si, A.L.: Hierarchical organization of modularity in metabolic networks. Science\u00a0297, 1551 (2002)","journal-title":"Science"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Easley, D., Kleinberg, J.: Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press (July 2010)","DOI":"10.1017\/CBO9780511761942"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Flaxman, A.D., Frieze, A., Vera, J.: A geometric preferential attachment model of networks. Internet Mathematics\u00a03(2) (2007)","DOI":"10.1080\/15427951.2006.10129124"},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1080\/15427951.2007.10129137","volume":"4","author":"A.D. Flaxman","year":"2007","unstructured":"Flaxman, A.D., Frieze, A.M., Vera, J.: A geometric preferential attachment model of networks II. Internet Mathematics\u00a04(1), 87\u2013111 (2007)","journal-title":"Internet Mathematics"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Fortunato, S.: Community detection in graphs. Physics Reports\u00a0486 (2010)","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-21260-4_14","volume-title":"Bioinformatics Research and Applications","author":"L. Hodgkinson","year":"2011","unstructured":"Hodgkinson, L., Karp, R.M.: Algorithms to Detect Multiprotein Modularity Conserved during Evolution. In: Chen, J., Wang, J., Zelikovsky, A. (eds.) ISBRA 2011. LNCS, vol.\u00a06674, pp. 111\u2013122. Springer, Heidelberg (2011)"},{"issue":"3","key":"10_CR14","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1145\/990308.990313","volume":"51","author":"R. Kannan","year":"2004","unstructured":"Kannan, R., Vempala, S., Vetta, A.: On clusterings: Good, bad and spectral. J. ACM\u00a051(3), 497\u2013515 (2004)","journal-title":"J. ACM"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: KDD 2003: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.: The small-world phenomenon: an algorithmic perspective. In: Proceedings of the 32nd ACM Symposium on the Theory of Computing (2000)","DOI":"10.1145\/335305.335325"},{"issue":"8","key":"10_CR17","doi-asserted-by":"publisher","first-page":"11976","DOI":"10.1371\/journal.pone.0011976","volume":"5","author":"A. Lancichinetti","year":"2010","unstructured":"Lancichinetti, A., Kivel\u00e4, M., Saram\u00e4ki, J., Fortunato, S.: Characterizing the community structure of complex networks. PLoS ONE\u00a05(8), e11976 (2010)","journal-title":"PLoS ONE"},{"key":"10_CR18","unstructured":"Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. CoRR abs\/0810.1355 (2008)"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Lang, K.J., Mahoney, M.: Empirical comparison of algorithms for network community detection. In: Proceedings of the 19th International Conference on World Wide Web, WWW 2010, pp. 631\u2013640 (2010)","DOI":"10.1145\/1772690.1772755"},{"key":"10_CR20","unstructured":"Li, A., Li, J., Pan, Y., Peng, P.: Homophily law of networks: Principles, methods and experiments (2012) (manuscript submitted for publication)"},{"key":"10_CR21","unstructured":"Li, A., Li, J., Pan, Y., Peng, P., Zhang, W.: Small core phenomenon of networks: Global influence core of the collaboration networks (2012) (unpublished manuscript)"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Li, A., Li, J., Peng, P.: Small community phenomenon in social networks: Local dimension (2012) (unpublished manuscript)","DOI":"10.1017\/S0960129511000570"},{"issue":"2","key":"10_CR23","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1080\/15427951.2011.566458","volume":"7","author":"A. Li","year":"2011","unstructured":"Li, A., Peng, P.: Communities structures in classical network models. Internet Mathematics\u00a07(2), 81\u2013106 (2011)","journal-title":"Internet Mathematics"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Li, A., Peng, P.: The small-community phenomenon in networks. Mathematical Structures in Computer Science, Available on CJO doi:10.1017\/S0960129511000570","DOI":"10.1017\/S0960129511000570"},{"issue":"12","key":"10_CR25","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1093\/bioinformatics\/btp203","volume":"25","author":"C.S. Liao","year":"2009","unstructured":"Liao, C.S., Lu, K., Baym, M., Singh, R., Berger, B.: IsoRankN: spectral methods for global alignment of multiple protein networks. Bioinformatics\u00a025(12), i253\u2013i258 (2009)","journal-title":"Bioinformatics"},{"issue":"2","key":"10_CR26","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.jcss.2005.06.009","volume":"72","author":"M. Mihail","year":"2006","unstructured":"Mihail, M., Papadimitriou, C., Saberi, A.: On certain connectivity properties of the internet topology. J. Comput. Syst. Sci.\u00a072(2), 239\u2013251 (2006)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"10_CR27","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1111\/1467-937X.00121","volume":"67","author":"S. Morris","year":"2000","unstructured":"Morris, S.: Contagion. The Review of Economic Studies\u00a067(1), 57\u201378 (2000)","journal-title":"The Review of Economic Studies"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Newman, M.E.J.: Detecting community structure in networks. The European Physical Journal B\u00a038 (2004)","DOI":"10.1140\/epjb\/e2004-00124-y"},{"key":"10_CR29","unstructured":"Newman, M.E.J., Barab\u00e1si, A.L., Watts, D.J. (eds.): The Structure and Dynamics of Networks. Princeton University Press (2006)"},{"key":"10_CR30","unstructured":"Onnela, J.P., Fenn, D.J., Reid, S., Porter, M.A., Mucha, P.J., Fricker, M.D., Jones, N.S.: A Taxonomy of Networks. CoRR abs\/1006.5731 (June 2010)"},{"issue":"7043","key":"10_CR31","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G. Palla","year":"2005","unstructured":"Palla, G., Derenyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature\u00a0435(7043), 814\u2013818 (2005)","journal-title":"Nature"},{"key":"10_CR32","first-page":"1082","volume":"56","author":"M.A. Porter","year":"2009","unstructured":"Porter, M.A., Onnela, J.P., Mucha, P.J.: Communities in networks. Notices of the American Mathematical Society\u00a056, 1082\u20131097 (2009)","journal-title":"Notices of the American Mathematical Society"},{"issue":"9","key":"10_CR33","doi-asserted-by":"publisher","first-page":"2658","DOI":"10.1073\/pnas.0400054101","volume":"101","author":"F. Radicchi","year":"2004","unstructured":"Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., Parisi, D.: Defining and identifying communities in networks. Proceedings of the National Academy of Sciences\u00a0101(9), 2658 (2004)","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"10_CR34","doi-asserted-by":"publisher","first-page":"26112","DOI":"10.1103\/PhysRevE.67.026112","volume":"67","author":"E. Ravasz","year":"2003","unstructured":"Ravasz, E., Barab\u00e1si, A.L.: Hierarchical organization in complex networks. Physical Review E\u00a067, 026112 (2003)","journal-title":"Physical Review E"},{"key":"10_CR35","doi-asserted-by":"crossref","unstructured":"Schaeffer, S.: Graph clustering. Computer Science Review\u00a0(1), 27\u201364","DOI":"10.1016\/j.cosrev.2007.05.001"},{"key":"10_CR36","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/1007352.1007372","volume-title":"Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, STOC 2004","author":"D.A. Spielman","year":"2004","unstructured":"Spielman, D.A., Teng, S.H.: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, STOC 2004, pp. 81\u201390. ACM, New York (2004)"},{"issue":"1","key":"10_CR37","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1186\/1471-2105-10-297","volume":"10","author":"K. Voevodski","year":"2009","unstructured":"Voevodski, K., Teng, S.H., Xia, Y.: Finding local communities in protein networks. BMC Bioinformatics\u00a010(1), 297 (2009)","journal-title":"BMC Bioinformatics"},{"key":"10_CR38","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 \u2018small-world\u2019 networks. Nature\u00a0393, 440\u2013442 (1998)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29952-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,23]],"date-time":"2023-01-23T22:54:07Z","timestamp":1674514447000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-29952-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642299513","9783642299520"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29952-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}