A Note on Absorption Probabilities for a Random Walk Between a Reflecting and an Absorbing Barrier

1969 ◽  
Vol 6 (01) ◽  
pp. 224-226
Author(s):  
J.C. Hardin ◽  
A.L. Sweet

Generating functions for the absorption probabilities for a random walk on the integers {0,1, …, b}, where 0 is an absorbing barrier and b a semi-reflecting barrier have been obtained by Weesakul [1] and Neuts [2]. However, determination of explicit expressions for the absorption probabilities from the generating functions is generally quite difficult. In this note, two cases where this is possible are presented.

1969 ◽  
Vol 6 (1) ◽  
pp. 224-226 ◽  
Author(s):  
J.C. Hardin ◽  
A.L. Sweet

Generating functions for the absorption probabilities for a random walk on the integers {0,1, …, b}, where 0 is an absorbing barrier and b a semi-reflecting barrier have been obtained by Weesakul [1] and Neuts [2]. However, determination of explicit expressions for the absorption probabilities from the generating functions is generally quite difficult. In this note, two cases where this is possible are presented.


1981 ◽  
Vol 18 (04) ◽  
pp. 931-936
Author(s):  
James M. Hill ◽  
Chandra M. Gulati

The random walk arising in the game of roulette involves an absorbing barrier at the origin; at each step either a unit displacement to the left or a fixed multiple displacement to the right can occur with probabilities q and p respectively. Using generating functions and Lagrange's theorem for the expansion of a function as a power series explicit expressions are deduced for the probabilities of the player's capital at the nth step.


1981 ◽  
Vol 18 (4) ◽  
pp. 931-936 ◽  
Author(s):  
James M. Hill ◽  
Chandra M. Gulati

The random walk arising in the game of roulette involves an absorbing barrier at the origin; at each step either a unit displacement to the left or a fixed multiple displacement to the right can occur with probabilities q and p respectively. Using generating functions and Lagrange's theorem for the expansion of a function as a power series explicit expressions are deduced for the probabilities of the player's capital at the nth step.


1964 ◽  
Vol 4 (4) ◽  
pp. 518-528 ◽  
Author(s):  
V. D. Barnett

SummaryA great deal of attention has been given in the literature to the various properties of the simple binomial random walk. Explicit expressions are available for first passage times, absorption probabilities, average duration of the walk up to absorption and other quantities of interest. One aspect of the behaviour of this work which has, however, attracted little attention is the form of the distribution of occupation totals. This paper is devoted to the derivation of an explict expression for the joint probility generating function of the occupation totals up to absorption, for the binomial random walk in the presence of two absorbing points. The appropriate marginal form of this p.g.f. yields the distribution of the occupation total, and expected occupation total, at any particular lattice point. The limiting forms of these results provide explicit expressions for the corresponding quatities in the case of a binomial random walk having a single absorbing point and, where relevent, in the case of the unrestricted binomial random walk.


2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Nikolaos Halidias

Abstract In this note we study the probability and the mean time for absorption for discrete time Markov chains. In particular, we are interested in estimating the mean time for absorption when absorption is not certain and connect it with some other known results. Computing a suitable probability generating function, we are able to estimate the mean time for absorption when absorption is not certain giving some applications concerning the random walk. Furthermore, we investigate the probability for a Markov chain to reach a set A before reach B generalizing this result for a sequence of sets A 1 , A 2 , … , A k {A_{1},A_{2},\dots,A_{k}} .


Author(s):  
A. B. Bhatia ◽  
E. Wolf

ABSTRACTThe paper is concerned with the construction of polynomials in two variables, which form a complete orthogonal set for the interior of the unit circle and which are ‘invariant in form’ with respect to rotations of axes about the origin of coordinates. It is found that though there exist an infinity of such sets there is only one set which in addition has certain simple properties strictly analogous to that of Legendre polynomials. This set is found to be identical with the set of the circle polynomials of Zernike which play an important part in the theory of phase contrast and in the Nijboer-Zernike diffraction theory of optical aberrations.The results make it possible to derive explicit expressions for the Zernike polynomials in a simple, systematic manner. The method employed may also be used to derive other orthogonal sets. One new set is investigated, and the generating functions for this set and for the Zernike polynomials are also given.


1980 ◽  
Vol 17 (01) ◽  
pp. 253-258 ◽  
Author(s):  
R. B. Nain ◽  
Kanwar Sen

For correlated random walks a method of transition probability matrices as an alternative to the much-used methods of probability generating functions and difference equations has been investigated in this paper. To illustrate the use of transition probability matrices for computing the various probabilities for correlated random walks, the transition probability matrices for restricted/unrestricted one-dimensional correlated random walk have been defined and used to obtain some of the probabilities.


1988 ◽  
Vol 31 (3) ◽  
pp. 257-271 ◽  
Author(s):  
E. A. Bender ◽  
E. R. Canfield ◽  
R. W. Robinson

AbstractThe enumeration of rooted maps (embedded graphs), by number of edges, on the torus and projective plane, is studied. Explicit expressions for the generating functions are obtained. From these are derived asymptotic expressions and recurrence relations. Numerical tables for the numbers with up to 20 edges are presented.


1974 ◽  
Vol 11 (01) ◽  
pp. 199-205
Author(s):  
Noel Cressie

A general two-dimensional random walk is considered with a barrier along the y-axis. Absorption probabilities are derived when the barrier is absorbing, and when it is semi-reflecting.


Sign in / Sign up

Export Citation Format

Share Document