{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:31:22Z","timestamp":1725456682603},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642353109"},{"type":"electronic","value":"9783642353116"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35311-6_30","type":"book-chapter","created":{"date-parts":[[2012,12,4]],"date-time":"2012-12-04T02:32:28Z","timestamp":1354588348000},"page":"406-419","source":"Crossref","is-referenced-by-count":27,"title":["The Power of Local Information in Social Networks"],"prefix":"10.1007","author":[{"given":"Christian","family":"Borgs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Brautbar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jennifer","family":"Chayes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjeev","family":"Khanna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brendan","family":"Lucier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Rubinfeld, R., Vardi, S., Xie, N.: Space-efficient local computation algorithms. In: SODA, pp. 1132\u20131139 (2012)","DOI":"10.1137\/1.9781611973099.89"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chung, F.R.K., Lang, K.J.: Local graph partitioning using pagerank vectors. In: FOCS, pp. 475\u2013486 (2006)","DOI":"10.1109\/FOCS.2006.44"},{"key":"30_CR3","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"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B.: Mathematical results on scale-free random graphs. In: Handbook of Graphs and Networks: From the Genome to the Internet (2003)","DOI":"10.1002\/3527602755.ch1"},{"issue":"1","key":"30_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00493-004-0002-2","volume":"24","author":"B. Bollob\u00e1s","year":"2004","unstructured":"Bollob\u00e1s, B., Riordan, O.: The diameter of a scale-free random graph. Combinatorica\u00a024(1), 5\u201334 (2004)","journal-title":"Combinatorica"},{"issue":"3","key":"30_CR6","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1002\/rsa.1009","volume":"18","author":"B. Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B., Riordan, O., Spencer, J., Tusn\u00e1dy, G.E.: The degree sequence of a scale-free random graph process. Random Struct. Algorithms\u00a018(3), 279\u2013290 (2001)","journal-title":"Random Struct. Algorithms"},{"key":"30_CR7","unstructured":"Brautbar, M., Kearns, M.: Local algorithms for finding interesting individuals in large networks. In: Innovations in Theoretical Computer Science (ITCS), pp. 188\u2013199 (2010)"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Doerr, B., Fouz, M., Friedrich, T.: Social networks spread rumors in sublogarithmic time. In: STOC, pp. 21\u201330 (2011)","DOI":"10.1145\/1993636.1993640"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Easley, D., Kleinberg, J.: Networks, Crowds, and Markets, reasoning about a Highly Connected World. Cambridge University Press (2010)","DOI":"10.1017\/CBO9780511761942"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Faloutsos, C., McCurley, K.S., Tomkins, A.: Fast discovery of connection subgraphs. In: KDD, pp. 118\u2013127 (2004)","DOI":"10.1145\/1014052.1014068"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Giakkoupis, G., Sauerwald, T.: Rumor spreading and vertex expansion. In: SODA, pp. 1623\u20131641 (2012)","DOI":"10.1137\/1.9781611973099.129"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Giakkoupis, G., Schabanel, N.: Optimal path search in small worlds: dimension matters. In: STOC, pp. 393\u2013402 (2011)","DOI":"10.1145\/1993636.1993689"},{"key":"30_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-642-16367-8_7","volume-title":"Property Testing","author":"O. Goldreich","year":"2010","unstructured":"Goldreich, O.: Introduction to Testing Graph Properties. In: Goldreich, O. (ed.) Property Testing. LNCS, vol.\u00a06390, pp. 105\u2013141. Springer, Heidelberg (2010)"},{"issue":"4","key":"30_CR14","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S. Guha","year":"1998","unstructured":"Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica\u00a020(4), 374\u2013387 (1998)","journal-title":"Algorithmica"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Hassidim, A., Kelner, J.A., Nguyen, H.N., Onak, K.: Local graph partitions for approximation and testing. In: FOCS, pp. 22\u201331 (2009)","DOI":"10.1109\/FOCS.2009.77"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.M.: The small-world phenomenon: an algorithm perspective. In: STOC, pp. 163\u2013170 (2000)","DOI":"10.1145\/335305.335325"},{"key":"30_CR17","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1145\/167088.167149","volume-title":"Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, STOC 1993","author":"M. Naor","year":"1993","unstructured":"Naor, M., Stockmeyer, L.: What can be computed locally? In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, STOC 1993, pp. 184\u2013193. ACM, New York (1993)"},{"key":"30_CR18","doi-asserted-by":"publisher","first-page":"1562","DOI":"10.1137\/100791075","volume":"25","author":"R. Rubinfeld","year":"2011","unstructured":"Rubinfeld, R., Shapira, A.: Sublinear time algorithms. SIAM Journal on Discrete Math.\u00a025, 1562\u20131588 (2011)","journal-title":"SIAM Journal on Discrete Math."},{"key":"30_CR19","unstructured":"Rubinfeld, R., Tamir, G., Vardi, S., Xie, N.: Fast local computation algorithms. In: ITCS, pp. 223\u2013238 (2011)"},{"key":"30_CR20","unstructured":"Spielman, D.A., Teng, S.-H.: A local clustering algorithm for massive graphs and its application to nearly-linear time graph partitioning. CoRR abs\/0809.3232 (2008)"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35311-6_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T09:49:21Z","timestamp":1557395361000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35311-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642353109","9783642353116"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35311-6_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}