Abstract
We consider a random walk with zero drift and finite positive variance σ2. For positive numbers y, z we find the limit as
Note: Originally published in Diskretnaya Matematika (2019) 31,
References
[1] Spitzer F., Principles of Random Walk, Springer-Verlag New York, 1964, XIII, 408 pp.10.1007/978-1-4757-4229-9Suche in Google Scholar
[2] Afanasyev V. I., “On the times of attaining high levels by a random walk in a random environment”, Theory Probab. Appl., 65:3, 359–374.10.1137/S0040585X97T990009Suche in Google Scholar
[3] Billingsley P., Convergence of Probability Measures, New York: John Wiley & Sons, 1968.Suche in Google Scholar
[4] Afanasyev V. I., “Convergence to the local time of Brownian meander”, Discrete Math. Appl., 29:3 (2019), 149–158.10.1515/dma-2019-0014Suche in Google Scholar
[5] Shimura M., “A class of conditional limit theorems related to ruin problem”, Ann. Probab., 11:1 (1983), 40–45.10.1214/aop/1176993658Suche in Google Scholar
[6] Doney R.A., “A note on conditioned random walk”, J. Appl. Probab., 20:2 (1983), 409–412.10.2307/3213815Suche in Google Scholar
[7] Feller W., An Introduction to Probability Theory and Its Applications. V. 2, 2nd ed., John Wiley & Sons, 1971, 669 pp.Suche in Google Scholar
© 2021 Walter de Gruyter GmbH, Berlin/Boston
Artikel in diesem Heft
- Frontmatter
- Two-sided problem for the random walk with bounded maximal increment
- On the use of binary operations for the construction of a multiply transitive class of block transformations
- On the complexity of implementation of a system of two monomials by composition circuits
- On the degree of restrictions of q-valued logic vector functions to linear manifolds
- Trees with a given number of leaves and the maximal number of maximum independent sets
- Size distribution of the largest component of a random A-mapping
Artikel in diesem Heft
- Frontmatter
- Two-sided problem for the random walk with bounded maximal increment
- On the use of binary operations for the construction of a multiply transitive class of block transformations
- On the complexity of implementation of a system of two monomials by composition circuits
- On the degree of restrictions of q-valued logic vector functions to linear manifolds
- Trees with a given number of leaves and the maximal number of maximum independent sets
- Size distribution of the largest component of a random A-mapping