{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:22:05Z","timestamp":1759332125774,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029295"},{"type":"electronic","value":"9783642029301"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02930-1_31","type":"book-chapter","created":{"date-parts":[[2009,7,2]],"date-time":"2009-07-02T11:05:04Z","timestamp":1246532704000},"page":"375-386","source":"Crossref","is-referenced-by-count":36,"title":["Rumor Spreading in Social Networks"],"prefix":"10.1007","author":[{"given":"Flavio","family":"Chierichetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silvio","family":"Lattanzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Panconesi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5439","key":"31_CR1","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(5439), 509\u2013512 (1999)","journal-title":"Science"},{"key":"31_CR2","unstructured":"Berger, N., Borgs, C., Chayes, J.T., Saberi, A.: On the spread of viruses on the internet. In: SODA 2005, pp. 301\u2013310 (2005)"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Boyd, S.P., Ghosh, A., Prabhakar, B., Shah, D.: Gossip algorithms: design, analysis and applications. In: INFOCOM 2005, pp. 1653\u20131664 (2005)","DOI":"10.1109\/INFCOM.2005.1498447"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/15427951.2004.10129080","volume":"1","author":"B. Bollob\u00e1s","year":"2003","unstructured":"Bollob\u00e1s, B., Riordan, O.: Robustness and vulnerability of scale-free random graphs. Internet Mathematics\u00a01, 1\u201335 (2003)","journal-title":"Internet Mathematics"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B., Riordan, O.: Coupling Scale-Free and Classical Random Graphs. Internet Mathematics\u00a01(2) (2003)","DOI":"10.1080\/15427951.2004.10129084"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B., Riordan, O.: The Diameter of a Scale-Free Random Graph. Combinatorica\u00a024(1) (January 2004)","DOI":"10.1007\/s00493-004-0002-2"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B., Riordan, O., Spencer, J., Tusn\u00e1dy, G.: The degree sequence of a scale-free random graph process. Random Structures & Algorithms\u00a018(3) (May 2001)","DOI":"10.1002\/rsa.1009"},{"issue":"2","key":"31_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.jctb.2006.05.007","volume":"97","author":"C. Cooper","year":"2007","unstructured":"Cooper, C., Frieze, A.M.: The cover time of the preferential attachment graph. J. Comb. Theory, Ser. B\u00a097(2), 269\u2013290 (2007)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Demers, A.J., Greene, D.H., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H.E., Swinehart, D.C., Terry, D.B.: Epidemic Algorithms for Replicated Database Maintenance. In: PODC 1987, pp. 1\u201312 (1987)","DOI":"10.1145\/41840.41841"},{"key":"31_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511581274","volume-title":"Concentration of Measure for the Analysis of Randomised Algorithms","author":"D. Dubhashi","year":"2009","unstructured":"Dubhashi, D., Panconesi, A.: Concentration of Measure for the Analysis of Randomised Algorithms. Cambridge University Press, Cambridge (2009)"},{"issue":"4","key":"31_CR11","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1002\/rsa.3240010406","volume":"1","author":"U. Feige","year":"1990","unstructured":"Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Randomized Broadcast in Networks. Random Struct. Algorithms\u00a01(4), 447\u2013460 (1990)","journal-title":"Random Struct. Algorithms"},{"issue":"4","key":"31_CR12","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1002\/rsa.20197","volume":"31","author":"D. Fernholz","year":"2007","unstructured":"Fernholz, D., Ramachandran, V.: The diameter of sparse random graphs. Random Struct. Algorithms\u00a031(4), 482\u2013516 (2007)","journal-title":"Random Struct. Algorithms"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"Flaxman, A., Frieze, A.M., Fenner, T.I.: High Degree Vertices and Eigenvalues in the Preferential Attachment Graph. Internet Mathematics\u00a02(1) (2005)","DOI":"10.1080\/15427951.2005.10129097"},{"key":"31_CR14","unstructured":"Flaxman, A., Frieze, A.M., Vera, J.: Adversarial deletion in a scale free random graph process. In: SODA 2005, pp. 287\u2013292 (2005)"},{"key":"31_CR15","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0166-218X(85)90059-9","volume":"10","author":"A. Frieze","year":"1985","unstructured":"Frieze, A., Grimmett, G.: The shortest-path problem for graphs with random arc-lengths. Discrete Applied Mathematics\u00a010, 57\u201377 (1985)","journal-title":"Discrete Applied Mathematics"},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"Mihail, M., Papadimitriou, C.H., Saberi, A.: On Certain Connectivity Properties of the Internet Topology. In: FOCS 2003, pp. 28\u201335 (2003)","DOI":"10.1109\/SFCS.2003.1238178"},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"Mosk-Aoyama, D., Shah, D.: Fast Distributed Algorithms for Computing Separable Functions. IEEE Transactions on Information Theory\u00a054(7)","DOI":"10.1109\/TIT.2008.924648"},{"issue":"1","key":"31_CR18","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1137\/0147013","volume":"47","author":"B. Pittel","year":"1987","unstructured":"Pittel, B.: On spreading a rumor. SIAM Journal on Applied Mathematics\u00a047(1), 213\u2013223 (1987)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"31_CR19","unstructured":"Doerr, B., Friedrich, T., Sauerwald, T.: Quasirandom Broadcasting. In: Proceedings of SODA 2008, pp. 773\u2013781 (2008)"},{"key":"31_CR20","volume-title":"Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-tolerance","author":"J. Hromkovic","year":"2005","unstructured":"Hromkovic, J., Klasing, R., Pelc, A., Ruzicka, P.: Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-tolerance. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02930-1_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T01:49:23Z","timestamp":1558403363000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02930-1_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029295","9783642029301"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02930-1_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}