We study the global and local regularity properties of random wavelet series whose coefficients exhibit correlations given by a tree-indexed Markov chain. We determine the law of the spectrum of singularities of these series, thereby performing their multifractal analysis. We also show that almost every sample path displays an oscillating singularity at almost every point and that the points at which a sample path has at most a given Holder exponent form a set with large intersection.
In this article is introduced and studied a set-indexed Markov property named C-Markov. This new definition fulfils one important expectation for a Markov property: there exists a natural set-indexed generalization of the concept of transition operator which leads to characterization and construction theorems for C-Markov processes. Several other usual Markovian notions, including Feller and strong Markov properties, can also be developed in this framework. Actually, the C-Markov property turns out to be a natural extension of the two-parameter \ast-Markov property to the multiparameter and as…
We consider a type of Markov property for set-indexed processes which is satisfied by all processes with independent increments and which allows us to introduce a transition system theory leading to the construction of the process. A set-indexed generator is defined such that it completely characterizes the distribution of the process.
We study the size properties of a general model of fractal sets that are based on a tree-indexed family of random compacts and a tree-indexed Markov chain. These fractals may be regarded as a generalization of those resulting from the Moran-like deterministic or random recursive constructions considered by various authors. Among other applications, we consider various extensions of Mandelbrot's fractal percolation process.
We present a satisfactory definition of the important class of Lévy processes indexed by a general collection of sets. We use a new definition for increment stationarity of set-indexed processes to obtain different characterizations of this class. As an example, the set-indexed compound Poisson process is introduced. The set-indexed Lévy process is characterized by infinitely divisible laws and a Lévy-Khintchine representation. Moreover, the following concepts are discussed: projections on flows, Markov properties, and pointwise continuity. Finally the study of sample paths leads to a Lévy-Itô…
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 spatial version of the classical Markov property. Then, we construct the analogue of the local time by an approximation procedure and we characterize the support of its Lebesgue-Stieltjes measure. We also give an equivalent construction in terms of a special family of exit local times. Finally, combining these results, we show that the points at which the Mar…
The purpose of this article is a set-indexed extension of the well-known Ornstein-Uhlenbeck process. The first part is devoted to a stationary definition of the random field and ends up with the proof of a complete characterization by its $L^2$-continuity, stationarity and set-indexed Markov properties. This specific Markov transition system allows to define a general \emph{set-indexed Ornstein-Uhlenbeck (SIOU) process} with any initial probability measure. Finally, in the multiparameter case, the SIOU process is proved to admit a natural integral representation.
A family of Feller branching diffusions $Z^x$, $x \ge 0$, with nonlinear drift and initial value $x$ can, with a suitable coupling over the {\em ancestral masses} $x$, be viewed as a path-valued process indexed by $x$. For a coupling due to Dawson and Li, which in case of a linear drift describes the corresponding Feller branching diffusion, and in our case makes the path-valued process Markovian, we find an SDE solved by $Z$, which is driven by a random point measure on excursion space. In this way we are able to identify the infinitesimal generator of the path-valued process. We also establi…
In a general setting we solve the following inverse problem: Given a positive operators $R$, acting on measurable functions on a fixed measure space $(X,\mathcal B_X)$, we construct an associated Markov chain. Specifically, starting with a choice of $R$ (the transfer operator), and a probability measure $μ_0$ on $(X, \mathcal B_X)$, we then build an associated Markov chain $T_0, T_1, T_2,\ldots$, with these random variables (r.v) realized in a suitable probability space $(Ω,\mathcal F, \mathbb P)$, and each r.v. taking values in $X$, and with $T_0$ having the probability $μ_0$ as law. We furth…
We consider a sequence of Markov chains $(\mathcal X^n)_{n=1,2,...}$ with $\mathcal X^n = (X^n_σ)_{σ\in\mathcal T}$, indexed by the full binary tree $\mathcal T = \mathcal T_0 \cup \mathcal T_1 \cup ...$, where $\mathcal T_k$ is the $k$th generation of $\mathcal T$. In addition, let $(Σ_k)_{k=0,1,2,...}$ be a random walk on $\mathcal T$ with $Σ_k \in \mathcal T_k$ and $\widetilde{\mathcal R}^n = (\widetilde R_t^n)_{t\geq 0}$ with $\widetilde R_t^n := X_{Σ_{[tn]}}$, arising by observing the Markov chain $\mathcal X^n$ along the random walk. We present a law of large numbers concerning the empir…
We study continuous processes indexed by a special family of graphs. Processes indexed by vertices of graphs are known as probabilistic graphical models. Burdzy and Pal in their paper proposed a continuous version of graphical models -- processes indexed by time-like graphs. We construct a more general family of continuous processes on a wider family of graphs, find new properties and solve the conjecture of uniqueness of the distribution for the process indexed by graphs with infinite number of vertices. We present new results showing connections to the stochastic heat equation, Markov random…
We study the evolution of a particle system whose genealogy is given by a supercritical continuous time Galton--Watson tree. The particles move independently according to a Markov process and when a branching event occurs, the offspring locations depend on the position of the mother and the number of offspring. We prove a law of large numbers for the empirical measure of individuals alive at time t. This relies on a probabilistic interpretation of its intensity by mean of an auxiliary process. The latter has the same generator as the Markov process along the branches plus additional jumps, ass…
We introduce block Markov chains (BMCs) indexed by an infinite rooted tree. It turns out that BMCs define a new class of tree-indexed Markovian processes. We clarify the structure of BMCs in connection with Markov chains (MCs) and Markov random fields (MRFs). Mainly, show that probability measures which are BMCs for every root are indeed Markov chains (MCs) and yet they form a strict subclass of Markov random fields (MRFs) on the considered tree. Conversely, a class of MCs which are BMCs is characterized. Furthermore, we establish that in the one-dimensional case the class of BMCs coincides wi…
We study weak convergence of empirical processes of dependent data $(X_i)_{i\geq0}$, indexed by classes of functions. Our results are especially suitable for data arising from dynamical systems and Markov chains, where the central limit theorem for partial sums of observables is commonly derived via the spectral gap technique. We are specifically interested in situations where the index class ${\mathcal{F}}$ is different from the class of functions $f$ for which we have good properties of the observables $(f(X_i))_{i\geq0}$. We introduce a new bracketing number to measure the size of the index…
Given a finite typed rooted tree $T$ with $n$ vertices, the {\em empirical subtree measure} is the uniform measure on the $n$ typed subtrees of $T$ formed by taking all descendants of a single vertex. We prove a large deviation principle in $n$, with explicit rate function, for the empirical subtree measures of multitype Galton-Watson trees conditioned to have exactly $n$ vertices. In the process, we extend the notions of shift-invariance and specific relative entropy--as typically understood for Markov fields on deterministic graphs such as $\mathbb Z^d$--to Markov fields on random trees. We …
Consider a continuous time particle system $η^t=(η^t(k),k\in \mathbb{L})$, indexed by a lattice $\mathbb{L}$ which will be either $\mathbb{Z}$, $\mathbb{Z}/n\mathbb{Z}$, a segment $\{1,\cdots, n\}$, or $\mathbb{Z}^d$, and taking its values in the set $E_κ^{\mathbb{L}}$ where $E_κ=\{0,\cdots,κ-1\}$ for some fixed $κ\in\{\infty, 2,3,\cdots\}$. Assume that the Markovian evolution of the particle system (PS) is driven by some translation invariant local dynamics with bounded range, encoded by a jump rate matrix $T$. These are standard settings, satisfied by the TASEP, the voter models, the contact…
In this paper, we use the Markov property introduced in Balan and Ivanoff (J. Theor. Probab. 15, 2002, 553-588) for set-indexed processes and we prove that a Markov prior distribution leads to a Markov posterior distribution. In particular, by proving that a neutral to the right prior distribution leads to a neutral to the right posterior distribution, we extend a fundamental result of Doksum (Ann. Probab. 2,1974, 183-201) to arbitrary sample spaces.
We investigate the transportation cost-information inequalities for bifurcating Markov chains which are a class of processes indexed by binary tree. These processes provide models for cell growth when each individual in one generation gives birth to two offsprings in the next one. Transportation cost inequalities provide useful concentra-tion inequalities. We also study deviation inequalities for the empiri-cal means under relaxed assumptions on the Wasserstein contraction of the Markov kernels. Applications to bifurcating non linear autore-gressive processes are considered: deviation inequali…
Bifurcating Markov chains (BMC) are Markov chains indexed by a full binary tree representing the evolution of a trait along a population where each individual has two children. We provide a central limit theorem for additive functionals of BMC under $L^2$-ergodic conditions with three different regimes. This completes the pointwise approach developed in a previous work. As application, we study the elementary case of symmetric bifurcating autoregressive process, which justify the non-trivial hypothesis considered on the kernel transition of the BMC. We illustrate in this example the phase tran…
Given an i.i.d. sample from a distribution $F$ on $\mathbb{R}$ with uniformly continuous density $p_0$, purely data-driven estimators are constructed that efficiently estimate $F$ in sup-norm loss and simultaneously estimate $p_0$ at the best possible rate of convergence over Hölder balls, also in sup-norm loss. The estimators are obtained by applying a model selection procedure close to Lepski's method with random thresholds to projections of the empirical measure onto spaces spanned by wavelets or $B$-splines. The random thresholds are based on suprema of Rademacher processes indexed by wave…
We prove an analog of the classical Zero-One Law for both homogeneous and nonhomogeneous Markov chains (MC). Its almost precise formulation is simple: given any event $A$ from the tail $σ$-algebra of MC $(Z_n)$, for large $n$, with probability near one, the trajectories of the MC are in states $i$, where $P(A|Z_n=i)$ is either near $0$ or near $1$. A similar statement holds for the entrance $σ$-algebra, when $n$ tends to $-\infty$. To formulate this second result, we give detailed results on the existence of nonhomogeneous Markov chains indexed by $\mathbb Z_-$ or $\mathbb Z$ in both the finit…
We study the loop clusters induced by Poissonian ensembles of Markov loops on a finite or countable graph (Markov loops can be viewed as excursions of Markov chains with a random starting point, up to re-rooting). Poissonian ensembles are seen as a Poisson point process of loops indexed by 'time'. The evolution in time of the loop clusters defines a coalescent process on the vertices of the graph. After a description of some general properties of the coalescent process, we address several aspects of the loop clusters defined by a simple random walk killed at a constant rate on three different …
We investigate recurrence and transience of Branching Markov Chains (BMC) in discrete time. Branching Markov Chains are clouds of particles which move (according to an irreducible underlying Markov Chain) and produce offspring independently. The offspring distribution can depend on the location of the particle. If the offspring distribution is constant for all locations, these are Tree-Indexed Markov chains in the sense of \cite{benjamini94}. Starting with one particle at location $x$, we denote by $α(x)$ the probability that $x$ is visited infinitely often by the cloud. Due to the irreducibil…
We investigate the convergence in distribution of sequential empirical processes of dependent data indexed by a class of functions F. Our technique is suitable for processes that satisfy a multiple mixing condition on a space of functions which differs from the class F. This situation occurs in the case of data arising from dynamical systems or Markov chains, for which the Perron--Frobenius or Markov operator, respectively, has a spectral gap on a restricted space. We provide applications to iterative Lipschitz models that contract on average.
A fundamental algorithm for selecting ranks from a finite subset of an ordered set is Radix Selection. This algorithm requires the data to be given as strings of symbols over an ordered alphabet, e.g., binary expansions of real numbers. Its complexity is measured by the number of symbols that have to be read. In this paper the model of independent data identically generated from a Markov chain is considered. The complexity is studied as a stochastic process indexed by the set of infinite strings over the given alphabet. The orders of mean and variance of the complexity and, after normalization…
The main purpose of this article is to establish moderate deviation principles for additive functionals of bifurcating Markov chains. Bifurcating Markov chains are a class of processes which are indexed by a regular binary tree. They can be seen as the models which represent the evolution of a trait along a population where each individual has two offsprings. Unlike the previous results of Bitseki, Djellout \& Guillin (2014), we consider here the case of functions which depend only on one variable. So, mainly inspired by the recent works of Bitseki \& Delmas (2020) about the central limit theo…
From the datum of an integer partition and a classical Lie algebra, one can define a Markov chain on an associated multiplicative graph. For each classical family A, C, B, D, we thus obtain a sequence of Markov chain which is indexed by the rank of the considered algebra. In this article we show that, for each type, the transition kernel of the Markov chain has a limit when the rank tends to infinity. Moreover, the limit kernel does not depend on the considered type.
We propose an adaptive estimator for the stationary distribution of a bifurcating Markov Chain on $\mathbb R^d$. Bifurcating Markov chains (BMC for short) are a class of stochastic processes indexed by regular binary trees. A kernel estimator is proposed whose bandwidth is selected by a method inspired by the works of Goldenshluger and Lepski [18]. Drawing inspiration from dimension jump methods for model selection, we also provide an algorithm to select the best constant in the penalty.
Consider a sequence (indexed by n) of Markov chains Z^n in R^d characterized by transition kernels that approximately (in n) depend only on the rescaled state n^{-1} Z^n. Subject to a smoothness condition, such a family can be closely coupled on short time intervals to a Brownian motion with quadratic drift. This construction is used to determine the first two terms in the asymptotic (in n) expansion of the probability that the rescaled chain exits a convex polytope. The constant term and the first correction of size n^{-1/6} admit sharp characterization by solutions to associated differential…
Consider a sequence $(η^N(t) :t\ge 0)$ of continuous-time, irreducible Markov chains evolving on a fixed finite set $E$, indexed by a parameter $N$. Denote by $R_N(η,ξ)$ the jump rates of the Markov chain $η^N_t$, and assume that for any pair of bonds $(η,ξ)$, $(η',ξ')$ $\arctan \{R_N(η,ξ)/R_N(η',ξ')\}$ converges as $N\uparrow\infty$. Under a hypothesis slightly more restrictive (cf. \eqref{mhyp} below), we present a recursive procedure which provides a sequence of increasing time-scales $θ^1_N, \dots, θ^{\mf p}_N$, $θ^j_N \ll θ^{j+1}_N$, and of coarsening partitions $\{\ms E^j_1, \dots, \ms E…
Consider a system of interacting particles indexed by the nodes of a graph whose vertices are equipped with marks representing parameters of the model such as the environment or initial data. Each particle takes values in a countable state space and evolves according to a (possibly non-Markovian) continuous-time pure jump process whose jump intensities depend only on its own state (or history) and marks as well as the states (or histories) and marks of particles and edges in its neighborhood in the graph. Under mild conditions on the jump intensities, it is shown that the trajectories of the i…
A Markov tree is a random vector indexed by the nodes of a tree whose distribution is determined by the distributions of pairs of neighbouring variables and a list of conditional independence relations. Upon an assumption on the tails of the Markov kernels associated to these pairs, the conditional distribution of the self-normalized random vector when the variable at the root of the tree tends to infinity converges weakly to a random vector of coupled random walks called tail tree. If, in addition, the conditioning variable has a regularly varying tail, the Markov tree satisfies a form of one…
We propose a new method for performing multiscale analysis of functions defined on the vertices of a finite connected weighted graph. Our approach relies on a random spanning forest to downsample the set of vertices, and on approximate solutions of Markov intertwining relation to provide a subgraph structure and a filter bank leading to a wavelet basis of the set of functions. Our construction involves two parameters q and q'. The first one controls the mean number of kept vertices in the downsampling, while the second one is a tuning parameter between space localization and frequency localiza…
We consider a countable system of interacting (possibly non-Markovian) stochastic differential equations driven by independent Brownian motions and indexed by the vertices of a locally finite graph $G = (V,E)$. The drift of the process at each vertex is influenced by the states of that vertex and its neighbors, and the diffusion coefficient depends on the state of only that vertex. Such processes arise in a variety of applications including statistical physics, neuroscience, engineering and math finance. Under general conditions on the coefficients, we show that if the initial conditions form …
We consider a Markov chain $(x_n)$ whose kernel is indexed by a scaling parameter $γ>0$, refered to as the step size. The aim is to analyze the behavior of the Markov chain in the doubly asymptotic regime where $n\to\infty$ then $γ\to 0$. First, under mild assumptions on the so-called drift of the Markov chain, we show that the interpolated process converges narrowly to the solutions of a Differential Inclusion (DI) involving an upper semicontinuous set-valued map with closed and convex values. Second, we provide verifiable conditions which ensure the stability of the iterates. Third, by putti…
Nonlinear Markov Chains (nMC) are regarded as the original (linear) Markov Chains with nonlinear small perturbations. It fits real-world data better, but its associated properties are difficult to describe. A new approach is proposed to analyze the ergodicity and even estimate the convergence bounds of nMC, which is more precise than existing results. In the new method, Coupling Markov about homogeneous Markov chains is applied to reconstitute the relationship between distribution at any times and the limiting distribution. The convergence bounds can be provided by the transition probability m…
Bifurcating Markov chains (BMC) are Markov chains indexed by a full binary tree representing the evolution of a trait along a population where each individual has two children. We provide a central limit theorem for general additive functionals of BMC, and prove the existence of three regimes. This corresponds to a competition between the reproducing rate (each individual has two children) and the ergodicity rate for the evolution of the trait. This is in contrast with the work of Guyon (2007), where the considered additive functionals are sums of martingale increments, and only one regime app…
Bifurcating Markov chains (BMC) are Markov chains indexed by a full binary tree representing the evolution of a trait along a population where each individual has two children. Motivated by the functional estimation of the density of the invariant probability measure which appears as the asymptotic distribution of the trait, we prove the consistence and the Gaussian fluctuations for a kernel estimator of this density based on late generations. In this setting, it is interesting to note that the distinction of the three regimes on the ergodic rate identified in a previous work (for fluctuations…
The paper introduces and investigates the natural extension to the path-dependent setup of the usual concept of canonical Markov class introduced by Dynkin and which is at the basis of the theory of Markov processes. That extension, indexed by starting paths rather than starting points will be called path-dependent canonical class. Associated with this is the generalization of the notions of semi-group and of additive functionals to the path-dependent framework. A typical example of such family is constituted by the laws $({\mathbb P}^{s,$η$})\_{(s,η) \in{\mathbb R} \times Ω}$ , where for fixe…
Convergence to equilibrium for density dependent Markov jump processes
University of Melbourne（墨尔本大学）；Monash University（蒙纳士大学）；Institut für Mathematik, Universität Zürich（苏黎世大学数学研究所）；Department of Mathematics, LSE（伦敦政治经济学院数学系）；Department of Mathematics, University of Manchester（曼彻斯特大学数学系）
In a first part, we prove Bernstein-type deviation inequalities for bifurcating Markov chains (BMC) under a geometric ergodicity assumption, completing former results of Guyon and Bitseki Penda, Djellout and Guillin. These preliminary results are the key ingredient to implement nonparametric wavelet thresholding estimation procedures: in a second part, we construct nonparametric estimators of the transition density of a BMC, of its mean transition density and of the corresponding invariant density, and show smoothness adaptation over various multivariate Besov classes under $L^p$-loss error, f…
The aim of this note is to present an elementary proof of a variation of Harris' ergodic theorem of Markov chains. This theorem, dating back to the fifties essentially states that a Markov chain is uniquely ergodic if it admits a ``small'' set which is visited infinitely often. This gives an extension of the ideas of Doeblin to the unbounded state space setting. Often this is established by finding a Lyapunov function with ``small'' level sets. This topic has been studied by many authors (cf. Harris, Hasminskii, Nummelin, Meyn and Tweedie). If the Lyapunov function is strong enough, one has a …
We give a criterion of the form Q(d)c(M)<1 for the non-reconstructability of tree-indexed q-state Markov chains obtained by broadcasting a signal from the root with a given transition matrix M. Here c(M) is an explicit function, which is convex over the set of M's with a given invariant distribution, that is defined in terms of a (q-1)-dimensional variational problem over symmetric entropies. Further Q(d) is the expected number of offspring on the Galton-Watson tree. This result is equivalent to proving the extremality of the free boundary condition-Gibbs measure within the corresponding Gibbs…
We propose a multilevel Monte Carlo-FEM algorithm to solve elliptic Bayesian inverse problems with "Besov random tree prior". These priors are given by a wavelet series with stochastic coefficients, and certain terms in the expansion vanishing at random, according to the law of so-called Galton-Watson trees. This allows to incorporate random fractal structures and large deviations in the log-diffusion, which occur naturally in many applications from geophysics or medical imaging. This framework entails two main difficulties: First, the associated diffusion coefficient does not satisfy a unifor…
We consider sequences $(X_t^N)_{t\geq0}$ of Markov processes in two dimensions whose fluid limit is a stable solution of an ordinary differential equation of the form $\dot{x}_t=b(x_t)$, where $b(x)={\pmatrix{-μ0 0 λ}}x+τ(x)$ for some $λ,μ>0$ and $τ(x)=O(|x|^2)$. Here the processes are indexed so that the variance of the fluctuations of $X_t^N$ is inversely proportional to N. The simplest example arises from the OK Corral gunfight model which was formulated by Williams and McIlroy [Bull. London Math. Soc. 30 (1998) 166--170] and studied by Kingman [Bull. London Math. Soc. 31 (1999) 601--606]. …
We consider a family of continuous time symmetric random walks indexed by $k\in \mathbb{N}$, $\{X_k(t),\,t\geq 0\}$. For each $k\in \mathbb{N}$ the matching random walk take values in the finite set of states $Γ_k=\frac{1}{k}(\mathbb{Z}/k\mathbb{Z})$ which is a subset of the unitary circle. The stationary probability for such process converges to the uniform distribution on the circle, when $k\to \infty$. We disturb the system considering a fixed $C^2$ potential $V: \mathbb{S}^1 \to \mathbb{R}$ and we will denote by $V_k$ the restriction of $V$ to $Γ_k$. Then, we define a non-stochastic semigr…
