{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:56:48Z","timestamp":1742957808296,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319774039"},{"type":"electronic","value":"9783319774046"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-77404-6_14","type":"book-chapter","created":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T10:03:11Z","timestamp":1520848991000},"page":"174-186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Random Walks with Multiple Step Lengths"],"prefix":"10.1007","author":[{"given":"Lucas","family":"Boczkowski","sequence":"first","affiliation":[]},{"given":"Brieuc","family":"Guinard","sequence":"additional","affiliation":[]},{"given":"Amos","family":"Korman","sequence":"additional","affiliation":[]},{"given":"Zvi","family":"Lotker","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Renault","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,13]]},"reference":[{"issue":"3","key":"14_CR1","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1017\/S0963548303005625","volume":"12","author":"M Adler","year":"2003","unstructured":"Adler, M., R\u00e4cke, H., Sivadasan, N., Sohler, C., V\u00f6cking, B.: Randomized pursuit-evasion in graphs. Comb. Probab. Comput. 12(3), 225\u2013244 (2003)","journal-title":"Comb. Probab. Comput."},{"key":"14_CR2","unstructured":"Aldous, D., Fill, J.A.: Reversible Markov chains and random walks on graphs. Unfinished monograph, recompiled 2014 (2002). http:\/\/www.stat.berkeley.edu\/aldous\/RWG\/book.html"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Aleliunas, R., Karp, R.M., Lipton, R.J., Lovasz, L., Rackoff, C.: Random walks, universal traversal sequences, and the complexity of maze problems. In: SFCS. IEEE Computer Society, Washington, D.C., USA (1979)","DOI":"10.1109\/SFCS.1979.34"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"097901","DOI":"10.1103\/PhysRevLett.88.097901","volume":"88","author":"F Bartumeus","year":"2002","unstructured":"Bartumeus, F., Catalan, J., Fulco, U.L., Lyra, M.L., Viswanathan, G.M.: Optimizing the encounter rate in biological interactions: L\u00e9vy versus Brownian strategies. Phys. Rev. Lett. 88, 097901 (2002)","journal-title":"Phys. Rev. Lett."},{"issue":"02","key":"14_CR5","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1142\/S0218348X07003460","volume":"15","author":"F Bartumeus","year":"2007","unstructured":"Bartumeus, F.: L\u00e9vy processes in animal movement: an evolutionary hypothesis. Fractals 15(02), 151\u2013162 (2007)","journal-title":"Fractals"},{"issue":"1","key":"14_CR6","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1103\/RevModPhys.83.81","volume":"83","author":"O B\u00e9nichou","year":"2011","unstructured":"B\u00e9nichou, O., Loverdo, C., Moreau, M., Voituriez, R.: Intermittent search strategies. Rev. Mod. Phy. 83(1), 81 (2011)","journal-title":"Rev. Mod. Phy."},{"issue":"3","key":"14_CR7","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1002\/rsa.20539","volume":"45","author":"I Benjamini","year":"2014","unstructured":"Benjamini, I., Kozma, G., Wormald, N.: The mixing time of the giant component of a random graph. Random Struct. Algorithms 45(3), 383\u2013407 (2014)","journal-title":"Random Struct. Algorithms"},{"issue":"24","key":"14_CR8","doi-asserted-by":"publisher","first-page":"6929","DOI":"10.1021\/bi00527a028","volume":"20","author":"OG Berg","year":"1981","unstructured":"Berg, O.G., Winter, R.B., Von Hippel, P.H.: Diffusion-driven mechanisms of protein translocation on nucleic acids. 1. Models and theory. Biochemistry 20(24), 6929\u20136948 (1981)","journal-title":"Biochemistry"},{"issue":"1595","key":"14_CR9","doi-asserted-by":"publisher","first-page":"1743","DOI":"10.1098\/rspb.2005.3462","volume":"273","author":"D Boyer","year":"2006","unstructured":"Boyer, D., et al.: Scale-free foraging by primates emerges from their interaction with a complex environment. Proc. R. Soc. Lond. B Biol. Sci. 273(1595), 1743\u20131750 (2006)","journal-title":"Proc. R. Soc. Lond. B Biol. Sci."},{"issue":"10","key":"14_CR10","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1038\/nphys3413","volume":"11","author":"M Chupeau","year":"2015","unstructured":"Chupeau, M., Benichou, O., Voituriez, R.: Cover times of random searches. Nat. Phy. 11(10), 844 (2015)","journal-title":"Nat. Phy."},{"issue":"4","key":"14_CR11","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1002\/rsa.20201","volume":"32","author":"C Cooper","year":"2008","unstructured":"Cooper, C., Frieze, A.: The cover time of the Giant component of a random graph. Random Struct. Algorithms 32(4), 401\u2013439 (2008)","journal-title":"Random Struct. Algorithms"},{"issue":"2","key":"14_CR12","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1137\/S0895480193260595","volume":"9","author":"D Coppersmith","year":"1996","unstructured":"Coppersmith, D., Feige, U., Shearer, J.B.: Random walks on regular and irregular graphs. SIAM J. Discret. Math. 9(2), 301\u2013308 (1996)","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"14_CR13","doi-asserted-by":"publisher","first-page":"1640","DOI":"10.1529\/biophysj.104.045773","volume":"87","author":"M Coppey","year":"2004","unstructured":"Coppey, M., Bnichou, O., Voituriez, R., Moreau, M.: Kinetics of target site localization of a protein on DNA: a stochastic approach. Biophys. J. 87(3), 1640\u20131649 (2004)","journal-title":"Biophys. J ."},{"issue":"Part 3","key":"14_CR14","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.tcs.2015.09.011","volume":"608","author":"J Czyzowicz","year":"2015","unstructured":"Czyzowicz, J., G\u00e7sieniec, L., Georgiou, K., Kranakis, E., MacQuarrie, F.: The Beachcombers\u2019 problem: walking and searching with mobile robots. Theor. Comput. Sci. 608(Part 3), 201\u2013218 (2015). Structural Information and Communication Complexity","journal-title":"Theor. Comput. Sci."},{"issue":"7165","key":"14_CR15","doi-asserted-by":"publisher","first-page":"1044","DOI":"10.1038\/nature06199","volume":"449","author":"AM Edwards","year":"2007","unstructured":"Edwards, A.M., et al.: Revisiting levy flight search patterns of wandering albatrosses, bumblebees and deer. Nature 449(7165), 1044 (2007)","journal-title":"Nature"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1002\/andp.19113390313","volume":"34","author":"A Einstein","year":"1911","unstructured":"Einstein, A.: Investigations on the theory of the Brownian movement. Annal. Physik 34, 591\u2013592 (1911)","journal-title":"Annal. Physik"},{"key":"14_CR17","unstructured":"Feige, U.: Collecting coupons on trees, and the analysis of random walks. Technical report (1994)"},{"issue":"4","key":"14_CR18","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1002\/rsa.3240060406","volume":"6","author":"U Feige","year":"1995","unstructured":"Feige, U.: A tight lower bound on the cover time for random walks on graphs. Random Struct. Algorithms 6(4), 433\u2013438 (1995)","journal-title":"Random Struct. Algorithms"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Fonio, E., Heyman, Y., Boczkowski, L., Gelblum, A., Kosowski, A., Korman, A., Feinerman, O.: A locally-blazed ant trail achieves efficient collective navigation despite limited information. eLife 5 (2016)","DOI":"10.7554\/eLife.20185"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Friedman, J.: A proof of Alon\u2019s second eigenvalue conjecture and related problems. CoRR, cs.DM\/0405020 (2004)","DOI":"10.1145\/780542.780646"},{"key":"14_CR21","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1038\/nature11098","volume":"486","author":"TH Harris","year":"2012","unstructured":"Harris, T.H., et al.: Generalized L\u00e9vy walks and the role of chemokines in migration of effector CD8(+) T cells. Nature 486, 545 (2012)","journal-title":"Nature"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Israeli, A., Jalfon, M.: Token management schemes and random walks yield self-stabilizing mutual exclusion. In: PODC. ACM (1990)","DOI":"10.1145\/93385.93409"},{"key":"14_CR23","unstructured":"Kanade, V., Mallmann-Trenn, F., Sauerwald, T.: On coalescence time in graphs-when is coalescing as fast as meeting? CoRR, abs\/1611.02460 (2016)"},{"issue":"6","key":"14_CR24","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 51(6), 943\u2013967 (2004)","journal-title":"J. ACM"},{"key":"14_CR25","doi-asserted-by":"publisher","first-page":"4873","DOI":"10.1103\/PhysRevE.49.4873","volume":"49","author":"J Klafter","year":"1994","unstructured":"Klafter, J., Zumofen, G.: L\u00e9vy statistics in a Hamiltonian system. Phys. Rev. E 49, 4873 (1994)","journal-title":"Phys. Rev. E"},{"issue":"2","key":"14_CR26","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1063\/1.881487","volume":"49","author":"J Klafter","year":"1996","unstructured":"Klafter, J., Shlesinger, M.F., Zumofen, G.: Beyond Brownian motion. Phys. Today 49(2), 33 (1996)","journal-title":"Phys. Today"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.M.: The small-world phenomenon: an algorithmic perspective. In: STOC (2000)","DOI":"10.1145\/335305.335325"},{"key":"14_CR28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511750854","volume-title":"Random Walk: A Modern Introduction","author":"G Lawler","year":"2010","unstructured":"Lawler, G., Limic, V.: Random Walk: A Modern Introduction. Cambridge University Press, Cambridge (2010)"},{"key":"14_CR29","doi-asserted-by":"publisher","DOI":"10.1090\/mbk\/058","volume-title":"Markov Chains and Mixing","author":"DA Levin","year":"2008","unstructured":"Levin, D.A., Peres, Y., Wilmer, E.L.: Markov Chains and Mixing. American Mathematical Society, Providence (2008)"},{"issue":"32","key":"14_CR30","doi-asserted-by":"publisher","first-page":"11055","DOI":"10.1073\/pnas.0803117105","volume":"105","author":"MA Lomholt","year":"2008","unstructured":"Lomholt, M.A., et al.: L\u00e9vy strategies in intermittent search processes are advantageous. Proc. Natl. Acad. Sci. 105(32), 11055\u201311059 (2008)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"14_CR31","unstructured":"Loverdo, C.: Optimal search strategies and intermittent random walk: from restriction enzymes to the albatross flight, December 2009"},{"issue":"4","key":"14_CR32","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1017\/S096354830500684X","volume":"14","author":"R Lyons","year":"2005","unstructured":"Lyons, R.: Asymptotic enumeration of spanning trees. Comb. Probab. Comput. 14(4), 491\u2013592 (2005)","journal-title":"Comb. Probab. Comput."},{"issue":"6","key":"14_CR33","doi-asserted-by":"publisher","first-page":"065142","DOI":"10.1088\/0953-8984\/19\/6\/065142","volume":"19","author":"G Oshanin","year":"2007","unstructured":"Oshanin, G., et al.: Intermittent random walks for an optimal search strategy: one-dimensional case. J. Phy. Condens. Matter 19(6), 065142 (2007)","journal-title":"J. Phy. Condens. Matter"},{"key":"14_CR34","first-page":"1905","volume":"72","author":"K Pearson","year":"1865","unstructured":"Pearson, K.: The problem of the random walk. Nature 72, 1905 (1865)","journal-title":"Nature"},{"key":"14_CR35","doi-asserted-by":"crossref","unstructured":"Reingold, O.: Undirected connectivity in log-space. J. ACM 55(4), 17:1\u201317:24 (2008)","DOI":"10.1145\/1391289.1391291"},{"key":"14_CR36","unstructured":"Reynolds, G.: Navigating our world like birds and bees. The New York Times (2014)"},{"key":"14_CR37","doi-asserted-by":"crossref","unstructured":"Rhee, I., Shin, M., Hong, S., Lee, K., Chong, S.: On the Levy-walk nature of human mobility. In: IEEE INFOCOM 2008 (2008)","DOI":"10.1109\/INFOCOM.2008.145"},{"issue":"5851","key":"14_CR38","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1126\/science.318.5851.742","volume":"318","author":"J Travis","year":"2007","unstructured":"Travis, J.: Do wandering albatrosses care about math? Science 318(5851), 742\u2013743 (2007)","journal-title":"Science"},{"issue":"6581","key":"14_CR39","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1038\/381413a0","volume":"381","author":"GM Viswanathan","year":"1996","unstructured":"Viswanathan, G.M., et al.: Levy flight search patterns of wandering albatrosses. Nature 381(6581), 413 (1996)","journal-title":"Nature"},{"issue":"6756","key":"14_CR40","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1038\/44831","volume":"401","author":"GM Viswanathan","year":"1999","unstructured":"Viswanathan, G.M., et al.: Optimizing the success of random searches. Nature 401(6756), 911 (1999)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","LATIN 2018: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77404-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:01:36Z","timestamp":1709827296000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-77404-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319774039","9783319774046"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77404-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"13 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Buenos Aires","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentina","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/latin2018.dc.uba.ar\/#","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}