Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Localization of a one-dimensional simple random walk among power-law renewal obstacles (2201.05377v2)

Published 14 Jan 2022 in math.PR

Abstract: We consider a one-dimensional simple random walk killed by quenched soft obstacles. The position of the obstacles is drawn according to a renewal process with a power-law increment distribution. In a previous work, we computed the large-time asymptotics of the quenched survival probability. In the present work we continue our study by describing the behaviour of the random walk conditioned to survive. We prove that with large probability, the walk quickly reaches a unique time-dependent optimal gap that is free from obstacle and gets localized there. We actually establish a dichotomy. If the renewal tail exponent is smaller than one then the walk hits the optimal gap and spends all of its remaining time inside, up to finitely many visits to the bottom of the gap. If the renewal tail exponent is larger than one then the random walk spends most of its time inside of the optimal gap but also performs short outward excursions, for which we provide matching upper and lower bounds on their length and cardinality. Our key tools include a Markov renewal interpretation of the survival probability as well as various comparison arguments for obstacle environments. Our results may also be rephrased in terms of localization properties for a directed polymer among multiple repulsive interfaces.

Summary

We haven't generated a summary for this paper yet.