Related papers: Exit times for an increasing L\'evy tree-valued pr…
After defining non-Gaussian L\'evy processes for two-sided time, stochastic differential equations with such L\'evy processes are considered. Solution paths for these stochastic differential equations have countable jump discontinuities in…
A family of continuous-state branching processes with immigration are constructed as the solution flow of a stochastic equation system driven by time-space noises. The family can be regarded as an inhomogeneous increasing path-valued…
In this paper we analyze a L\'evy process reflected at a general (possibly random) barrier. For this process we prove Central Limit Theorem for the first passage time. We also give the finite-time first passage probability asymptotics.
The spectral theory of random walks on networks of arbitrary topology can be readily extended to study random walks and L\'evy flights subject to resetting on these structures. When a discrete-time process is stochastically brought back…
The most fundamental problem in statistical causality is determining causal relationships from limited data. Probability trees, which combine prior causal structures with Bayesian updates, have been suggested as a possible solution. In this…
We consider a continuous-time random walk which is defined as an interpolation of a random walk on a point process on the real line. The distances between neighboring points of the point process are i.i.d. random variables in the normal…
We consider a model of random tree growth, where at each time unit a new vertex is added and attached to an already existing vertex chosen at random. The probability with which a vertex with degree $k$ is chosen is proportional to $w(k)$,…
We use point processes theory to describe the asymptotic distribution of all upper order statistics for observations collected at renewal times. As a corollary, we obtain limiting theorems for corresponding extremal processes.
A version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time…
We consider discrete time dynamical systems and show the link between Hitting Time Statistics (the distribution of the first time points land in asymptotically small sets) and Extreme Value Theory (distribution properties of the partial…
We study the limiting extremal and cluster point processes of branching Brownian motion. The former records the heights of all extreme values of the process, while the latter records the relative heights of extreme values in a genealogical…
We consider a stochastic process driven by a diffusion and jumps. We devise a technique, which is based on a discrete record of observations, for identifying the times when jumps larger than a suitably defined threshold occurred. The…
The paper examines a class of first order linear hyperbolic systems, proposed as a generalization of the Goldstein-Kac model for velocity-jump processes and determined by a finite number of speeds and corresponding transition rates. It is…
As a first step toward a characterization of the limiting extremal process of branching Brownian motion, we proved in a recent work [Comm. Pure Appl. Math. 64 (2011) 1647-1676] that, in the limit of large time $t$, extremal particles…
We give a deterministic algorithm to construct a graph with no loops (a tree or a forest) whose vertices are the points of a d-dimensional stationary Poisson process S, subset of R^d. The algorithm is independent of the origin of…
We consider an initial Eve-population and a population of neutral mutants, such that the total population dies out in finite time. We describe the evolution of the Eve-population and the total population with continuous state branching…
We derive an upper bound for the annealed return probability for the simple random walk on supercritical Bienaym\'e-Galton-Watson trees. The bound decays subexponentially in time $t$ with $t^{1/3}$ in the exponent. It is valid for all…
Let $X$ be a real L\'evy process and let $\Xpos $ be the process conditioned to stay positive. We assume that $ 0 $ is regular for $(-\infty, 0)$ and $(0, +\infty) $ with respect to $X$. Using elementary excursion theory arguments, we…
In this paper, we aim to provide probabilistic and combinatorial insights into tree formulas for the Green function and hitting probabilities of Markov chains on a finite state space. These tree formulas are closely related to loop-erased…
An efficient approach to the calculation of the $\epsilon$-entropy is proposed. The method is based on the idea of looking at the information content of a string of data, by analyzing the signal only at the instants when the fluctuations…