{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T14:21:23Z","timestamp":1778768483064,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T00:00:00Z","timestamp":1560729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/N004566\/1."],"award-info":[{"award-number":["EP\/N004566\/1."]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100011199","name":"European Research Council","doi-asserted-by":"publisher","award":["679660"],"award-info":[{"award-number":["679660"]}],"id":[{"id":"10.13039\/100011199","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,17]]},"DOI":"10.1145\/3323165.3323204","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T12:14:30Z","timestamp":1560860070000},"page":"103-113","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["The Dispersion Time of Random Walks on Finite Graphs"],"prefix":"10.1145","author":[{"given":"Nicol\u00e1s","family":"Rivera","sequence":"first","affiliation":[{"name":"University of Cambridge, Cambridge, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Sauerwald","sequence":"additional","affiliation":[{"name":"University of Cambridge, Cambridge, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandre","family":"Stauffer","sequence":"additional","affiliation":[{"name":"University of Bath, Bath, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Sylvester","sequence":"additional","affiliation":[{"name":"University of Cambridge, Cambridge, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-010-0125-1"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486178"},{"key":"e_1_3_2_1_3_1","unstructured":"David Aldous and James Allen Fill. 2002. Reversible Markov Chains and Random Walks on Graphs. Unfinished monograph recompiled 2014.  David Aldous and James Allen Fill. 2002. Reversible Markov Chains and Random Walks on Graphs. Unfinished monograph recompiled 2014."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548311000125"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Steve Alpern and Diane J Reyniers. 2002. Spatial dispersion as a dynamic coordination problem. Theory and decision Vol. 53 1 (2002) 29--59.  Steve Alpern and Diane J Reyniers. 2002. Spatial dispersion as a dynamic coordination problem. Theory and decision Vol. 53 1 (2002) 29--59.","DOI":"10.1023\/A:1020891631738"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1214\/12-AOP762"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1214\/11-AOP735"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-012-0476-6"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20752"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/060660345"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629671"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(13)80111-4"},{"key":"e_1_3_2_1_13_1","first-page":"3","article-title":"Internal diffusion limited aggregation on discrete groups having exponential growth","volume":"137","author":"Blach\u00e8re S\u00e9bastien","year":"2007","journal-title":"Probab. Theory Related Fields"},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM","author":"Bogdan Paul","year":"2012"},{"key":"e_1_3_2_1_15_1","volume-title":"British Journal of Mathematics & Computer Science","volume":"8","author":"Brennan Charlotte","year":"2015"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1214\/16-AOP1157"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/080729542"},{"key":"e_1_3_2_1_18_1","unstructured":"Michael Damron Janko Gravner Matthew Junge Hanbaek Lyu and David Sivakoff. 2017. Parking on transitive unimodular graphs. Preprint Vol. arXiv:1710.10529 (2017).  Michael Damron Janko Gravner Matthew Junge Hanbaek Lyu and David Sivakoff. 2017. Parking on transitive unimodular graphs. Preprint Vol. arXiv:1710.10529 (2017)."},{"key":"e_1_3_2_1_19_1","first-page":"95","article-title":"A growth model, a game, an algebra, Lagrange inversion, and characteristic classes","volume":"49","author":"Diaconis P.","year":"1991","journal-title":"Rend. Sem. Mat. Univ. Politec. Torino"},{"key":"e_1_3_2_1_20_1","unstructured":"Hugo Duminil-Copin Itai Benjamini Gady Kozma and Cyrille Lucas. 2017. Internal Diffusion-Limited aggregation with uniform starting points. Preprint Vol. arxiv:1707.03241 (2017).  Hugo Duminil-Copin Itai Benjamini Gady Kozma and Cyrille Lucas. 2017. Internal Diffusion-Limited aggregation with uniform starting points. Preprint Vol. arxiv:1707.03241 (2017)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1214\/ECP.v18-2862"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20412"},{"key":"e_1_3_2_1_23_1","unstructured":"Christina Goldschmidt and Micha\u0142 Przykucki. 2016. Parking on a random tree. Preprint Vol. arXiv:1610.08786 (2016).  Christina Goldschmidt and Micha\u0142 Przykucki. 2016. Parking on a random tree. Preprint Vol. arXiv:1610.08786 (2016)."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1214\/ECP.v13-1374"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1214\/EJP.v17-1940"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-2011-00716-9"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1214\/EJP.v18-3137"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176988377"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176989542"},{"key":"e_1_3_2_1_30_1","unstructured":"David A. Levin Yuval Peres and Elizabeth L. Wilmer. 2009. Markov chains and mixing times .American Mathematical Society Providence RI. Xviii+ 371 pages. With a chapter by James G. Propp and David B. Wilson.  David A. Levin Yuval Peres and Elizabeth L. Wilmer. 2009. Markov chains and mixing times .American Mathematical Society Providence RI. Xviii+ 371 pages. With a chapter by James G. Propp and David B. Wilson."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1090\/bull\/1573"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1090\/bull\/1573"},{"key":"e_1_3_2_1_33_1","unstructured":"Lionel Levine and Vittoria Silvestri. 2018. How long does it take for Internal DLA to forget its initial profile? Preprint Vol. arXiv:1801.0853 (2018).  Lionel Levine and Vittoria Silvestri. 2018. How long does it take for Internal DLA to forget its initial profile? Preprint Vol. arXiv:1801.0853 (2018)."},{"key":"e_1_3_2_1_34_1","volume-title":"Bolyai Soc. Math. Stud.","volume":"2","author":"Lov\u00e1sz L\u00e1szl\u00f3","year":"1996"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-013-0505-0"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.451129"},{"key":"e_1_3_2_1_37_1","first-page":"3","article-title":"Internal diffusion-limited aggregation: parallel algorithms and complexity","volume":"99","author":"Moore Cristopher","year":"2000","journal-title":"J. Statist. Phys."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10959-013-0497-9"},{"key":"e_1_3_2_1_39_1","first-page":"482","article-title":"Internal DLA generated by cookie random walks on","volume":"16","author":"Raimond Olivier","year":"2011","journal-title":"Z. Electron. Commun. Probab."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Nicol\u00e1s Rivera Alexandre Stauffer Thomas Sauerwald and John Sylvester. 2018. The dispersion time of random walks on finite graphs. Preprint Vol. arXiv:1808.09219 (2018).  Nicol\u00e1s Rivera Alexandre Stauffer Thomas Sauerwald and John Sylvester. 2018. The dispersion time of random walks on finite graphs. Preprint Vol. arXiv:1808.09219 (2018).","DOI":"10.1145\/3323165.3323204"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1214\/EJP.v15-775"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1214\/17-AOP1224"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1214\/17-AAP1339"}],"event":{"name":"SPAA '19: 31st ACM Symposium on Parallelism in Algorithms and Architectures","location":"Phoenix AZ USA","acronym":"SPAA '19","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"]},"container-title":["The 31st ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323165.3323204","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3323165.3323204","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:16Z","timestamp":1750202596000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323165.3323204"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,17]]},"references-count":43,"alternative-id":["10.1145\/3323165.3323204","10.1145\/3323165"],"URL":"https:\/\/doi.org\/10.1145\/3323165.3323204","relation":{},"subject":[],"published":{"date-parts":[[2019,6,17]]},"assertion":[{"value":"2019-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}