Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. On the number of zer ...
Conference paper

On the number of zero increments of random walks with a barrier

Alex Iksanov (1), Pavlo Negadajlov (1)
(1) Faculty of Cybernetics [Kyiv]
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2007
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science
Proceedings
DOI
10.46298/dmtcs.3568
License
https://about.hal.science/hal-authorisation-v1
Indicators
576
Views
525
Downloads

On the number of zero increments of random walks with a barrier

Alex Iksanov (1), Pavlo Negadajlov (1)
(1) Faculty of Cybernetics [Kyiv]
Abstract
Continuing the line of research initiated in Iksanov and Möhle (2008) and Negadajlov (2008) we investigate the asymptotic (as $n \to \infty$) behaviour of $V_n$ the number of zero increments before the absorption in a random walk with the barrier $n$. In particular, when the step of the unrestricted random walk has a finite mean, we prove that the number of zero increments converges in distribution. We also establish a weak law of large numbers for $V_n$ under a regular variation assumption.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • absorption time
  • recursion with random indices
  • random walk
  • undershoot
Cited by

Source: OpenCitations

  • Weak convergence of the number of zero increments in the random walk with barrier

    Electronic Communications in Probability

    Authors : Alexander Marynych ORCID, Glib Verovkin

    Journal reference : Volume 19, 2014, pp.

    DOI : 10.1214/ecp.v19-3641
Preview
Loading PDF preview...