On the First Exit Time from a Semigroup in $R^m$ for a Random Walk

1978 ◽  
Vol 22 (4) ◽  
pp. 818-825 ◽  
Author(s):  
A. A. Mogul’skii ◽  
E. A. Pecerskii
Keyword(s):  
Random Walk ◽  
Exit Time ◽  
First Exit Time

scholarly journals On the Exit Time of a Random Walk with Positive Drift

2007 ◽  
Vol DMTCS Proceedings vol. AH,... (Proceedings) ◽  
Author(s):  
Michael Drmota ◽  
Wojciech Szpankowski
Keyword(s):  
Random Walk ◽  
Asymptotic Distribution ◽  
Infinite Number ◽  
Exit Time ◽  
Saddle Points ◽  
Tauberian Theorems ◽  
Precise Asymptotics ◽  
First Exit Time ◽  
Mellin Transforms ◽  
International Audience

International audience We study a random walk with positive drift in the first quadrant of the plane. For a given connected region $\mathcal{C}$ of the first quadrant, we analyze the number of paths contained in $\mathcal{C}$ and the first exit time from $\mathcal{C}$. In our case, region $\mathcal{C}$ is bounded by two crossing lines. It is noted that such a walk is equivalent to a path in a tree from the root to a leaf not exceeding a given height. If this tree is the parsing tree of the Tunstall or Khodak variable-to-fixed code, then the exit time of the underlying random walk corresponds to the phrase length not exceeding a given length. We derive precise asymptotics of the number of paths and the asymptotic distribution of the exit time. Even for such a simple walk, the analysis turns out to be quite sophisticated and it involves Mellin transforms, Tauberian theorems, and infinite number of saddle points.

n-point, win-by-k games

1989 ◽  
Vol 26 (4) ◽  
pp. 807-814 ◽  
Author(s):  
Kyle Siegrist
Keyword(s):  
Exit Time ◽  
Bernoulli Trials ◽  
Expected Number ◽  
First Exit Time ◽  
World Series ◽  
Time Space ◽  
Gambler’S Ruin ◽  
Gambler's Ruin Problem ◽  
Positive Integers ◽  
Made In

Consider a sequence of Bernoulli trials between players A and B in which player A wins each trial with probability p∈ [0, 1]. For positive integers n and k with k ≦ n, an (n, k) contest is one in which the first player to win at least n trials and to be ahead of his opponent by at least k trials wins the contest. The (n, 1) contest is the Banach match problem and the (n, n) contest is the gambler's ruin problem. Many real contests (such as the World Series in baseball and the tennis game) have an (n, 1) or an (n, 2) format. The (n, k) contest is formulated in terms of the first-exit time of the graph of a random walk from a certain region of the state-time space. Explicit results are obtained for the probability that player A wins an (n, k) contest and the expected number of trials in an (n, k) contest. Comparisons of (n, k) contests are made in terms of the probability that the stronger player wins and the expected number of trials.

scholarly journals A variation on the Donsker–Varadhan inequality for the principal eigenvalue

2017 ◽  
Vol 473 (2204) ◽  
pp. 20160877
Author(s):  
Jianfeng Lu ◽  
Stefan Steinerberger
Keyword(s):  
Lower Bound ◽  
Exit Time ◽  
Principal Eigenvalue ◽  
Short Paper ◽  
First Eigenvalue ◽  
Drift Diffusion ◽  
First Exit Time ◽  
The First Eigenvalue ◽  
Order Elliptic Operator ◽  
The Mean

The purpose of this short paper is to give a variation on the classical Donsker–Varadhan inequality, which bounds the first eigenvalue of a second-order elliptic operator on a bounded domain Ω by the largest mean first exit time of the associated drift–diffusion process via λ 1 ≥ 1 sup x ∈ Ω E x τ Ω c . Instead of looking at the mean of the first exit time, we study quantiles: let d p , ∂ Ω : Ω → R ≥ 0 be the smallest time t such that the likelihood of exiting within that time is p , then λ 1 ≥ log ( 1 / p ) sup x ∈ Ω d p , ∂ Ω ( x ) . Moreover, as p → 0 , this lower bound converges to λ 1 .

Approximate exit probabilities for a Brownian bridge on a short time interval, and applications

1989 ◽  
Vol 21 (1) ◽  
pp. 1-19 ◽  
Author(s):  
H. R. Lerche ◽  
D. Siegmund
Keyword(s):  
Virial Coefficient ◽  
Large Deviation ◽  
Brownian Bridge ◽  
Exit Time ◽  
Second Virial Coefficient ◽  
Dimensional Euclidean Space ◽  
Time Interval ◽  
Short Time Interval ◽  
First Exit Time ◽  
Short Time

Let T be the first exit time of Brownian motion W(t) from a region ℛ in d-dimensional Euclidean space having a smooth boundary. Given points ξ0 and ξ1 in ℛ, ordinary and large-deviation approximations are given for Pr{T < ε |W(0) = ξ0, W(ε) = ξ 1} as ε → 0. Applications are given to hearing the shape of a drum and approximating the second virial coefficient.

Sign in / Sign up

Export Citation Format

Share Document