English
Related papers

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

200 papers

We develop a new Monte Carlo variance reduction method to estimate the expectation of two commonly encountered path-dependent functionals: first-passage times and occupation times of sets. The method is based on a recursive approximation of…

Probability · Mathematics 2014-10-28 Aleksandar Mijatovic , Martijn Pistorius , Johannes Stolte

We consider the exploration process associated to the continuous random tree (CRT) built using a Levy process with no negative jumps. This process has been studied by Duquesne, Le Gall and Le Jan. This measure-valued Markov process is a…

Probability · Mathematics 2007-06-07 Romain Abraham , Jean-Francois Delmas

We introduce a simple technique for proving the transience of certain processes defined on the random tree $\mathcal{G}$ generated by a supercritical branching process. We prove the transience for once-reinforced random walks on…

Probability · Mathematics 2007-05-23 Andrea Collevecchio

In this paper, we will discuss an approximation of the characteristic function of the first passage time for a Levy process using the martingale approach. The characteristic function of the first passage time of the tempered stable process…

Pricing of Securities · Quantitative Finance 2019-04-04 Young Shin Kim

L\'{e}vy processes with completely monotone jumps appear frequently in various applications of probability. For example, all popular stock price models based on L\'{e}vy processes (such as the Variance Gamma, CGMY/KoBoL and Normal Inverse…

Probability · Mathematics 2016-01-08 Daniel Hackmann , Alexey Kuznetsov

We provide a simple algorithm for construction of Brownian paths approximating those of a L\'evy process on a finite time interval. It requires knowledge of the L\'evy process trajectory on a chosen regular grid and the law of its endpoint,…

Probability · Mathematics 2021-10-25 Vladimir Fomichov , Jorge González Cázares , Jevgenijs Ivanovs

By using absolutely continuous lower bounds of the L\'evy measure, explicit gradient estimates are derived for the semigroup of the corresponding L\'evy process with a linear drift. A derivative formula is presented for the conditional…

Probability · Mathematics 2011-03-16 Feng-Yu Wang

In many random search processes of interest in chemistry, biology or during rescue operations, an entity must find a specific target site before the latter becomes inactive, no longer available for reaction or lost. We present exact results…

Statistical Mechanics · Physics 2024-02-16 Denis Boyer , Gabriel Mercado-Vásquez , Satya N. Majumdar , Grégory Schehr

For both Levy flight and Levy walk search processes we analyse the full distribution of first-passage and first-hitting (or first-arrival) times. These are, respectively, the times when the particle moves across a point at some given…

Statistical Mechanics · Physics 2019-10-15 V. V. Palyulin , G. Blackburn , M. A. Lomholt , N. W. Watkins , R. Metzler , R. Klages , A. V. Chechkin

It is considered the integrated process $X(t)= x + \int _0^t Y(s) ds ,$ where $Y(t)$ is a Gauss-Markov process starting from $y.$ The first-passage time (FPT) of $X$ through a constant boundary and the first-exit time of $X$ from an…

Probability · Mathematics 2017-03-02 Mario Abundo

We develop a technique that provides a lower bound on the speed of transient random walk in a random environment on regular trees. A refinement of this technique yields upper bounds on the first regeneration level and regeneration time. In…

Probability · Mathematics 2009-11-03 Andrea Collevecchio , Tom Schmitz

In this work, we study asymptotics of the genealogy of Galton-Watson processes. Thus we consider a offspring distribution such that the rescaled Galton-Watson processes converges to a continuous state branching process (CSBP) with jumps.…

Probability · Mathematics 2017-06-20 Ibrahima Drame , Etienne Pardoux

We study the optimal dividend problem in the dual model where dividend payments can only be made at the jump times of an independent Poisson process. In this context, Avanzi et al. [5] solved the case with i.i.d. hyperexponential jumps;…

Probability · Mathematics 2017-08-15 José-Luis Pérez , Kazutoshi Yamazaki

We start by providing an explicit characterization and analytical properties, including the persistence phenomena, of the distribution of the extinction time $\mathbb{T}$ of a class of non-Markovian self-similar stochastic processes with…

Probability · Mathematics 2022-05-24 Ronnie Loeffen , Pierre Patie , Mladen Savov

In this paper we consider the problem of pricing a perpetual American put option in an exponential regime-switching L\'{e}vy model. For the case of the (dense) class of phase-type jumps and finitely many regimes we derive an explicit…

Pricing of Securities · Quantitative Finance 2008-12-02 Z. Jiang , M. R. Pistorius

This paper gives examples of explicit arbitrage-free term structure models with L\'evy jumps via state price density approach. By generalizing quadratic Gaussian models, it is found that the probability density function of a L\'evy process…

Probability · Mathematics 2008-12-10 Jirô Akahori , Takahiro Tsuchiya

Tracking the movement of tracer particles has long been a strategy for uncovering complex structures. Here, we study discrete-time random walks on finite Cayley trees to infer key parameters such as tree depth and geometric bias toward the…

Statistical Mechanics · Physics 2025-12-01 Fabian H. Kreten , Ludger Santen , Reza Shaebani

Consider compound Poisson processes with negative drift and no negative jumps, which converge to some spectrally positive L\'evy process with non-zero L\'evy measure. In this paper we study the asymptotic behavior of the local time process,…

Probability · Mathematics 2013-05-24 Amaury Lambert , Florian Simatos

This paper is concerned with nonparametric estimation of the L\'evy density of a pure jump L\'evy process. The sample path is observed at $n$ discrete instants with fixed sampling interval. We construct a collection of estimators obtained…

Statistics Theory · Mathematics 2010-10-01 Fabienne Comte , Valentine Genon-Catalot

We consider the process of uncovering the vertices of a random labeled tree according to their labels. First, a labeled tree with $n$ vertices is generated uniformly at random. Thereafter, the vertices are uncovered one by one, in order of…

Probability · Mathematics 2023-01-03 Benjamin Hackl , Alois Panholzer , Stephan Wagner