Related papers: A large-deviation theorem for tree-indexed Markov …
This article investigates the topological pressure of isotropic axial products of Markov subshifts on the $d$-tree. We show that the quantity increases with dimension $d$. To achieve this, we introduce the pattern distribution vectors and…
We establish the large deviation principle for a topological Markov shift over infinite alphabet which satisfies strong combinatorial assumptions called ``finite irreducibility'' or ``finite primitiveness''. More precisely, we assume the…
In this paper, we show that the empirical measure of mean-field model satisfies the large deviation principle with respect to the weak convergence topology or the stronger Wasserstein metric, under the strong exponential integrability…
We consider a population with non-overlapping generations, whose size goes to infinity. It is described by a discrete genealogy which may be time non-homogeneous and we pay special attention to branching trees in varying environments. A…
We study random trees which are invariant in law under the operation of contracting each edge independently with probability $p\in(0,1)$. We show that all such trees can be constructed through Poissonian sampling from a certain class of…
We introduce the notion of a hereditary property for rooted real trees and we also consider reduction of trees by a given hereditary property. Leaf-length erasure, also called trimming, is included as a special case of hereditary reduction.…
Aldous, Evans and Pitman (1998) studied the behavior of the fragmentation process derived from deleting the edges of a uniform random tree on $n$ labelled vertices. In particular, they showed that, after proper rescaling, the above…
We study the large deviations of Markov chains under the sole assumption that the state space is discrete. In particular, we do not require any of the usual irreducibility and exponential tightness assumptions. Using subadditive arguments,…
We consider stochastic processes on complete, locally compact tree-like metric spaces $(T,r)$ on their "natural scale" with boundedly finite speed measure $\nu$. Given a triple $(T,r,\nu)$ such a speed-$\nu$ motion on $(T,r)$ can be…
We show that for any fixed dense graph G and bounded-degree tree T on the same number of vertices, a modest random perturbation of G will typically contain a copy of T . This combines the viewpoints of the well-studied problems of embedding…
We provide simplified proofs for the asymptotic distribution of the number of cuts required to cut down a Galton-Watson tree with critical, finite-variance offspring distribution, conditioned to have total progeny $n$. Our proof is based on…
The large deviations at 'Level 2.5 in time' for time-dependent ensemble-empirical-observables, introduced by C. Maes, K. Netocny and B. Wynants [Markov Proc. Rel. Fields. 14, 445 (2008)] for the case of $N$ independent Markov jump…
We prove existence of the large deviation principle, with a proper convex rate function, for the distribution of the renormalized distance from the origin of a random walk on a free product of finitely generated groups. As a consequence, we…
In this article we study the stochastic block model also known as the multi-type random networks (MRNs). For the stochastic block model or the MRNs we define the empirical group measure, empirical cooperative measure and the empirical…
We study the long-term behavior of weighted multi-type branching processes, focusing on extending classical laws of large numbers and martingale convergence to settings with infinitely many weighted particles, arbitrary type spaces and…
To sample from a given target distribution, Markov chain Monte Carlo (MCMC) sampling relies on constructing an ergodic Markov chain with the target distribution as its invariant measure. For any MCMC method, an important question is how to…
In this article, we study a simple random walk on a decorated Galton-Watson tree, obtained from a Galton-Watson tree by replacing each vertex of degree $n$ with an independent copy of a graph $G_n$ and gluing the inserted graphs along the…
One-dimensional run-and-tumble processes may converge towards some localized non-equilibrium steady state when the two velocities and/or the two switching rates are space-dependent. A long dynamical trajectory can be then analyzed via the…
The configuration model is a sequence of random graphs constructed such that in the large network limit the degree distribution converges to a pre-specified probability distribution. The component structure of such random graphs can be…
We consider a marking procedure of the vertices of a tree where each vertex is marked independently from the others with a probability that depends only on its out-degree. We prove that a critical Galton-Watson tree conditioned on having a…