Related papers: A continuum-tree-valued Markov process
We give a complete and unified description -- under some stability assumptions -- of the functional scaling limits associated with some persistent random walks for which the recurrent or transient type is studied in [1]. As a result, we…
Markov branching systems form a fundamental class of stochastic models that are extensively applied in biology, physics, finance, and other domains. These systems are distinguished by their continuous-time evolution and inherent branching…
This paper studies a Markov chain for phylogenetic reconstruction which uses a popular transition between tree topologies known as subtree pruning-and-regrafting (SPR). We analyze the Markov chain in the simpler setting that the generating…
A branching L\'evy process can be seen as the continuous-time version of a branching random walk. It describes a particle system on the real line in which particles move and reproduce independently in a Poissonian manner. Just as for L\'evy…
We study the pathwise description of a (sub-)critical continuous-state branching process (CSBP) conditioned to be never extinct, as the solution to a stochastic differential equation driven by Brownian motion and Poisson point measures. The…
We derive some additional results on the Bienyam\'e-Galton-Watson branching process with $\theta -$linear fractional branching mechanism, as studied in \cite{Sag}. This includes: the explicit expression of the limit laws in both the…
Using the Lyapunov criteria arguments, we find sufficient conditions on explosion/nonexplosion for continuous-state branching processes with competition in L\'evy random environment. In particular, we identify the necessary and sufficient…
This paper is a variation on the uniform spanning tree theme. We use random spanning forests to solve the following problem: for a Markov process on a finite set of size $n$, find a probability law on the subsets of any given size $m \leq…
The continuous random energy model (CREM) is a toy model of spin glasses on $\{0,1\}^N$ that, in the limit, exhibits an infinitely hierarchical correlation structure. We give two polynomial-time algorithms to approximately sample from the…
In this paper we study the conditional limit theorems for critical continuous-state branching processes with branching mechanism $\psi(\lambda)=\lambda^{1+\alpha}L(1/\lambda)$ where $\alpha\in [0,1]$ and $L$ is slowly varying at $\infty$.…
We provide simplified proofs for the asymptotic distribution of the number of cuts required to cut down a Galton-Watson tree with critical, finite-variance offspring distribution, conditioned to have total progeny $n$. Our proof is based on…
In this note, we study the asymptotic behaviour near extinction of (sub-) critical continuous state branching processes. In particular, we establish an analogue of Khintchin's law of the iterated logarithm near extinction time for a…
We investigate the branching structure coded by the excursion above zero of a spectrally positive Levy process. The main idea is to identify the level of the Levy excursion as the time and count the number of jumps upcrossing the level. By…
(Multi-type) branching processes are a natural and well-studied model for generating random infinite trees. Branching processes feature both nondeterministic and probabilistic branching, generalizing both transition systems and Markov…
We study the speed of extinction of continuous state branching processes in a L\'evy environment, where the associated L\'evy process oscillates. Assuming that the L\'evy process satisfies the Spitzer's condition and the existence of some…
We investigate recurrence and transience of Branching Markov Chains (BMC) in discrete time. Branching Markov Chains are clouds of particles which move (according to an irreducible underlying Markov Chain) and produce offspring…
Given a general critical or sub-critical branching mechanism and its associated L\'evy continuum random tree, we consider a pruning procedure on this tree using a Poisson snake. It defines a fragmentation process on the tree. We compute the…
We consider a recurrent Markov process which is an It\^o semi-martingale. The L\'evy kernel describes the law of its jumps. Based on observations X(0),X({\Delta}),...,X(n{\Delta}), we construct an estimator for the L\'evy kernel's density.…
We consider a branching stable process with positive jumps, i.e. a continuous-time branching process in which the particles evolve independently as stable L{\'e}vy processes with positive jumps. Assuming the branching mechanism is critical…
We consider a natural destruction process of an infinite recursive tree by removing each edge after an independent exponential time. The destruction up to time t is encoded by a partition $\Pi$(t) of N into blocks of connected vertices.…