{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T03:01:56Z","timestamp":1725678116745},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642299513"},{"type":"electronic","value":"9783642299520"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29952-0_9","type":"book-chapter","created":{"date-parts":[[2012,5,3]],"date-time":"2012-05-03T06:14:09Z","timestamp":1336025649000},"page":"30-39","source":"Crossref","is-referenced-by-count":0,"title":["Principles of Network Computing"],"prefix":"10.1007","author":[{"given":"Yicheng","family":"Pan","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1038\/43601","volume":"401","author":"R. Albert","year":"1999","unstructured":"Albert, R., Jeong, H., BalaB\u00e1si, A.-L.: Diameter of World-Wide Web. Nature\u00a0(401), 130 (1999)","journal-title":"Nature"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Kaufman, T., Krivelevich, M., Ron, D.: Testing triangle freeness in general graphs. In: Proc. ACM-SIAM 17th Symposium on Discrete Algorithms, pp. 279\u2013288 (2006)","DOI":"10.1145\/1109557.1109589"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof Verification and Intractability of Approximation Problems. Journal of the ACM\u00a045, 501\u2013555 (1998)","journal-title":"Journal of the ACM"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/273865.273901","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Safra, S.: Probabilistic checking of proofs: a new characterization of NP. Journal of the ACM\u00a045(1), 70\u2013122 (1998)","journal-title":"Journal of the ACM"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"BalaB\u00e1si, A.-L.: Scale-free networks: a decade and beyond. Science\u00a0325 (July 24, 2009)","DOI":"10.1126\/science.1173299"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A.-L. BalaB\u00e1si","year":"1999","unstructured":"BalaB\u00e1si, A.-L., Albert, R.: Emergence of scaling in random networks. Science\u00a0(286), 509\u2013512 (1999)","journal-title":"Science"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Chung, F., Lu, L.: Complex graphs and networks. American Mathematical Society (2006)","DOI":"10.1090\/cbms\/107"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Sohler, C.: Testing expansion in bounded degree graphs. In: Proc. 48th Annual Symposium on Foundations of Computer Science, pp. 570\u2013578 (2007)","DOI":"10.1109\/FOCS.2007.4389526"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Fortunato, S.: Community detection in graphs. Physics Reports, 486 (2010)","DOI":"10.1016\/j.physrep.2009.11.002"},{"issue":"12","key":"9_CR10","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M. Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. PNAS\u00a099(12), 7821\u20137826 (2002)","journal-title":"PNAS"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. Journal of the ACM, 653\u2013750 (July 1998); Preliminary version in FOCS 1996","DOI":"10.1145\/285055.285060"},{"key":"9_CR12","unstructured":"Goldreich, O., Ron, D.: On testing expansion in bounded-degree graphs. Electronic Colloquium on Computational Complexity, TR00-020 (2000)"},{"key":"#cr-split#-9_CR13.1","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Ron, D.: Property testing in bounded degree graphs. Algorithmica, 302-343 (2002)","DOI":"10.1007\/s00453-001-0078-7"},{"key":"#cr-split#-9_CR13.2","unstructured":"Preliminary version in 29th STOC (1997)"},{"issue":"2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/s00453-001-0078-7","volume":"32","author":"O. Goldreich","year":"2002","unstructured":"Goldreich, O., Ron, D.: Property testing in bounded degree graphs. Algorithmica\u00a032(2), 302\u2013343 (2002); Conference version in STOC 1997 (1997)","journal-title":"Algorithmica"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Jonsson, P.F., Cavanna, T., Zicha, D., Bates, P.A.: Cluster analysis of networks generated through homology: automatic identification of important protein communities involved in cancer metastasis. BMC Bioinformatics\u00a07(2) (2006)","DOI":"10.1186\/1471-2105-7-2"},{"issue":"3","key":"9_CR16","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1137\/100802980","volume":"40","author":"S. Kale","year":"2011","unstructured":"Kale, S., Seshadhri, C.: Testing expansion in bounded degree graphs. SIAM Journal on Comput.\u00a040(3), 709\u2013720 (2011); Technical Report: ECCC TR07-076 (2007)","journal-title":"SIAM Journal on Comput."},{"issue":"6","key":"9_CR17","doi-asserted-by":"publisher","first-page":"1441","DOI":"10.1137\/S0097539703436424","volume":"33","author":"T. Kaufman","year":"2004","unstructured":"Kaufman, T., Krivelevich, M., Ron, D.: Tight bounds for testing bipartiteness in general graphs. SIAM Journal of Computing\u00a033(6), 1441\u20131483 (2004)","journal-title":"SIAM Journal of Computing"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.: The small world phenomenon: An algorithmic perspective. In: Proc. 32nd ACM Symp. on Theory of Computing, pp. 163\u2013170 (2000)","DOI":"10.1145\/335305.335325"},{"key":"9_CR19","unstructured":"Li, A., Li, J., Peng, P.: Small community phenomena in social networks: Local dimension (to appear)"},{"key":"9_CR20","unstructured":"Li, A., Li, J., Pan, Y., Peng, P.: Homophily law of networks: Principles, methods and experiments (to appear)"},{"key":"9_CR21","first-page":"101","volume":"18","author":"A. Li","year":"2011","unstructured":"Li, A., Pan, Y., Peng, P.: Testing conductance in general graphs. Electronic Colloquium on Computational Complexity (ECCC)\u00a018, 101 (2011)","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"issue":"2","key":"9_CR22","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.: Community Structures in Classical Network Models. Internet Math.\u00a07(2), 81\u2013106 (2011)","journal-title":"Internet Math."},{"key":"9_CR23","unstructured":"Li, A., Peng, P.: The small-community phenomenon in networks. To appear in Mathematical Structures in Computer Science (2011)"},{"key":"9_CR24","unstructured":"Li, A., Zhang, P.: Algorithmic aspects of the homophily phenomenon of networks (to appear)"},{"key":"9_CR25","first-page":"317","volume":"16","author":"A.J. Lotka","year":"1926","unstructured":"Lotka, A.J.: The frequency distribution of scientific productivity. The Journal of Washington Academy of the Sciences\u00a016, 317 (1926)","journal-title":"The Journal of Washington Academy of the Sciences"},{"key":"9_CR26","first-page":"60","volume":"2","author":"S. Milgram","year":"1967","unstructured":"Milgram, S.: The small world problem. Psychology Today\u00a0(2), 60\u201367 (1967)","journal-title":"Psychology Today"},{"key":"9_CR27","unstructured":"Nachmias, A., Shapira, A.: Testing the expansion of a graph. Electronic Colloquium on Computational Complexity, TR07-118 (2007)"},{"issue":"2","key":"9_CR28","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1002\/rsa.10013","volume":"20","author":"M. Parnas","year":"2002","unstructured":"Parnas, M., Ron, D.: Testing the diameter of graphs. Random Structures and Algorithms\u00a020(2), 165\u2013183 (2002)","journal-title":"Random Structures and Algorithms"},{"key":"9_CR29","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1093\/biomet\/42.3-4.425","volume":"42","author":"H.A. Simon","year":"1955","unstructured":"Simon, H.A.: On a class of skew distribution functions. Biometrika\u00a042, 425\u2013440 (1955)","journal-title":"Biometrika"},{"key":"9_CR30","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"},{"key":"9_CR31","doi-asserted-by":"crossref","DOI":"10.4159\/harvard.9780674434929","volume-title":"Selective Studies and the Principle of Relative Frequency in Languages","author":"G.K. Zipf","year":"1932","unstructured":"Zipf, G.K.: Selective Studies and the Principle of Relative Frequency in Languages. Harvard Univ. Press, Cambridge (1932)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29952-0_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:23:09Z","timestamp":1620127389000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29952-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642299513","9783642299520"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29952-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}