Cutoff phenomenon for nearest Lamperti's random walk
From MaRDI portal
Publication:2176364
DOI10.1007/s11009-018-9666-8zbMath1437.60055OpenAlexW2888799838WikidataQ129331606 ScholiaQ129331606MaRDI QIDQ2176364
Publication date: 4 May 2020
Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11009-018-9666-8
cutofflaw of large numbershitting timesbranching structure within the random walkLamperti's random walk
Sums of independent random variables; random walks (60G50) Strong limit theorems (60F15) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)
Related Items (2)
Minima of independent time-inhomogeneous random walks ⋮ Extremum of a time-inhomogeneous branching random walk
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mixing times are hitting times of large sets
- A law of the iterated logarithm for a class of polynomial hypergroups
- Criteria for the recurrence or transience of stochastic process. I
- Total variation cutoff in birth-and-death chains
- On the number of cutpoints of the transient nearest neighbor random walk on the line
- Transient nearest neighbor random walk on the line
- Transient nearest neighbor random walk and Bessel process
- Strong laws of large numbers for random walks associated with a class of one-dimensional convolution structures
- Characterization of cutoff for reversible Markov chains
- Criteria for stochastic processes. II: Passage-time moments
- Cutoff and mixing time for transient random walks in random environments
- Comportement asymptotique des marches aleatoires associees aux polynomes de Gegenbauer et applications
- Branching Processes in Simple Random Walk
- Asymptotic behaviour for random walks in random environments
- An extension of Khintchine's estimate for large deviations to a class of markov chains converging to a singular diffusion
This page was built for publication: Cutoff phenomenon for nearest Lamperti's random walk