On the Distribution of the Number of Zero Partial Sums

1969 ◽  
Vol 6 (1) ◽  
pp. 162-176 ◽  
Author(s):  
Ora Engelberg Percus ◽  
Jerome K. Percus
Keyword(s):  
Markov Chain ◽  
Random Walk ◽  
Generating Function ◽  
General Distribution ◽  
Partial Sums ◽  
Positive Direction ◽  
Negative Direction

A weighted Markov chain technique is used to determine the general distribution of the number of tie positions in a two candidate ballot. This may be interpreted as the distribution of the number of returns to the origin in an asymmetric random walk, when the particle at each step moves μ units in the positive direction and γ units in the negative direction, given the total number of positive steps and the number of negative steps. Explicit results are obtained when γ = 1, whereas the case of μ and γ ≠ 1 is solved in the form of a generating function.

On the Distribution of the Number of Zero Partial Sums

1969 ◽  
Vol 6 (01) ◽  
pp. 162-176 ◽  
Author(s):  
Ora Engelberg Percus ◽  
Jerome K. Percus
Keyword(s):  
Markov Chain ◽  
Random Walk ◽  
Generating Function ◽  
General Distribution ◽  
Partial Sums ◽  
Positive Direction ◽  
Negative Direction

A weighted Markov chain technique is used to determine the general distribution of the number of tie positions in a two candidate ballot. This may be interpreted as the distribution of the number of returns to the origin in an asymmetric random walk, when the particle at each step moves μ units in the positive direction and γ units in the negative direction, given the total number of positive steps and the number of negative steps. Explicit results are obtained when γ = 1, whereas the case of μ and γ ≠ 1 is solved in the form of a generating function.

On the absorption probabilities and mean time for absorption for discrete Markov chains

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Nikolaos Halidias
Keyword(s):  
Markov Chain ◽  
Random Walk ◽  
Markov Chains ◽  
Generating Function ◽  
Discrete Time ◽  
Probability Generating Function ◽  
The Mean ◽  
Mean Time ◽  
Absorption Probabilities

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}} .

scholarly journals A Diffusion Limit for Generalized Correlated Random Walks

2006 ◽  
Vol 43 (01) ◽  
pp. 60-73 ◽  
Author(s):  
Urs Gruber ◽  
Martin Schweizer
Keyword(s):  
Markov Chain ◽  
Random Walk ◽  
Transition Probabilities ◽  
Partial Sums ◽  
Diffusion Limit ◽  
Correlated Random Walk ◽  
Binomial Trees ◽  
Correlated Random Walks ◽  
Limiting Behaviour ◽  
Image Position

A generalized correlated random walk is a process of partial sums such that (X, Y) forms a Markov chain. For a sequence (X n ) of such processes in which each takes only two values, we prove weak convergence to a diffusion process whose generator is explicitly described in terms of the limiting behaviour of the transition probabilities for the Y n . Applications include asymptotics of option replication under transaction costs and approximation of a given diffusion by regular recombining binomial trees.

Stationary Sequences in a Random Time Scenery

2019 ◽  
pp. 319-344
Author(s):  
Florence Merlevède ◽  
Magda Peligrad ◽  
Sergey Utev
Keyword(s):  
Asymptotic Behavior ◽  
Markov Chain ◽  
Random Walk ◽  
Random Time ◽  
Partial Sums ◽  
Stationary Sequences ◽  
Invariance Principles ◽  
Weak Invariance ◽  
Functional Clt ◽  
Random Scenery

In this chapter, we analyze the asymptotic behavior of the partial sums process associated with examples of stationary sequences in a random time scenery. The examples considered are stationary sequences sampled by shifted renewal Markov chains and random walks in a strictly stationary scenery. The asymptotic behavior of the partial sums process is essentially investigated with the help of the weak invariance principles stated in Chapter 4. More precisely, for the partial sums process associated with a stationary process sampled by a renewal Markov chain stated at zero, due to the non-stationarity of the underlying sequence, the functional CLT is obtained as an application of the functional CLT for non-stationary sequences developed in Section 4.4. In the case where we are sampling a strictly stationary random scenery by a random walk, stationarity is preserved, and the invariance principle is then derived by using the functional CLT under Maxwell–Woodroofe condition.

First-passage times for the partial sums of a sequence of geometric distributions

1982 ◽  
Vol 19 (02) ◽  
pp. 430-432
Author(s):  
A. J. Woods
Keyword(s):  
Markov Chain ◽  
Random Walk ◽  
Transition Probabilities ◽  
Probability Distributions ◽  
First Passage Times ◽  
Partial Sums ◽  
Homogeneous Markov Chain ◽  
First Passage ◽  
Epidemic Process ◽  
Passage Times

It is shown here that questions about the probability distributions of the partial sums of a sequence of geometric distributions, all with different parameters, can be answered by considering the transition probabilities of a homogeneous Markov chain. The result is applied to the embedded random walk of an epidemic process.

scholarly journals A Diffusion Limit for Generalized Correlated Random Walks

