Related papers: Local times and excursions for self-similar Markov…

We construct the analogue of the local time -- at a fixed point $x$ -- for Markov processes indexed by Levy trees. We start by proving that Markov processes indexed by Levy trees satisfy a special Markov property which can be thought as a…

Self-similar Markov trees constitute a remarkable family of random compact real trees carrying a decoration function that is positive on the skeleton. As the terminology suggests, they are self-similar objects that further satisfy a Markov…

We study a continuous-time simple random walk on a regular rooted tree of depth $n$ in two settings: either the walk is started from a leaf vertex and run until the tree root is first hit or it is started from the root and run until it has…

Recently introduced and studied in arXiv:2407.07888, a self-similar Markov tree (ssMt) is a random decorated tree that vastly generalises the fragmentation tree. We study here the critical case that was left aside in arXiv:2407.07888.…

We investigate the random continuous trees called L\'evy trees, which are obtained as scaling limits of discrete Galton-Watson trees. We give a mathematically precise definition of these random trees as random variables taking values in the…

We develop an excursion theory that describes the evolution of a Markov process indexed by a Levy tree away from a regular and instantaneous point $x$ of the state space. The theory builds upon a notion of local time at $x$ that was…

In [Aldous,Pitman,1998] a tree-valued Markov chain is derived by pruning off more and more subtrees along the edges of a Galton-Watson tree. More recently, in [Abraham,Delmas,2012], a continuous analogue of the tree-valued pruning dynamics…

A Markov Additive Process is a bi-variate Markov process $(\xi,J)=\big((\xi_t,J_t),t\geq0\big)$ which should be thought of as a multi-type L\'evy process: the second component $J$ is a Markov chain on a finite space $\{1,\ldots,K\}$, 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…

We consider the model of Brownian motion indexed by the Brownian tree, which has appeared in a variety of different contexts in probability, statistical physics and combinatorics. For this model, the total occupation measure is known to…

We study locally interacting processes in discrete time, often called probabilistic cellular automata, indexed by locally finite graphs. For infinite regular trees and certain generalized Galton-Watson trees, we show that the marginal…

We study a broad class of random labelled trees in which integer-valued labels evolve along the edges according to increments in $\{-1, 0, 1\}$. These models include e.g. branching random walks, embedded complete and incomplete binary…

We consider local times of the simple random walk on the $b$-ary tree of depth $n$ and study a point process which encodes the location of the vertex with the maximal local time and the properly centered maximum over leaves of each subtree…

We revisit the classical problem of approximating a stochastic differential equation by a discrete-time and discrete-space Markov chain. Our construction iterates Caratheodory's theorem over time to match the moments of the increments…

We establish that if a sequence of electrical networks equipped with conductance measures converges in the local Gromov--Hausdorff-vague topology and satisfies certain non-explosion and metric-entropy conditions,then the sequence of…

For a positive self-similar Markov process, X, we construct a local time for the random set, $\Theta$, of times where the process reaches its past supremum. Using this local time we describe an exit system for the excursions of X out of its…

We study Markov processes conditioned so that their local time must grow slower than a prescribed function. Building upon recent work on Brownian motion with constrained local time in [5] and [33], we study transience and recurrence for a…

Given a general critical or sub-critical branching mechanism, we define a pruning procedure of the associated L\'evy continuum random tree. This pruning procedure is defined by adding some marks on the tree, using L\'evy snake techniques.…

Phylogenetic trees constitute an interesting class of objects for stochastic processes due to the non-standard nature of the space they inhabit. In particular, many statistical applications require the construction of Markov processes on…

In this work we propose a novel method to calculate mean first-passage times (MFPTs) for random walks on graphs, based on a dimensionality reduction technique for Markov State Models, known as local-equilibrium (LE). We show that for a…