{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:52:47Z","timestamp":1742935967551,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642302862"},{"type":"electronic","value":"9783642302879"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-30287-9_17","type":"book-chapter","created":{"date-parts":[[2012,7,26]],"date-time":"2012-07-26T16:43:37Z","timestamp":1343321017000},"page":"161-168","source":"Crossref","is-referenced-by-count":0,"title":["Tipping Points of Diehards in Social Consensus on Large Random Networks"],"prefix":"10.1007","author":[{"given":"W.","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Lim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Szymanski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Baronchelli, A., Felici, M., Loreto, V., Caglioti, E., Steels, L.: Sharp transition towards shared vocabularies in multi-agent systems. J. Stat. Mech.: Theory Exp., P06014 (2006)","DOI":"10.1088\/1742-5468\/2006\/06\/P06014"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"46103","DOI":"10.1103\/PhysRevE.83.046103","volume":"83","author":"A. Baronchelli","year":"2011","unstructured":"Baronchelli, A.: Role of feedback and broadcasting in the naming game. Phys. Rev. E\u00a083, 046103 (2011)","journal-title":"Phys. Rev. E"},{"issue":"5","key":"17_CR3","doi-asserted-by":"publisher","first-page":"58004","DOI":"10.1209\/0295-5075\/88\/58004","volume":"88","author":"E. Pugliese","year":"2009","unstructured":"Pugliese, E., Castellano, C.: Heterogeneous pair approximation for voter models on networks. Eur. Lett.\u00a088(5), 58004 (2009)","journal-title":"Eur. Lett."},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"15879","DOI":"10.1073\/pnas.252631999","volume":"99","author":"F. Chung","year":"2002","unstructured":"Chung, F., Lu, L.: The Average Distances in Random Graphs with Given Expected Degrees. Proceeding of National Academy of Science\u00a099, 15879\u201315882 (2002)","journal-title":"Proceeding of National Academy of Science"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"63011","DOI":"10.1088\/1367-2630\/10\/6\/063011","volume":"10","author":"F. Vazquez","year":"2008","unstructured":"Vazquez, F., Eguluz, V.M.: Analytical solution of the voter model on uncorrelated networks. New Journal of Physics\u00a010, 063011 (2008)","journal-title":"New Journal of Physics"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"11130","DOI":"10.1103\/PhysRevE.84.011130","volume":"84","author":"J. Xie","year":"2011","unstructured":"Xie, J., Sreenivasan, S., Korniss, G., Zhang, W., Lim, C., Szymanski, B.K.: Social Consensus through the Influence of Committed Minorities. Phys. Rev. E\u00a084, 011130 (2011)","journal-title":"Phys. Rev. E"},{"issue":"2","key":"17_CR7","doi-asserted-by":"publisher","first-page":"25115","DOI":"10.1063\/1.3598450","volume":"21","author":"W. Zhang","year":"2011","unstructured":"Zhang, W., Lim, C., Sreenivasan, S., Xie, J., Szymanski, B.K., Korniss, G.: Social influencing and associated random walk models: Asymptotic consensus times on the complete graph. Chaos\u00a021(2), 025115 (2011)","journal-title":"Chaos"}],"container-title":["Studies in Computational Intelligence","Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30287-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T01:49:28Z","timestamp":1676771368000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-30287-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642302862","9783642302879"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30287-9_17","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2013]]}}}