Related papers: Spine decomposition for branching Markov processes…
Markov matrices have an important role in the filed of stochastic processes. In this paper, we will show and prove a series of conclusions on Markov matrices and transformations rather than pay attention to stochastic processes although…
We consider a branching-selection particle system on the real line. In this model the total size of the population at time $n$ is limited by $\exp\left(a n^{1/3}\right)$. At each step $n$, every individual dies while reproducing…
We introduce an algorithm for generating a random sequence of fragmentation trees, which we call the ancestral branching algorithm. This algorithm builds on the recursive partitioning structure of a tree and gives rise to an associated…
Potential theory is a central tool to understand and analyse Markov processes. In this article, we develop its probabilistic counterpart for branching Markov chains. Specifically, we examine versions of quasi-processes or interlacements…
We study age-structured branching models with reproduction law depending on the remaining lifetime of the parent. The lifespan of an individual is decided at its birth and its remaining lifetime decreases at the unit speed. The models…
In typical single-molecule force spectroscopy experiments the mechanical unfolding of molecular complexes or biomolecules is studied applying a force ramp to one end of the system while the other end is kept fixed in space. The…
We investigate branching processes in nearly degenerate varying environment, where the offspring distribution converges to the degenerate distribution at 1. Such processes die out almost surely, therefore, we condition on non-extinction or…
Multitype branching processes (MTBP) model branching structures, where the nodes of the resulting tree are objects of different types. One field of application of such models in biology is in studies of cell proliferation. A sampling scheme…
Consider a continuous-time binary branching process conditioned to have population size n at some time t, and with a chance p for recording each extinct individual in the process. Within the family tree of this process, we consider the…
We describe innovation in terms of a generalized branching process. Each new invention pairs with any existing one to produce a number of offspring, which is Poisson distributed with mean p. Existing inventions die with probability p/\tau…
We study pivotal decomposition schemes and investigate classes of pivotally decomposable operations. We provide sufficient conditions on pivotal operations that guarantee that the corresponding classes of pivotally decomposable operations…
We study the large time fluctuations of entropy production in Markov processes. In particular, we consider the effect of a coarse-graining procedure which decimates {\em fast states} with respect to a given time threshold. Our results…
We consider the property of unique parallel decomposition modulo branching and weak bisimilarity. First, we show that infinite behaviours may fail to have parallel decompositions at all. Then, we prove that totally normed behaviours always…
We consider a Galton-Watson process $\mathbf{Z}% (n)=(Z_{1}(n),Z_{2}(n))$ with two types of particles. Particles of type 2 may produce offspring of both types while particles of type 1 may produce particles of their own type only. Let…
We review some recent results of quantitative long-time convergence for the law of a killed Markov process conditioned to survival toward a quasi-stationary distribution, and on the analogous question for the particle systems used in…
We consider the diffusion approximation of branching processes in random environment (BPREs). This diffusion approximation is similar to and mathematically more tractable than BPREs. We obtain the exact asymptotic behavior of the survival…
In this note, we present few examples of Piecewise Deterministic Markov Processes and their long time behavior. They share two important features: they are related to concrete models (in biology, networks, chemistry,. . .) and they are…
A monolithic process is a single recursive equation with data parameters, which only uses non-determinism, action prefixing, and recursion. We present a technique that decomposes such a monolithic process into multiple processes where each…
We introduce a general class of branching Markov processes for the modelling of a parasite infection in a cell population. Each cell contains a quantity of parasites which evolves as a diffusion with positive jumps. The drift, diffusive…
In this paper we consider two related stochastic models. The first one is a branching system consisting of particles moving according to a Markov family in R^d and undergoing subcritical branching with a constant rate of V>0. New particles…