Related papers: A partition method for bounding continuous-time Ma…
In the paper we consider some piecewise deterministic Markov process whose continuous component evolves according to semiflows, which are switched at the jump times of a Poisson process. The associated Markov chain describes the states of…
We discuss Stein's method for approximation by the stationary distribution of a single-birth Markov chain, in conjunction with stochastic monotonicity and similar assumptions. We use bounds on the increments of the solution of Poisson's…
We construct and study branching Markov processes on the space of finite configurations of the state space of a given standard process, controlled by a branching kernel and a killing one. In particular, we may start with a superprocess,…
We define a Markov process on the partitions of $[n]=\{1,\ldots,n\}$ by drawing a sample in $[n]$ at each time of a Poisson process, by merging blocks that contain one of these points and by leaving all other blocks unchanged. This…
A branching process in a Markovian environment consists of an irreducible Markov chain on a set of "environments" together with an offspring distribution for each environment. At each time step the chain transitions to a new random…
We address the problem of community detection in networks by introducing a general definition of Markov stability, based on the difference between the probability fluxes of a Markov chain on the network at different time scales. The…
In this paper, the recurrent events that can occur more than one over the follow-up time have been modeled by phase-type distributions. We use the finite-state continuous-time Markov process with multi states for patients with recurrent…
An approach to analyse the properties of a particle system is to compare it with different processes to understand when one of them is larger than other ones. The main technique for that is coupling, which may not be easy to construct. We…
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…
A continuous-state branching process in varying environments is constructed by the pathwise unique solution to a stochastic integral equation driven by time-space noises. The process arises naturally in the limit theorem of Galton--Watson…
Consider the continuous-time Markov Branching Process. In critical case we consider a situation when the generating function of intensity of transformation of particles has the infinite second moment, but its tail regularly varies in sense…
In this work, we study a protein synthesis degradation process by defining a general mathematical model. Using generating function technique we present a method that allows exact calculation of joint probability distribution of protein…
A two-type continuous-state branching process in varying environments is constructed as the pathwise unique solution of a system of stochastic equations driven by time-space noises, where the pathwise uniqueness is derived from a comparison…
We consider a new class of non Markovian processes with a countable number of interacting components. At each time unit, each component can take two values, indicating if it has a spike or not at this precise moment. The system evolves as…
We define the concept of an `open' Markov process, a continuous-time Markov chain equipped with specified boundary states through which probability can flow in and out of the system. External couplings which fix the probabilities of…
This paper studies a novel approach for approximating the behavior of compartmental spreading processes. In contrast to prior work, the methods developed describe a dynamics which bound the exact moment dynamics, without explicitly…
Markov chains have long been used for generating random variates from spatial point processes. Broadly speaking, these chains fall into two categories: Metropolis-Hastings type chains running in discrete time and spatial birth-death chains…
We consider how to generate chemical reaction networks (CRNs) from functional specifications. We propose a two-stage approach that combines synthesis by satisfiability modulo theories and Markov chain Monte Carlo based optimisation. First,…
We study a family of Markov processes on $\mathcal{P}^{(k)}$, the space of partitions of the natural numbers with at most $k$ blocks. The process can be constructed from a Poisson point process on…
In queuing theory and related problems, it is very important to know the numerical characteristics of an investigated system - both in stationary and non-stationary modes. In some cases, such characteristics can be calculated, but this is…