Related papers: A continuum-tree-valued Markov process
A general model of catalytic branching process (CBP) with any finite number of catalysis centers in a discrete space is studied. More exactly, it is assumed that particles move in this space according to a specified Markov chain and they…
Accurately assessing a patient's risk of a given event is essential in making informed treatment decisions. One approach is to stratify patients into two or more distinct risk groups with respect to a specific outcome using both clinical…
We study survival properties of inhomogeneous Galton-Watson processes. We determine the so-called branching number (which is the reciprocal of the critical value for percolation) for these random trees (conditioned on being infinite), which…
We introduce a new, relatively simple, line-breaking construction of the $\alpha$-stable tree which realises its random finite-dimensional distributions. This is a direct analogue of Aldous' line-breaking construction of the Brownian…
Fleming-Viot type particle systems represent a classical way to approximate the distribution of a Markov process with killing, given that it is still alive at a final deterministic time. In this context, each particle evolves independently…
We study the explosion phenomenon of nonlinear continuous-state branching processes (nonlinear CSBPs). First an explicit integral test for explosion is designed when the rate function does not increase too fast. We then exhibit three…
We consider point particle that collides with a periodic array of hard-core elastic scatterers where the length of the free flights is unbounded (the infinite-horizon Lorentz gas, LG). The Bleher central limit theorem (CLT) states that the…
We consider critical percolation on Galton-Watson trees and prove quenched analogues of classical theorems of critical branching processes. We show that the probability critical percolation reaches depth $n$ is asymptotic to a…
We consider a branching random walk initiated by a single particle at location 0 in which particles alternately reproduce according to the law of a Galton-Watson process and disperse according to the law of a driftless random walk on the…
This paper considers magnitude, asymptotics and duration of drawdowns for some L\'{e}vy processes. First, we revisit some existing results on the magnitude of drawdowns for spectrally negative L\'{e}vy processes using an approximation…
In this paper the theory of Carry Value Transformation (CVT) is designed and developed on a pair of n-bit strings and is used to produce many interesting patterns. One of them is found to be a self-similar fractal whose dimension is same as…
We consider an indecomposable Galton-Watson branching process with countably infinitely many types. Assuming that the process is critical and allowing for infinite variance of the offspring sizes of some (or all) types of particles we…
In this paper we consider a branching particle system consisting of particles moving according to the Ornstein-Uhlenbeck process in $\Rd$ and undergoing a binary, supercritical branching with a constant rate $\lambda>0$. This system is…
This paper establishes a Transition Path Theory (TPT) for L\'{e}vy-type processes, addressing a critical gap in the study of the transition mechanism between meta-stabile states in non-Gaussian stochastic systems. A key contribution is the…
We consider a strong Markov process with killing and prove an approximation method for the distribution of the process conditioned not to be killed when it is observed. The method is based on a Fleming-Viot type particle system with…
A decision tree is commonly restricted to use a single hyperplane to split the covariate space at each of its internal nodes. It often requires a large number of nodes to achieve high accuracy, hurting its interpretability. In this paper,…
We study oriented percolation on random causal triangulations, those are random planar graphs obtained roughly speaking by adding horizontal connections between vertices of an infinite tree. When the underlying tree is a geometric…
We consider a random process on recursive trees, with three types of events. Vertices give birth at a constant rate (growth), each edge may be removed independently (fragmentation of the tree) and clusters (or trees) are frozen with a rate…
The minimum spanning tree (MST) is a combinatorial optimization problem: given a connected graph with a real weight ("cost") on each edge, find the spanning tree that minimizes the sum of the total cost of the occupied edges. We consider…
We consider a critical branching particle system in $\R^d$, composed of individuals of a finite number of types $i\in\{1,...,K\}$. Each individual of type $i$ moves independently according to a symmetric $\alpha_i$-stable motion. We assume…