Related papers: Self-similar Markov trees and scaling limits
We study infinite tree and ultrametric matrices, and their action on the boundary of the tree. For each tree matrix we show the existence of a symmetric random walk associated to it and we study its Green potential. We provide a…
We study random two-dimensional spanning forests in the plane that can be viewed both in the discrete case and in their appropriately taken scaling limits as a uniformly chosen spanning tree with some Poissonian deletion of edges or points.…
We generalize recent results of Haas and Miermont to obtain scaling limits of Markov branching trees whose size is specified by the number of nodes whose out-degree lies in a given set. We then show that this implies that the scaling limit…
We use Dirichlet form methods to construct and analyze a reversible Markov process, the stationary distribution of which is the Brownian continuum random tree. This process is inspired by the subtree prune and regraft (SPR) Markov chains…
In arXiv:1609.05666v1 [math.PR] a functional limit theorem was proved. It states that symmetric processes associated with resistance metric measure spaces converge when the underlying spaces converge with respect to the…
The simple Galton--Watson process describes populations where individuals live one season and are then replaced by a random number of children. It can also be viewed as a way of generating random trees, each vertex being an individual of…
Positive self-similar Markov processes (pssMp) are positive Markov processes that satisfy the scaling property and it is known that they can be represented as the exponential of a time-changed L\'evy process via Lamperti representation. In…
Automorphism groups of locally finite trees provide a large class of examples of simple totally disconnected locally compact groups. It is desirable to understand the connections between the global and local structure of such a group.…
We prove a strong form of the invariance under re-rooting of the distribution of the continuous random trees called Levy trees. This extends previous results due to several authors.
Consider a uniformly sampled random $d$-regular graph on $n$ vertices. If $d$ is fixed and $n$ goes to $\infty$ then we can relate typical (large probability) properties of such random graph to a family of invariant random processes (called…
We prove asymptotic normality for the number of fringe subtrees isomorphic to any given tree in uniformly random trees with given vertex degrees. As applications, we also prove corresponding results for random labelled trees with given…
The transition matrix of a Markov chain $(X_k,k\geq 0)$ on a finite or infinite rooted tree is said to be almost upper-directed if, given $X_k$, the node $X_{k+1}$ is either a descendant of $X_k$ or the parent of $X_k$. It is said to be…
We establish necessary and sufficient conditions for consistent root reconstruction in continuous-time Markov models with countable state space on bounded-height trees. Here a root state estimator is said to be consistent if the probability…
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 consider the number of nodes in the levels of unlabelled rooted random trees and show that the stochastic process given by the properly scaled level sizes weakly converges to the local time of a standard Brownian excursion. Furthermore…
Positive dependencies have been compared in the literature under rather strong assumptions such as equality of conditional distributions, exchangeability, or stationarity. We establish supermodular ordering results for distributions that…
A multiplicative cascade can be thought of as a randomization of a measure on the boundary of a tree, constructed from an iid collection of random variables attached to the tree vertices. Given an initial measure with certain regularity…
We consider the problem of uniformly generating a spanning tree, of a connected undirected graph. This process is useful to compute statistics, namely for phylogenetic trees. We describe a Markov chain for producing these trees. For cycle…
In this paper, we study uniform rooted plane trees with given degree sequence. We show, under some natural hypotheses on the degree sequence, that these trees converge toward the so-called Inhomogeneous Continuum Random Tree after…
A branchwise-real tree is a partial order which is a tree and in which every branch is isomorphic to a real interval. I give constructions of such trees which are both rigid (i.e. without non-trivial order-automorphisms) and uniform (in two…