English
Related papers

Related papers: Exit times for an increasing L\'evy tree-valued pr…

200 papers

We study the statistics of encounters of L\'evy flights by introducing the concept of vicious L\'evy flights - distinct groups of walkers performing independent L\'evy flights with the process terminating upon the first encounter between…

Statistical Mechanics · Physics 2010-11-09 Igor Goncharenko , Ajay Gopinathan

The main substance of the paper concerns the growth rate and the classification (ergodicity, transience) of a family of random trees. In the basic model, new edges appear according to a Poisson process of parameter $\lambda$ and leaves can…

Probability · Mathematics 2012-07-17 Guy Fayolle , Maxim Krikun , Jean-Marc Lasgouttes

We study the distribution of the 'gap time', the first time that a large gap appears, in the spatial birth and death point process on $[0,1]$ in which particles are added uniformly in space at rate $\lambda$ and are removed independently at…

Probability · Mathematics 2025-12-05 Eric Foxall , Clément Soubrier

Studying the behaviour of Markov processes at boundary points of the state space has a long history, dating back all the way to William Feller. With different motivations in mind entrance and exit questions have been explored for different…

Probability · Mathematics 2024-10-11 Samuel Baguley , Leif Döring , Quan Shi

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…

Methodology · Statistics 2025-02-06 Fadhel Ayed , Juho Lee , François Caron

Continuous time random walks combining diffusive and ballistic regimes are introduced to describe a class of L\'evy walks on lattices. By including exponentially-distributed waiting times separating the successive jump events of a walker,…

Statistical Mechanics · Physics 2014-12-02 Giampaolo Cristadoro , Thomas Gilbert , Marco Lenci , David P. Sanders

Pruning processes $(\mathcal{F}(\theta),\theta\geq 0)$ have been studied separately for Galton-Watson trees and for L\'evy trees/forests. We establish here a limit theory that strongly connects the two studies. This solves an open problem…

Probability · Mathematics 2014-09-04 Hui He , Matthias Winkel

We consider a Brownian motion with linear drift that splits at fixed time points into a fixed number of branches, which may depend on the branching point. For this process, which we shall refer to as the Brownian decision tree, we…

Probability · Mathematics 2025-12-08 Krzysztof Dȩbicki , Pavel Ievlev , Nikolai Kriukov

We consider a modulated process S which, conditional on a background process X, has independent increments. Assuming that S drifts to -infinity and that its increments (jumps) are heavy-tailed (in a sense made precise in the paper), we…

Probability · Mathematics 2017-11-29 Sergey Foss , Takis Konstantopoulos , Stan Zachary

A natural extension of a right-continuous integer-valued random walk is one which can jump to the right by one or two units. First passage times above a given fixed level then admit a tractable Laplace transform (probability generating…

Probability · Mathematics 2014-08-13 Matija Vidmar

We construct a stationary random tree, embedded in the upper half plane, with prescribed offspring distribution and whose vertices are the atoms of a unit Poisson point process. This process which we call Hammersley's tree process extends…

Probability · Mathematics 2016-05-11 Anne-Laure Basdevant , Lucas Gerin , Jean-Baptiste Gouere , Arvind Singh

The asymptotic analysis of high exceedance probabilities for Gaussian processes and fields has been a blooming research area since J. Pickands introduced the now-standard techniques in the late 60's. The \textit{vector-valued} processes,…

Probability · Mathematics 2024-01-12 Ievlev Pavel , Kriukov Nikolai

We study analytically an intermittent search process in one dimension. There is an immobile target at the origin and a searcher undergoes a discrete time jump process starting at $x_0\geq0$, where successive jumps are drawn independently…

Statistical Mechanics · Physics 2014-12-02 Lukasz Kusmierz , Satya N. Majumdar , Sanjib Sabhapandit , Gregory Schehr

We give an alternative proof of the fact that the vertex reinforced jump process on Galton- Watson tree has a phase transition between recurrence and transience as a function of c, the initial local time, see [3]. Further, applying the…

Probability · Mathematics 2016-11-28 Xinxin Chen , Xiaolin Zeng

We consider stochastic processes with (or without) memory whose evolution is encoded by a finite or infinite rooted tree. The main goal is to compare the entropy rates of a given base process and a second one, to be considered as a…

Information Theory · Computer Science 2017-04-21 Thomas Hirschler , Wolfgang Woess

The L\'evy walk process with rests is discussed. The jumping time is governed by an $\alpha$-stable distribution with $\alpha>1$ while a waiting time distribution is Poissonian and involves a position-dependent rate which reflects a…

Statistical Mechanics · Physics 2017-10-11 A. Kamińska , T. Srokowski

We introduce two general non-parametric methods for recovering paths of the Brownian and jump components from high-frequency observations of a L\'evy process. The first procedure relies on reordering of independently sampled normal…

Probability · Mathematics 2022-07-06 Jorge González Cázares , Jevgenijs Ivanovs

The mean first exit (passage) time characterizes the average time of a stochastic process never leaving a fixed region in the state space, while the escape probability describes the likelihood of a transition from one region to another for…

Probability · Mathematics 2017-02-28 Weihua Deng , Xiaochao Wu , Wanli Wang

For a L\'evy process on the real line, we provide complete criteria for the finiteness of exponential moments of the first passage time into the interval $(r,\infty)$, the sojourn time in the interval $(-\infty,r]$, and the last exit time…

Probability · Mathematics 2014-09-11 Frank Aurzada , Alexander Iksanov , Matthias Meiners

We present a new pruning procedure on discrete trees by adding marks on the nodes of trees. This procedure allows us to construct and study a tree-valued Markov process $\{{\cal G}(u)\}$ by pruning Galton-Watson trees and an analogous…

Probability · Mathematics 2012-06-28 Romain Abraham , Jean-Francois Delmas , Hui He