A limit theorem for the survival probability of a simple random walk among power-law renewal traps
Julien Poisat (CEREMADE), Fran\c{c}ois Simenhaus (CEREMADE)

TL;DR
This paper establishes a limit theorem for the survival probability of a one-dimensional simple random walk among power-law distributed traps, revealing universal and non-universal features in the asymptotic behavior.
Contribution
It proves a convergence law for the logarithm of the survival probability, involving a universal scaling limit and a variational formula with parameters like trap crossing cost.
Findings
Convergence in law of the rescaled logarithm of survival probability
Emergence of a Poisson point process as the universal limit
Identification of the asymptotic crossing cost parameter
Abstract
We consider a one-dimensional simple random walk surviving among a field of static soft traps : each time it meets a trap the walk is killed with probability 1--e -- , where is a positive and fixed parameter. The positions of the traps are sampled independently from the walk and according to a renewal process. The increments between consecutive traps, or gaps, are assumed to have a power-law decaying tail with exponent > 0. We prove convergence in law for the properly rescaled logarithm of the quenched survival probability as time goes to infinity. The normalization exponent is /( + 2), while the limiting law writes as a variational formula with both universal and non-universal features. The latter involves (i) a Poisson point process that emerges as the universal scaling limit of the properly rescaled gaps and (ii) a function of the parameter…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Theoretical and Computational Physics · Diffusion and Search Dynamics
