{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:28Z","timestamp":1750306768342,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,7,23]],"date-time":"2013-07-23T00:00:00Z","timestamp":1374537600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,7,23]]},"DOI":"10.1145\/2486159.2486197","type":"proceedings-article","created":{"date-parts":[[2013,7,16]],"date-time":"2013-07-16T18:06:58Z","timestamp":1373998018000},"page":"176-185","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Coalescing-branching random walks on graphs"],"prefix":"10.1145","author":[{"given":"Chinmoy","family":"Dutta","sequence":"first","affiliation":[{"name":"Twitter, San Francisco, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gopal","family":"Pandurangan","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore & Brown University, Providence, RI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajmohan","family":"Rajaraman","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott","family":"Roche","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,7,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780626"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378557"},{"key":"e_1_3_2_1_3_1","volume-title":"Branching-coalescing particle systems. Probability theory and related fields, 131(3):376--414","author":"Arthreya S. R.","year":"2005","unstructured":"S. R. Arthreya and J. M. Swart . Branching-coalescing particle systems. Probability theory and related fields, 131(3):376--414 , 2005 . S. R. Arthreya and J. M. Swart. Branching-coalescing particle systems. Probability theory and related fields, 131(3):376--414, 2005."},{"key":"e_1_3_2_1_4_1","volume-title":"On the trace of branching random walks. arXiv preprint arXiv:1002.2781","author":"Benjamini I.","year":"2010","unstructured":"I. Benjamini and S. M\u00fcller . On the trace of branching random walks. arXiv preprint arXiv:1002.2781 , 2010 . I. Benjamini and S. M\u00fcller. On the trace of branching random walks. arXiv preprint arXiv:1002.2781, 2010."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873716"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1070432.1070475"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63516"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11553762_1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/100793104"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806745"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873736"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.11.001"},{"key":"e_1_3_2_1_13_1","series-title":"in Mathematics Series","volume-title":"of the Mathematical Sciences, and N. S. F. (U.S.). Complex graphs and networks. Number no. 107 in CBMS Regional Conference Ser","author":"Chung F.","year":"2006","unstructured":"F. Chung , L. Lu , C. B. of the Mathematical Sciences, and N. S. F. (U.S.). Complex graphs and networks. Number no. 107 in CBMS Regional Conference Ser . in Mathematics Series . American Mathematical Society , 2006 . F. Chung, L. Lu, C. B. of the Mathematical Sciences, and N. S. F. (U.S.). Complex graphs and networks. Number no. 107 in CBMS Regional Conference Ser. in Mathematics Series. American Mathematical Society, 2006."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2005.01.003"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332440"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1582716.1582745"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835698.1835745"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_57"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10626-010-0092-5"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0914402107"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03685-9_36"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_35"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240060406"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240060106"},{"key":"e_1_3_2_1_25_1","volume-title":"Randomized broadcast in networks. Random Structures an Algorithms, 1(4):447--460","author":"Feige U.","year":"1990","unstructured":"U. Feige , D. Peleg , P. Raghavan , and E. Upfal . Randomized broadcast in networks. Random Structures an Algorithms, 1(4):447--460 , 1990 . U. Feige, D. Peleg, P. Raghavan, and E. Upfal. Randomized broadcast in networks. Random Structures an Algorithms, 1(4):447--460, 1990."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1886521.1886565"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095246"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498374"},{"key":"e_1_3_2_1_29_1","first-page":"57","volume-title":"STACS","year":"2011","unstructured":"Giakkoupis. Tight bounds for rumor spreading in graphs of a given conductance . In STACS , pages 57 -- 68 , 2011 . Giakkoupis. Tight bounds for rumor spreading in graphs of a given conductance. In STACS, pages 57--68, 2011."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095245"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jtbi.2011.07.015"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/781027.781046"},{"key":"e_1_3_2_1_33_1","volume-title":"The theory of branching processes. Die Grundlehren der Mathematischen Wissenschaften","author":"Harris T. E.","year":"1963","unstructured":"T. E. Harris . The theory of branching processes. Die Grundlehren der Mathematischen Wissenschaften , Bd. 119 . Springer-Verlag , Berlin , 1963 . T. E. Harris. The theory of branching processes. Die Grundlehren der Mathematischen Wissenschaften, Bd. 119. Springer-Verlag, Berlin, 1963."},{"key":"e_1_3_2_1_34_1","volume-title":"Sept.","author":"Kessler D. A.","year":"2007","unstructured":"D. A. Kessler . Epidemic Size in the SIS Model of Endemic Infec- Tions. ArXiv e-prints , Sept. 2007 . D. A. Kessler. Epidemic Size in the SIS Model of Endemic Infec- Tions. ArXiv e-prints, Sept. 2007."},{"key":"e_1_3_2_1_35_1","first-page":"1","volume-title":"Combinatorics, Paul Erd\u00f6s is Eighty","author":"Lov\u00e1sz L.","year":"1993","unstructured":"L. Lov\u00e1sz . Random walks on graphs: a survey . In Combinatorics, Paul Erd\u00f6s is Eighty , pages 1 -- 46 . 1993 . L. Lov\u00e1sz. Random walks on graphs: a survey. In Combinatorics, Paul Erd\u00f6s is Eighty, pages 1--46. 1993."},{"key":"e_1_3_2_1_36_1","volume-title":"Branching random walks on trees. Stochastic Processes and their Applications, 42(2):255--267","author":"Madras N.","year":"1992","unstructured":"N. Madras and R. Schinazi . Branching random walks on trees. Stochastic Processes and their Applications, 42(2):255--267 , 1992 . N. Madras and R. Schinazi. Branching random walks on trees. Stochastic Processes and their Applications, 42(2):255--267, 1992."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176991894"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63529"},{"key":"e_1_3_2_1_39_1","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"Mitzenmacher M.","year":"2004","unstructured":"M. Mitzenmacher and E. Upfal . Probability and Computing: Randomized Algorithms and Probabilistic Analysis . Cambridge University Press , 2004 . M. Mitzenmacher and E. Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2004."},{"key":"e_1_3_2_1_40_1","volume-title":"Epidemic threshold for the susceptible-infectious-susceptible model on random networks. Physical review letters, 104(25):258701","author":"Parshani R.","year":"2010","unstructured":"R. Parshani , S. Carmi , and S. Havlin . Epidemic threshold for the susceptible-infectious-susceptible model on random networks. Physical review letters, 104(25):258701 , 2010 . R. Parshani, S. Carmi, and S. Havlin. Epidemic threshold for the susceptible-infectious-susceptible model on random networks. Physical review letters, 104(25):258701, 2010."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1214\/07-AOP357"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1137\/0605030"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-011-0155-y"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1151374.1151386"}],"event":{"name":"SPAA '13: 25th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Montr\u00e9al Qu\u00e9bec Canada","acronym":"SPAA '13"},"container-title":["Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2486159.2486197","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2486159.2486197","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:53Z","timestamp":1750231733000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2486159.2486197"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,23]]},"references-count":44,"alternative-id":["10.1145\/2486159.2486197","10.1145\/2486159"],"URL":"https:\/\/doi.org\/10.1145\/2486159.2486197","relation":{},"subject":[],"published":{"date-parts":[[2013,7,23]]},"assertion":[{"value":"2013-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}