Related papers: Pruning a L\'evy continuum random tree
L\'evy walks are random walk processes whose step-lengths follow a long-tailed power-law distribution. Due to their abundance as movement patterns of biological organisms, significant theoretical efforts have been devoted to identifying the…
A careful look at rough path topology applied to Brownian motion reveals new possible properties of the well-known L\'evy area, in particular the presence of an intrinsic drift of this area. Using renormalization limit of Markov chains on…
We prove a metric space scaling limit for a critical random graph with independent and identically distributed degrees having power-law tail behaviour with exponent $\alpha+1$, where $\alpha \in (1,2)$. The limiting components are…
In this paper, we study the weak convergence of the extremes of supercritical branching L\'evy processes $\{\mathbb{X}_t, t \ge0\}$ whose spatial motions are L\'evy processes with regularly varying tails. The result is drastically different…
This paper investigates L\'evy walks with random velocities, extending classical models beyond constant speed assumptions. We derive scaling limits, demonstrating that diffusion depends on interplay between heavy-tailed duration and…
We study fine properties of L\'evy trees that are random compact metric spaces introduced by Le Gall and Le Jan in 1998 as the genealogy of continuous state branching processes. L\'evy trees are the scaling limits of Galton-Watson trees and…
Generalizing Kyprianou--Loeffen's refracted L\'evy processes, we define a new refracted L\'evy process which is a Markov process whose positive and negative motions are L\'evy processes different from each other. To construct it we utilize…
We present a comprehensive classical and parameterized complexity analysis of decision tree pruning operations, extending recent research on the complexity of learning small decision trees. Thereby, we offer new insights into the…
We consider a long-range percolation model on homogeneous oriented trees with several lengths. We obtain the critical surface as the set of zeros of a specific polynomial with coefficients depending explicitly on the lengths and the degree…
The tail behavior of aggregates of heavy-tailed random vectors is known to be determined by the so-called principle of "one large jump'', be it for finite sums, random sums, or, L\'evy processes. We establish that, in fact, a more general…
We consider the genealogy tree for a critical branching process conditioned on non-extinction. We enumerate vertices in each generation of the tree so that for each two generations one can define a monotone map describing the…
Conditional independence and graphical models are crucial concepts for sparsity and statistical modeling in higher dimensions. For L\'evy processes, a widely applied class of stochastic processes, these notions have not been studied. By the…
We study the maximal degree of (sub)critical L{\'e}vy trees which arise as the scaling limits of Bienaym{\'e}-Galton-Watson trees. We determine the genealogical structure of large nodes and establish a Poissonian decomposition of the tree…
We present the theory of the k-core pruning process (progressive removal of nodes with degree less than k) in uncorrelated random networks. We derive exact equations describing this process and the evolution of the network structure, and…
Can we obtain a Brownian CRT of mass $1/2$ from a CRT of mass $1$ by cutting certain branches? In this paper, we will answer that question in the much more general setting of self-similar Markov trees. Self-similar Markov trees (ssMt) are…
The Levy diffusion processes are a form of non ordinary statistical mechanics resting, however, on the conventional Markov property. As a consequence of this, their dynamic derivation is possible provided that (i) a source of randomness is…
Pure-jump L\'evy processes are popular classes of stochastic processes which have found many applications in finance, statistics or machine learning. In this paper, we propose a novel family of self-decomposable L\'evy processes where one…
We consider a discrete-time Markov chain, called fragmentation process, that describes a specific way of successively removing objects from a linear arrangement. The process arises in population genetics and describes the ancestry of the…
The first passage time process of a L\'evy subordinator with heavy-tailed L\'evy measure has long-range dependent paths. The random fluctuations that appear under two natural schemes of summation and time scaling of such stochastic…
The successive discrete structures generated by a sequential algorithm from random input constitute a Markov chain that may exhibit long term dependence on its first few input values. Using examples from random graph theory and search…