2006 ◽  
Vol 43 (1) ◽  
pp. 60-73 ◽  
Author(s):  
Urs Gruber ◽  
Martin Schweizer
Keyword(s):  
Markov Chain ◽  
Random Walk ◽  
Transition Probabilities ◽  
Partial Sums ◽  
Diffusion Limit ◽  
Correlated Random Walk ◽  
Binomial Trees ◽  
Correlated Random Walks ◽  
Limiting Behaviour ◽  
Image Position

A generalized correlated random walk is a process of partial sums such that (X, Y) forms a Markov chain. For a sequence (Xn) of such processes in which each takes only two values, we prove weak convergence to a diffusion process whose generator is explicitly described in terms of the limiting behaviour of the transition probabilities for the Yn. Applications include asymptotics of option replication under transaction costs and approximation of a given diffusion by regular recombining binomial trees.

First-passage times for the partial sums of a sequence of geometric distributions

1982 ◽  
Vol 19 (2) ◽  
pp. 430-432 ◽  
Author(s):  
A. J. Woods
Keyword(s):  
Markov Chain ◽  
Random Walk ◽  
Transition Probabilities ◽  
Probability Distributions ◽  
First Passage Times ◽  
Partial Sums ◽  
Homogeneous Markov Chain ◽  
First Passage ◽  
Epidemic Process ◽  
Passage Times

It is shown here that questions about the probability distributions of the partial sums of a sequence of geometric distributions, all with different parameters, can be answered by considering the transition probabilities of a homogeneous Markov chain. The result is applied to the embedded random walk of an epidemic process.

scholarly journals Strong Local Survival of Branching Random Walks is Not Monotone

2014 ◽  
Vol 46 (02) ◽  
pp. 400-421 ◽  
Author(s):  
Daniela Bertacchi ◽  
Fabio Zucca
Keyword(s):  
Random Walk ◽  
Random Walks ◽  
Generating Function ◽  
Continuous Time ◽  
Local Property ◽  
Branching Random Walk ◽  
Infinite Dimensional ◽  
Branching Random Walks ◽  
Local Survival ◽  
Branching Law

In this paper we study the strong local survival property for discrete-time and continuous-time branching random walks. We study this property by means of an infinite-dimensional generating functionGand a maximum principle which, we prove, is satisfied by every fixed point ofG. We give results for the existence of a strong local survival regime and we prove that, unlike local and global survival, in continuous time, strong local survival is not a monotone property in the general case (though it is monotone if the branching random walk is quasitransitive). We provide an example of an irreducible branching random walk where the strong local property depends on the starting site of the process. By means of other counterexamples, we show that the existence of a pure global phase is not equivalent to nonamenability of the process, and that even an irreducible branching random walk with the same branching law at each site may exhibit nonstrong local survival. Finally, we show that the generating function of an irreducible branching random walk can have more than two fixed points; this disproves a previously known result.

On the age distribution of a Markov chain

1978 ◽  
Vol 15 (1) ◽  
pp. 65-77 ◽  
Author(s):  
Anthony G. Pakes
Keyword(s):  
Markov Chain ◽  
Random Walk ◽  
Limit Theorems ◽  
Age Distribution ◽  
Weak Limit ◽  
Absorbing State ◽  
Absorbing Markov Chain ◽  
Continuous Random Walk ◽  
A Chain ◽  
Watson Process

This paper develops the notion of the limiting age of an absorbing Markov chain, conditional on the present state. Chains with a single absorbing state {0} are considered and with such a chain can be associated a return chain, obtained by restarting the original chain at a fixed state after each absorption. The limiting age, A(j), is the weak limit of the time given Xn = j (n → ∞).A criterion for the existence of this limit is given and this is shown to be fulfilled in the case of the return chains constructed from the Galton–Watson process and the left-continuous random walk. Limit theorems for A (J) (J → ∞) are given for these examples.

scholarly journals Strong Local Survival of Branching Random Walks is Not Monotone

2014 ◽  
Vol 46 (2) ◽  
pp. 400-421 ◽  
Author(s):  
Daniela Bertacchi ◽  
Fabio Zucca
Keyword(s):  
Random Walk ◽  
Random Walks ◽  
Generating Function ◽  
Continuous Time ◽  
Local Property ◽  
Branching Random Walk ◽  
Infinite Dimensional ◽  
Branching Random Walks ◽  
Local Survival ◽  
Branching Law

In this paper we study the strong local survival property for discrete-time and continuous-time branching random walks. We study this property by means of an infinite-dimensional generating function G and a maximum principle which, we prove, is satisfied by every fixed point of G. We give results for the existence of a strong local survival regime and we prove that, unlike local and global survival, in continuous time, strong local survival is not a monotone property in the general case (though it is monotone if the branching random walk is quasitransitive). We provide an example of an irreducible branching random walk where the strong local property depends on the starting site of the process. By means of other counterexamples, we show that the existence of a pure global phase is not equivalent to nonamenability of the process, and that even an irreducible branching random walk with the same branching law at each site may exhibit nonstrong local survival. Finally, we show that the generating function of an irreducible branching random walk can have more than two fixed points; this disproves a previously known result.

Sign in / Sign up

Export Citation Format

Share Document