Level-crossings of symmetric random walks and their application

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Substantially revised, will be submitted

Scientific paper

Let $X_1$, $X_2$, $...$ be a sequence of independently and identically distributed random variables with $\mathsf{E}X_1=0$, and let $S_0=0$ and $S_t=S_{t-1}+X_t$, $t=1,2,...$, be a random walk. Denote $\tau={cases}\inf\{t>1: S_t\leq0\}, &\text{if} \ X_1>0, 1, &\text{otherwise}. {cases}$ Let $\alpha$ denote a positive number, and let $L_\alpha$ denote the number of level-crossings from the below (or above) across the level $\alpha$ during the interval $[0, \tau]$. Under quite general assumption, an inequality for the expected number of level-crossings is established. Under some special assumptions, it is proved that there exists an infinitely increasing sequence $\alpha_n$ such that the equality $\mathsf{E}L_{\alpha_n}=c\mathsf{P}\{X_1>0\}$ is satisfied, where $c$ is a specified constant that does not depend on $n$. The result is illustrated for a number of special random walks. We also give non-trivial examples from queuing theory where the results of this theory are applied.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Level-crossings of symmetric random walks and their application does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Level-crossings of symmetric random walks and their application, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Level-crossings of symmetric random walks and their application will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-261920

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.