AbstractIn [1] and more recently in [2], Chapters III and VII, Spitzer constructs potentials for a particular class of recurrent Markov chains (M.C.'s), namely, the class of recurrent random walks on the n-dimensional lattice of integers (n = 1 or 2). In [3], [4], and [5], Kemeny and Snell construct a potential theory for arbitrary recurrent M.C.'s. Orey [6] has characterized potential kernels for recurrent M.C.'s. The potentials and kernels studied in these papers have properties which are analogous to those defined for transient M.C.'s. This paper extends the results of Kemeny and Snell to Markov renewal processes (MRP's).Section 1 contains a brief discussion of MRP's in general, a definition of the class of MRP's to be studied in this pa...
We present three classical methods in the study of dynamic and stationary characteristic of processe...
AbstractLet {Xn} be a ∅-irreducible Markov chain on an arbitrary space. Sufficient conditions are gi...
A classical random walk (St, t ∈ N) is defined by St:= t∑ n=0 Xn, where (Xn) are i.i.d. When the inc...
AbstractIn [1] and more recently in [2], Chapters III and VII, Spitzer constructs potentials for a p...
AbstractLet (S, £) be a measurable space with countably generated σ-field £ and (Mn, Xn)n⩾0 a Markov...
AbstractLet I be a denumerable set and let Q = (Qij)i,j∈l be an irreducible semi-Markov kernel. The ...
The recurrence features of persistent random walks built from variable length Markov chains are inve...
International audienceThe recurrence and transience of persistent random walks built from variable l...
Let I be a denumerable set and let Q = (Qij)i,j[set membership, variant]l be an irreducible semi-Mar...
Motivated by multivariate random recurrence equations we prove a new analogue of the Key Renewal The...
Let {Xn; n ≥ 0} be a Harris-recurrent Markov chain on a general state space. It is shown that ...
Motivated by multivariate random recurrence equations we prove a new analogue of the Key Renewal The...
Random recurrence relations are stochastic difference equations, which define recursively a sequence...
We introduce a potential theory for a class of Quantum Markov Chains whose forward and backward Mar...
this paper is organized as follows. Martin capacity for Markov chains is the focus of Section 2. Sev...
We present three classical methods in the study of dynamic and stationary characteristic of processe...
AbstractLet {Xn} be a ∅-irreducible Markov chain on an arbitrary space. Sufficient conditions are gi...
A classical random walk (St, t ∈ N) is defined by St:= t∑ n=0 Xn, where (Xn) are i.i.d. When the inc...
AbstractIn [1] and more recently in [2], Chapters III and VII, Spitzer constructs potentials for a p...
AbstractLet (S, £) be a measurable space with countably generated σ-field £ and (Mn, Xn)n⩾0 a Markov...
AbstractLet I be a denumerable set and let Q = (Qij)i,j∈l be an irreducible semi-Markov kernel. The ...
The recurrence features of persistent random walks built from variable length Markov chains are inve...
International audienceThe recurrence and transience of persistent random walks built from variable l...
Let I be a denumerable set and let Q = (Qij)i,j[set membership, variant]l be an irreducible semi-Mar...
Motivated by multivariate random recurrence equations we prove a new analogue of the Key Renewal The...
Let {Xn; n ≥ 0} be a Harris-recurrent Markov chain on a general state space. It is shown that ...
Motivated by multivariate random recurrence equations we prove a new analogue of the Key Renewal The...
Random recurrence relations are stochastic difference equations, which define recursively a sequence...
We introduce a potential theory for a class of Quantum Markov Chains whose forward and backward Mar...
this paper is organized as follows. Martin capacity for Markov chains is the focus of Section 2. Sev...
We present three classical methods in the study of dynamic and stationary characteristic of processe...
AbstractLet {Xn} be a ∅-irreducible Markov chain on an arbitrary space. Sufficient conditions are gi...
A classical random walk (St, t ∈ N) is defined by St:= t∑ n=0 Xn, where (Xn) are i.i.d. When the inc...