{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T11:10:26Z","timestamp":1725707426983},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642348617"},{"type":"electronic","value":"9783642348624"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34862-4_12","type":"book-chapter","created":{"date-parts":[[2012,11,26]],"date-time":"2012-11-26T09:00:11Z","timestamp":1353920411000},"page":"159-173","source":"Crossref","is-referenced-by-count":13,"title":["Experimental Analysis of Rumor Spreading in Social Networks"],"prefix":"10.1007","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahmoud","family":"Fouz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Friedrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_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, 509\u2013512 (1999)","journal-title":"Science"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-642-29952-0_34","volume-title":"Theory and Applications of Models of Computation","author":"H. Baumann","year":"2012","unstructured":"Baumann, H., Fraigniaud, P., Harutyunyan, H.A., de Verclos, R.: The Worst Case Behavior of Randomized Gossip. In: Agrawal, M., Cooper, S.B., Li, A. (eds.) TAMC 2012. LNCS, vol.\u00a07287, pp. 330\u2013345. Springer, Heidelberg (2012)"},{"key":"12_CR3","unstructured":"Berger, N., Borgs, C., Chayes, J.T., Saberi, A.: On the spread of viruses on the Internet. In: 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 301\u2013310 (2005)"},{"key":"12_CR4","unstructured":"Bhattacharjee, B., Druschel, P., Gummadi, K., et al.: Online social networks research at the Max Planck Institute for Software Systems, http:\/\/socialnetworks.mpi-sws.org"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/rsa.20272","volume":"35","author":"T. Bohman","year":"2009","unstructured":"Bohman, T., Frieze, A.M.: Hamilton cycles in 3-out. Random Structures & Algorithms\u00a035, 393\u2013417 (2009)","journal-title":"Random Structures & Algorithms"},{"key":"12_CR6","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":"12_CR7","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1080\/15427951.2004.10129084","volume":"1","author":"B. Bollob\u00e1s","year":"2003","unstructured":"Bollob\u00e1s, B., Riordan, O.: Coupling scale-free and classical random graphs. Internet Mathematics\u00a01, 215\u2013225 (2003b)","journal-title":"Internet Mathematics"},{"key":"12_CR8","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, 5\u201334 (2004)","journal-title":"Combinatorica"},{"key":"12_CR9","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.: The degree sequence of a scale-free random graph process. Random Structures & Algorithms\u00a018, 279\u2013290 (2001)","journal-title":"Random Structures & Algorithms"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"2508","DOI":"10.1109\/TIT.2006.874516","volume":"52","author":"S. Boyd","year":"2006","unstructured":"Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Randomized gossip algorithms. IEEE Transactions on Information Theory\u00a052, 2508\u20132530 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Censor-Hillel, K., Shachnai, H.: Fast information spreading in graphs with large weak conductance. In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 440\u2013448 (2011)","DOI":"10.1137\/1.9781611973082.35"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Censor-Hillel, K., Haeupler, B., Kelner, J.A., Maymounkov, P.: Global computation in a poorly connected world: Fast rumor spreading with no dependence on conductance. In: 44th ACM Symposium on Theory of Computing (STOC), pp. 961\u2013970 (2012)","DOI":"10.1145\/2213977.2214064"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Cha, M., Haddadi, H., Benevenuto, F., Gummadi, P.K.: Measuring user influence in Twitter: The million follower fallacy. In: 4th International AAAI Conference on Weblogs and Social Media, ICWSM (2010)","DOI":"10.1609\/icwsm.v4i1.14033"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Chierichetti, F., Lattanzi, S., Panconesi, A.: Rumour spreading and graph conductance. In: 21st ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1657\u20131663 (2010)","DOI":"10.1137\/1.9781611973075.135"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Chierichetti, F., Lattanzi, S., Panconesi, A.: Almost tight bounds for rumour spreading with conductance. In: 42nd ACM Symposium on Theory of Computing (STOC), pp. 399\u2013408 (2010)","DOI":"10.1145\/1806689.1806745"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"2602","DOI":"10.1016\/j.tcs.2010.11.001","volume":"412","author":"F. Chierichetti","year":"2011","unstructured":"Chierichetti, F., Lattanzi, S., Panconesi, A.: Rumor spreading in social networks. Theoretical Computer Science\u00a0412, 2602\u20132610 (2011)","journal-title":"Theoretical Computer Science"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1080\/15427951.2004.10129081","volume":"1","author":"F.R.K. Chung","year":"2003","unstructured":"Chung, F.R.K., Lu, L.: The average distance in a random graph with given expected degrees. Internet Mathematics\u00a01, 91\u2013113 (2003)","journal-title":"Internet Mathematics"},{"key":"12_CR18","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. Journal of Combinatorial Theory, Series B\u00a097, 269\u2013290 (2007)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/43921.43922","volume":"22","author":"A.J. Demers","year":"1988","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. Operating Systems Review\u00a022, 8\u201332 (1988)","journal-title":"Operating Systems Review"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Doerr, B., Friedrich, T., Sauerwald, T.: Quasirandom rumor spreading. In: 19th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 773\u2013781 (2008)","DOI":"10.1145\/1963190.2025379"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Doerr, B., Friedrich, T., K\u00fcnnemann, M., Sauerwald, T.: Quasirandom rumor spreading: An experimental analysis. In: 10th Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 145\u2013153 (2009)","DOI":"10.1137\/1.9781611972894.14"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Doerr, B., Fouz, M., Friedrich, T.: Social networks spread rumors in sublogarithmic time. In: 43rd ACM Symposium on Theory of Computing (STOC), pp. 21\u201330 (2011)","DOI":"10.1145\/1993636.1993640"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-642-31155-0_27","volume-title":"Algorithm Theory \u2013 SWAT 2012","author":"B. Doerr","year":"2012","unstructured":"Doerr, B., Fouz, M., Friedrich, T.: Asynchronous Rumor Spreading in Preferential Attachment Graphs. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol.\u00a07357, pp. 307\u2013315. Springer, Heidelberg (2012)"},{"key":"12_CR24","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/s10955-010-9921-z","volume":"139","author":"S. Dommers","year":"2010","unstructured":"Dommers, S., van der Hofstad, R., Hooghiemstray, G.: Diameters in preferential attachment models. J. of Statistical Physics\u00a0139, 72\u2013107 (2010)","journal-title":"J. of Statistical Physics"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Els\u00e4sser, R.: On the communication complexity of randomized broadcasting in random-like graphs. In: 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 148\u2013157 (2006)","DOI":"10.1145\/1148109.1148135"},{"key":"12_CR26","unstructured":"Els\u00e4sser, R., Sauerwald, T.: On the power of memory in randomized broadcasting. In: 19th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 218\u2013227 (2008)"},{"key":"12_CR27","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. Rand. Struct. & Algo.\u00a01, 447\u2013460 (1990)","journal-title":"Rand. Struct. & Algo."},{"key":"12_CR28","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1017\/S0963548306007681","volume":"16","author":"A.D. Flaxman","year":"2007","unstructured":"Flaxman, A.D., Frieze, A.M., Vera, J.: Adversarial deletion in a scale-free random graph process. Comb., Probab. & Comput.\u00a016, 261\u2013270 (2007)","journal-title":"Comb., Probab. & Comput."},{"key":"12_CR29","doi-asserted-by":"crossref","unstructured":"Fountoulakis, N., Panagiotou, K., Sauerwald, T.: Ultra-fast rumor spreading in social networks. In: 23rd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1642\u20131660 (2012)","DOI":"10.1137\/1.9781611973099.130"},{"key":"12_CR30","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0166-218X(85)90059-9","volume":"10","author":"A.M. Frieze","year":"1985","unstructured":"Frieze, A.M., Grimmett, G.R.: The shortest-path problem for graphs with random arc-lengths. Discrete Applied Mathematics\u00a010, 57\u201377 (1985)","journal-title":"Discrete Applied Mathematics"},{"key":"12_CR31","unstructured":"Giakkoupis, G.: Tight bounds for rumor spreading in graphs of a given conductance. In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS), pp. 57\u201368 (2011)"},{"key":"12_CR32","unstructured":"Karp, R., Schindelhauer, C., Shenker, S., V\u00f6cking, B.: Randomized rumor spreading. In: 41st IEEE Symposium on Foundations of Computer Science (FOCS), pp. 565\u2013574 (2000)"},{"key":"12_CR33","unstructured":"Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: 44th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 482\u2013491 (2003)"},{"issue":"6","key":"12_CR34","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1145\/1039488.1039491","volume":"51","author":"D. Kempe","year":"2004","unstructured":"Kempe, D., Kleinberg, J.M., Demers, A.J.: Spatial gossip and resource location protocols. J. ACM\u00a051(6), 943\u2013967 (2004)","journal-title":"J. ACM"},{"key":"12_CR35","doi-asserted-by":"crossref","unstructured":"Mislove, A., Marcon, M., Gummadi, K.P., Druschel, P., Bhattacharjee, B.: Measurement and analysis of online social networks. In: 7th ACM SIGCOMM Conference on Internet Measurement (IMC), pp. 29\u201342 (2007)","DOI":"10.1145\/1298306.1298311"},{"key":"12_CR36","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, 213\u2013223 (1987)","journal-title":"SIAM Journal on Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Design and Analysis of Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34862-4_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T03:24:07Z","timestamp":1687836247000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34862-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642348617","9783642348624"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34862-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}