AbstractStarting from a real-valued Markov chain X0,X1,…,Xn with stationary transition probabilities, a random element {Y(t);t∈[0, 1]} of the function space D[0, 1] is constructed by letting Y(kn)=Xk, k= 0,1,…,n, and assuming Y (t) constant in between. Sample tightness criteria for sequences {Y(t);t∈[0,1]};n of such random elements in D[0, 1] are then given in terms of the one-step transition probabilities of the underlying Markov chains. Applications are made to Galton-Watson branching processes
The dissertation which follows is concerned with various aspects of behaviour within a set of state...
The aim of this minicourse is to provide a number of tools that allow one to de-termine at which spe...
AbstractWe prove a convergence theorem for systems of critical branching Markov chains on a countabl...
AbstractStarting from a real-valued Markov chain X0,X1,…,Xn with stationary transition probabilities...
AbstractWe prove necessary and sufficient conditions for the transience of the non-zero states in a ...
AbstractThis paper develops an a.s. convergence theory for a class of projected stochastic approxima...
AbstractNecessary and sufficient conditions are given for the convergence of the first moment of fun...
AbstractIt is shown that any real-valued sequence of random variables {Xn} converging in probability...
AbstractIn this report we relate the property of stochastic boundedness to the existence of stationa...
When the initial and transition probabilities of a finite Markov chain in discrete time are not we...
AbstractWe study the properties of finite ergodic Markov Chains whose transition probability matrix ...
AbstractThe semi-Markov process studied here is a generalized random walk on the non-negative intege...
AbstractEarlier results on weak convergence to diffusion processes [8] are generalized to cases wher...
An imprecise Markov chain is defined by a closed convex set of transition matrices instead of a uniq...
AbstractA variety of continuous parameter Markov chains arising in applied probability (e.g. epidemi...
The dissertation which follows is concerned with various aspects of behaviour within a set of state...
The aim of this minicourse is to provide a number of tools that allow one to de-termine at which spe...
AbstractWe prove a convergence theorem for systems of critical branching Markov chains on a countabl...
AbstractStarting from a real-valued Markov chain X0,X1,…,Xn with stationary transition probabilities...
AbstractWe prove necessary and sufficient conditions for the transience of the non-zero states in a ...
AbstractThis paper develops an a.s. convergence theory for a class of projected stochastic approxima...
AbstractNecessary and sufficient conditions are given for the convergence of the first moment of fun...
AbstractIt is shown that any real-valued sequence of random variables {Xn} converging in probability...
AbstractIn this report we relate the property of stochastic boundedness to the existence of stationa...
When the initial and transition probabilities of a finite Markov chain in discrete time are not we...
AbstractWe study the properties of finite ergodic Markov Chains whose transition probability matrix ...
AbstractThe semi-Markov process studied here is a generalized random walk on the non-negative intege...
AbstractEarlier results on weak convergence to diffusion processes [8] are generalized to cases wher...
An imprecise Markov chain is defined by a closed convex set of transition matrices instead of a uniq...
AbstractA variety of continuous parameter Markov chains arising in applied probability (e.g. epidemi...
The dissertation which follows is concerned with various aspects of behaviour within a set of state...
The aim of this minicourse is to provide a number of tools that allow one to de-termine at which spe...
AbstractWe prove a convergence theorem for systems of critical branching Markov chains on a countabl...