Related papers: Bridges of Markov counting processes. Reciprocal c…
We suggest an approach to obtaining general two-sided bounds on the rate of convergence in terms of special "weighted" norms related to total variation. Some important classes of continuous-time Markov chains are considered:…
This paper consists of $3$ parts. The first part only considers classical processes and introduces two different extensions of the notion of hidden Markov process. In the second part, the notion of quantum hidden process is introduced. In…
In this note, we realize the half-steps of a general class of Markov chains as alternating projections with respect to the reverse Kullback-Leibler divergence between convex sets of joint probability distributions. Using this…
The interplay between bifurcations and random switching processes of vector fields is studied. More precisely, we provide a classification of piecewise deterministic Markov processes arising from stochastic switching dynamics near fold,…
We consider the task of generating draws from a Markov jump process (MJP) between two time-points at which the process is known. Resulting draws are typically termed bridges and the generation of such bridges plays a key role in…
The paper deals with a certain class of random evolutions. We develop a construction that yields an invariant measure for a continuous-time Markov process with random transitions. The approach is based on a particular way of constructing…
We assess the descriptive complexity of *bisimilarity* or "equality of behavior" on a family of Markov decision processes over uncountable standard Borel spaces, namely *nondeterministic labelled Markov processes* (NLMP). We show that…
The question of recurrence and transience of branching Markov chains is more subtle than for ordinary Markov chains; they can be classified in transience, weak recurrence, and strong recurrence. We review criteria for transience and weak…
We start from the observation that, anytime two Markov generators share an eigenvalue, the function constructed from the product of the two eigenfunctions associated to this common eigenvalue is a duality function. We push further this…
Markov processes are popular mathematical models, studied by theoreticians for their intriguing properties, and applied by practitioners for their flexible structure. With this book we teach how to model and analyze Markov processes. We…
In the former article "Formal mathematical systems including a structural induction principle" we have presented a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the…
We examine the number of cycles of length k in a permutation, as a function on the symmetric group. We write it explicitly as a combination of characters of irreducible representations. This allows to study formation of long cycles in the…
We study discretizations of polynomial processes using finite state Markov processes satisfying suitable moment matching conditions. The states of these Markov processes together with their transition probabilities can be interpreted as…
This paper focuses on the problem of the degree sequence for a mixed random graph process which continuously combines the {\it classical} model and the BA model. Note that the number of step added edges for the mixed model is random and…
In the context of Markov processes, we show a new scheme to derive dual processes and a duality function based on a boson representation. This scheme is applicable to a case in which a generator is expressed by boson creation and…
Markov chains are used to give a purely probabilistic way of understanding the conjugacy classes of the finite symplectic and orthogonal groups in odd characteristic. As a corollary of these methods one obtains a probabilistic proof of…
Given a specific collection of curves on an oriented surface with punctures, we associate a power series by counting its intersections with multicurves. This paper presents a reciprocity formula on the power series when multicurves with no…
We prove that the probability substitution matrices obtained from a continuous-time Markov chain form a multiplicatively closed set if and only if the rate matrices associated to the chain form a linear space spanning a Lie algebra. The key…
The number of ``carries'' when $n$ random integers are added forms a Markov chain [23]. We show that this Markov chain has the same transition matrix as the descent process when a deck of $n$ cards is repeatedly riffle shuffled. This gives…
In this paper we study Green measures for certain classes of random time change Markov processes where the random time change are inverse subordinators. We show the existence of the Green measure for these processes under the condition of…