Related papers: Rice Formula for processes with jumps and applicat…
Coarse-graining is a standard method of extracting a simple Markov process from a more complicated one by identifying states. Here we extend coarse-graining to open Markov processes. An "open" Markov process is one where probability can…
Empirical processes for stationary, causal sequences are considered. We establish empirical central limit theorems for classes of indicators of left half lines, absolutely continuous functions and piecewise differentiable functions. Sample…
Let $\Gamma$ denote the space of all locally finite subsets (configurations) in $\mathbb R^d$. A stochastic dynamics of binary jumps in continuum is a Markov process on $\Gamma$ in which pairs of particles simultaneously hop over $\mathbb…
We develop criteria for recurrence and transience of one-dimensional Markov processes which have jumps and oscillate between $+\infty$ and $-\infty$. The conditions are based on a Markov chain which only consists of jumps (overshoots) of…
We give conditions under which near-critical stochastic processes on the half-line have infinitely many or finitely many cutpoints, generalizing existing results on nearest-neighbour random walks to adapted processes with bounded increments…
Layered stable (multivariate) distributions and processes are defined and studied. A layered stable process combines stable trends of two different indices, one of them possibly Gaussian. More precisely, in short time, it is close to a…
We propose a general framework to study last passage times, suprema and drawdowns of a large class of stochastic processes. A central role in our approach is played by processes of class Sigma. After investigating convergence properties and…
We consider a pure-jump stable Cox-Ingersoll-Ross ($\alpha$-stable CIR) process driven by a non-symmetric stable L{\'e}vy process with jump activity $\alpha$ $\in$ (1, 2) and we address the joint estimation of drift, scaling and jump…
We consider piecewise deterministic Markov processes with degenerate transition kernels of the "house-of-cards"-type. We use a splitting scheme based on jump times to prove the absolute continuity, as well as some regularity, of the…
The crossing number of a graph is the minimum number of crossings over all of its drawings on the plane. The Crossing Lemma, proved more than 40 years ago, is a tight lower bound on the crossing number of a graph in terms of the number of…
It is well known that a regular diffusion on an interval $I$ without killing inside is uniquely determined by a canonical scale function $s$ and a canonical speed measure $m$. Note that $s$ is a strictly increasing and continuous function…
We consider the task of generating draws from a Markov jump process (MJP) between two time-points at which the process is known. Resulting draws are typically termed bridges and the generation of such bridges plays a key role in…
The problem of appropriately matching items subject to compatibility constraints arises in a number of important applications. While most of the literature on matching theory focuses on a static setting with a fixed number of items, several…
We define the probability structure of a continuous-time time-homogeneous Markov jump process, on a finite graph, that represents the continuous-time counterpart of the so-called Ruelle-Bowen discrete-time random walk. It constitutes the…
Our first result concerns a characterisation by means of a functional equation of Poisson point processes conditioned by the value of their first moment. It leads to a generalised version of Mecke's formula. En passant, it also allows to…
We present recent results on coarse-graining techniques for thermodynamic quantities (canonical averages) and dynamical quantities (averages of path functionals over solutions of overdamped Langevin equations). The question is how to obtain…
We study a density-dependent Markov jump process describing a population where each individual is characterized by a type, and reproduces at rates depending both on its type and on the population type distribution. We are interested in the…
The purpose of this paper is to extend the investigation of the Fleming-Viot process in discrete space started in a previous work to two specific examples. The first one corresponds to a random walk on the complete graph. Due to its…
We consider the first-crossing-time problem through a constant boundary for a Wiener process perturbed by random jumps driven by a counting process. On the base of a sample-path analysis of the jump-diffusion process we obtain explicit…
Processes having the same bridges are said to belong to the same reciprocal class. In this article we analyze reciprocal classes of Markov counting processes by identifying their reciprocal invariants and we characterize them as the set of…