Related papers: A large-deviation theorem for tree-indexed Markov …

Motivated by the study of random temporal networks, we introduce a class of random trees that we coin \emph{uniform temporal trees}. A uniform temporal tree is obtained by assigning independent uniform $[0,1]$ labels to the edges of a…

Strong invariance principles in Markov chain Monte Carlo are crucial to theoretically grounded output analysis. Using the wide-sense regenerative nature of the process, we obtain explicit bounds in the strong invariance converging rates for…

We prove that critical multitype Galton-Watson trees converge after rescaling to the Brownian continuum random tree, under the hypothesis that the offspring distribution has finite covariance matrices. Our study relies on an ancestral…

In this article, we develop a framework to study the large deviation principle for matrix models and their quantized versions, by tilting the measures using the limits of spherical integrals obtained in [46,47]. As examples, we obtain 1. a…

This paper features a Cram\'er's theorem for finite-state Markov chains indexed by rooted $d$-trees, obtained via the method of types in the classical analysis of large deviations. Along with the theorem comes two applications: an…

We consider a finite collection of independent Hermitian heavy-tailed random matrices of growing dimension. Our model includes the L\'evy matrices proposed by Bouchaud and Cizeau, as well as sparse random matrices with O(1) non-zero entries…

We consider a Galton-Watson tree where each node is marked independently of each others with a probability depending on itsout-degree. Using a penalization method, we exhibit new martingales where the number of marks up to level n -- 1…

We consider random walks indexed by arbitrary finite random or deterministic trees. We derive a simple sufficient criterion which ensures that the maximal displacement of the tree-indexed random walk is determined by a single large jump.…

We destroy a finite tree of size $n$ by cutting its edges one after the other and in uniform random order. Informally, the associated cut-tree describes the genealogy of the connected components created by this destruction process. We…

We present a new pruning procedure on discrete trees by adding marks on the nodes of trees. This procedure allows us to construct and study a tree-valued Markov process $\{{\cal G}(u)\}$ by pruning Galton-Watson trees and an analogous…

In this paper we consider inhomogeneous Galton-Watson trees, and derive various moments for such processes: the number of vertices, the number of leaves, and the height of the tree. Also we make a simple condition of finiteness. We use…

The notion of tree entropy was introduced by the author as a normalized limit of the number of spanning trees in finite graphs, but is defined on random infinite rooted graphs. We give some new expressions for tree entropy; one uses…

We consider the random reversible Markov kernel K obtained by assigning i.i.d. nonnegative weights to the edges of the complete graph over n vertices and normalizing by the corresponding row sum. The weights are assumed to be in the domain…

Let $(g_n)_{n\geq 1}$ be a sequence of independent and identically distributed elements of the general linear group $GL(d, \mathbb R)$. Consider the random walk $G_n: = g_n \ldots g_1$. Under suitable conditions, we establish…

Let $\Xi$ be the adjacency matrix of an Erd\H{o}s-R\'enyi graph on $n$ vertices and with parameter $p$ and consider $A$ a $n\times n$ centered random symmetric matrix with bounded i.i.d. entries above the diagonal. When the mean degree $np$…

Let $(\xi_n)_{n=0}^\infty$ be a nonhomogeneous Markov chain taking values from finite state-space of $\mathbf{X}=\{1,2,\ldots,b\}$. In this paper, we will study the generalized entropy ergodic theorem with almost-everywhere and…

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 prove asymptotic equipartition properties for simple hierarchical structures (modelled as multitype Galton-Watson trees) and networked structures (modelled as randomly coloured random graphs). For example, for large $n$, a networked data…

The Glivenko--Cantelli theorem is a uniform version of the strong law of large numbers. It states that for every IID sequence of random variables, the empirical measure converges to the underlying distribution (in the sense of uniform…

We explore model based techniques of phylogenetic tree inference exercising Markov invariants. Markov invariants are group invariant polynomials and are distinct from what is known in the literature as phylogenetic invariants, although we…