Excited random walks: results, methods, open problems
From MaRDI portal
Publication:5747111
zbMath1304.60109arXiv1204.1895MaRDI QIDQ5747111
Elena Kosygina, Martin P. W. Zerner
Publication date: 11 February 2014
Full work available at URL: https://arxiv.org/abs/1204.1895
law of large numberszero-one lawsrecurrencerandom environmenttransiencelimit theoremsexcited random walkcookie walkregeneration structure
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Processes in random environments (60K37) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Research exposition (monographs, survey articles) pertaining to probability theory (60-02)
Related Items (19)
Recurrence and Transience of Critical Branching Processes in Random Environment with Immigration and an Application to Excited Random Walks ⋮ Speed of excited random walks with long backward steps ⋮ The speed of a general random walk reinforced by its recent history ⋮ Recurrence of horizontal-vertical walks ⋮ Convergence and nonconvergence of scaled self-interacting random walks to Brownian motion perturbed at extrema ⋮ Excited mob ⋮ Transience, recurrence and speed of diffusions with a non-Markovian two-phase ``use it or lose it drift ⋮ An overview of the balanced excited random walk ⋮ Long range one-cookie random walk with positive speed ⋮ Excited random walk in a Markovian environment ⋮ Transience, recurrence and the speed of a random walk in a site-based feedback environment ⋮ Infinite excursions of router walks on regular trees ⋮ Slowdown for the geodesic-biased random walk ⋮ Extreme slowdowns for one-dimensional excited random walks ⋮ The speed of a random walk excited by its recent history ⋮ Random walks with local memory ⋮ Convergence of random walks with Markovian cookie stacks to Brownian motion perturbed at extrema ⋮ Tree builder random walk: recurrence, transience and ballisticity ⋮ An excited random walk counter-example
This page was built for publication: Excited random walks: results, methods, open problems
