{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:57:40Z","timestamp":1743119860361,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031442735"},{"type":"electronic","value":"9783031442742"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-44274-2_22","type":"book-chapter","created":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T01:02:06Z","timestamp":1696035726000},"page":"297-311","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Meeting Times of Non-atomic Random Walks"],"prefix":"10.1007","author":[{"given":"Ryota","family":"Eguchi","sequence":"first","affiliation":[]},{"given":"Fukuhito","family":"Ooshita","sequence":"additional","affiliation":[]},{"given":"Michiko","family":"Inoue","sequence":"additional","affiliation":[]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,30]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.tcs.2018.06.045","volume":"753","author":"E Bampas","year":"2019","unstructured":"Bampas, E., et al.: On asynchronous rendezvous in general graphs. Theoret. Comput. Sci. 753, 80\u201390 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2018.06.045","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"22_CR2","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1002\/rsa.3240010303","volume":"1","author":"G Brightwell","year":"1990","unstructured":"Brightwell, G., Winkler, P.: Maximum hitting time for random walks on graphs. Random Struct. Algorithms 1(3), 263\u2013276 (1990). https:\/\/doi.org\/10.1002\/rsa.3240010303","journal-title":"Random Struct. Algorithms"},{"issue":"5","key":"22_CR3","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/S0020-0190(99)00017-4","volume":"69","author":"NH Bshouty","year":"1999","unstructured":"Bshouty, N.H., Higham, L., Warpechowska-Gruca, J.: Meeting times of random walks on graphs. Inf. Process. Lett. 69(5), 259\u2013265 (1999). https:\/\/doi.org\/10.1016\/S0020-0190(99)00017-4","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"22_CR4","doi-asserted-by":"publisher","first-page":"1748","DOI":"10.1137\/120900368","volume":"27","author":"C Cooper","year":"2013","unstructured":"Cooper, C., Els\u00e4sser, R., Ono, H., Radzik, T.: Coalescing random walks and voting on connected graphs. SIAM J. Discret. Math. 27(4), 1748\u20131758 (2013). https:\/\/doi.org\/10.1137\/120900368","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"22_CR5","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1137\/0406029","volume":"6","author":"D Coppersmith","year":"1993","unstructured":"Coppersmith, D., Tetali, P., Winkler, P.: Collisions among random walks on a graph. SIAM J. Discret. Math. 6(3), 363\u2013374 (1993). https:\/\/doi.org\/10.1137\/0406029","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"22_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2344422.2344427","volume":"8","author":"J Czyzowicz","year":"2012","unstructured":"Czyzowicz, J., Pelc, A., Labourel, A.: How to meet asynchronously (almost) everywhere. ACM Trans. Algorithms 8(4), 1\u201314 (2012). https:\/\/doi.org\/10.1145\/2344422.2344427","journal-title":"ACM Trans. Algorithms"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/11549345_24","volume-title":"Mathematical Foundations of Computer Science 2005","author":"G De Marco","year":"2005","unstructured":"De Marco, G., Gargano, L., Kranakis, E., Krizanc, D., Pelc, A., Vaccaro, U.: Asynchronous deterministic rendezvous in graphs. In: J\u0229drzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 271\u2013282. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11549345_24"},{"issue":"1","key":"22_CR8","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/rsa.3240060106","volume":"6","author":"U Feige","year":"1995","unstructured":"Feige, U.: A tight upper bound on the cover time for random walks on graphs. Random Struct. Algorithms 6(1), 51\u201354 (1995). https:\/\/doi.org\/10.1002\/rsa.3240060106","journal-title":"Random Struct. Algorithms"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-642-25873-2_29","volume-title":"Principles of Distributed Systems","author":"S Guilbault","year":"2011","unstructured":"Guilbault, S., Pelc, A.: Asynchronous rendezvous of anonymous agents in arbitrary graphs. In: Fern\u00e0ndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol. 7109, pp. 421\u2013434. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25873-2_29"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-48523-6_37","volume-title":"Automata, Languages and Programming","author":"Y Hassin","year":"1999","unstructured":"Hassin, Y., Peleg, D.: Distributed probabilistic polling and applications to proportionate agreement. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 402\u2013411. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48523-6_37"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Israeli, A., Jalfon, M.: Token management schemes and random walks yield self-stabilizing mutual exclusion. In: Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, pp. 119\u2013131 (1990)","DOI":"10.1145\/93385.93409"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF01048274","volume":"2","author":"JD Kahn","year":"1989","unstructured":"Kahn, J.D., Linial, N., Nisan, N., Saks, M.E.: On the cover time of random walks on graphs. J. Theor. Probab. 2, 121\u2013128 (1989)","journal-title":"J. Theor. Probab."},{"issue":"2","key":"22_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3576900","volume":"19","author":"V Kanade","year":"2023","unstructured":"Kanade, V., Mallmann-Trenn, F., Sauerwald, T.: On coalescence time in graphs-when is coalescing as fast as meeting? ACM Trans. Algorithms 19(2), 1\u201346 (2023). https:\/\/doi.org\/10.1145\/3576900","journal-title":"ACM Trans. Algorithms"},{"key":"22_CR14","first-page":"1","volume":"2","author":"L Lov\u00e1sz","year":"1993","unstructured":"Lov\u00e1sz, L.: Random walks on graphs. Comb. Paul Erdos Eighty 2, 1\u201346 (1993)","journal-title":"Comb. Paul Erdos Eighty"},{"key":"22_CR15","doi-asserted-by":"publisher","unstructured":"Oliveira, R.I., Peres, Y.: Random walks on graphs: new bounds on hitting, meeting, coalescing and returning. In: 2019 Proceedings of the Meeting on Analytic Algorithmics and Combinatorics, pp. 119\u2013126 (2019). https:\/\/doi.org\/10.1137\/1.9781611975505.13","DOI":"10.1137\/1.9781611975505.13"},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF01046996","volume":"4","author":"P Tetali","year":"1991","unstructured":"Tetali, P.: Random walks and the effective resistance of networks. J. Theor. Probab. 4, 101\u2013109 (1991)","journal-title":"J. Theor. Probab."},{"key":"22_CR17","doi-asserted-by":"publisher","unstructured":"Tetali, P., Winkler, P.: On a random walk problem arising in self-stabilizing token management. In: Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, pp. 273\u2013280. Association for Computing Machinery (1991). https:\/\/doi.org\/10.1145\/112600.112623","DOI":"10.1145\/112600.112623"},{"key":"22_CR18","unstructured":"Tetali, P., Winkler, P.: Simultaneous reversible Markov chains. Comb. Paul Erdos Eighty 1 (1993)"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-44274-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,8]],"date-time":"2024-03-08T01:04:19Z","timestamp":1709859859000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-44274-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031442735","9783031442742"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-44274-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"30 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jersey City, NJ","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.bgu.ac.il\/~SSS2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}