Related papers: Growing Self-Similar Markov Trees

We give examples of minimal extensions of the simplest SU(5) SUSY-GUT in which all squarks and sleptons of a family have different tree level masses at the unification scale. This phenomenon is general; it occurs when the quarks and leptons…

Let $t$ be a rooted tree and $n_i(t)$ the number of nodes in $t$ having $i$ children. The degree sequence $(n_i(t),i\geq 0)$ of $t$ satisfies $\sum_{i\ge 0} n_i(t)=1+\sum_{i\ge 0} in_i(t)=|t|$, where $|t|$ denotes the number of nodes in…

We introduce a non-increasing tree growth process $((T_n,\sigma_n),\, n\ge 1)$, where $T_n$ is a rooted labeled tree on $n$ vertices and ${\sigma}_n$ is a permutation of the vertex labels. The construction of $(T_{n},{\sigma}_n)$ from…

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…

Trees in Brownian excursions have been studied since the late 1980s. Forests in excursions of Brownian motion above its past minimum are a natural extension of this notion. In this paper we study a forest-valued Markov process which…

A well-known open problem on the behavior of optimal paths in random graphs in the strong disorder regime, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade [31,32,38,70] is as…

We consider so-called discrete snakes obtained from size-conditioned critical Bienaym\'e-Galton-Watson trees by assigning to each node a random spatial position in such a way that the increments along each edge are i.i.d. When the offspring…

Consider the minimum spanning tree (MST) of the complete graph with n vertices, when edges are assigned independent random weights. Endow this tree with the graph distance renormalized by n^{1/3} and with the uniform measure on its…

Ensembles of quantum chaotic systems are expected to exhibit energy eigenvalues with random-matrix-like level repulsion between pairs of energies separated by less than the inverse Thouless time. Recent research has shown that exact and…

We consider a time-continuous branching random walk on a one-dimensional lattice on which there is one center (lattice point) of particle generation, called branching source. The generation of particles in the branching source is described…

We study a model of random binary trees grown "by the leaves" in the style of Luczak and Winkler. If $\tau_n$ is a uniform plane binary tree of size $n$, Luczak and Winkler, and later explicitly Caraceni and Stauffer, constructed a measure…

In [Ald00], Aldous investigates a symmetric Markov chain on cladograms and gives bounds on its mixing and relaxation times. The latter bound was sharpened in [Sch02]. In the present paper we encode cladograms as binary, algebraic measure…

An inequality of K. Marton shows that the joint distribution of a Markov chain with uniformly contracting transition kernels exhibits concentration. We prove an analogous inequality for broadcast models on finite trees. We use this…

We give a new, simple construction of the $\alpha$-stable tree for $\alpha \in (1,2]$. We obtain it as the closure of an increasing sequence of $\mathbb{R}$-trees inductively built by gluing together line-segments one by one. The lengths of…

Given a rooted tree $T$ on $n$ non-root leaves with colored and zeroed nodes, we construct a linear space $L_T$ of $n\times n$ symmetric matrices with constraints determined by the combinatorics of the tree. When $L_T$ represents the…

In this paper we consider two aspects of the inverse problem of how to construct merge trees realizing a given barcode. Much of our investigation exploits a recently discovered connection between the symmetric group and barcodes in general…

There are numerous randomized algorithms to generate spanning trees in a given ambient graph; several target the uniform distribution on trees (UST), while in practice the fastest and most frequently used draw random weights on the edges…

We consider a discrete-time Markov chain, called fragmentation process, that describes a specific way of successively removing objects from a linear arrangement. The process arises in population genetics and describes the ancestry of the…

We propose a generalized model for uniform recursive tree (URT) by introducing an imperfect growth process, which may generate disconnected components (clusters). The model undergoes an interesting phase transition from a singly connected…

Scattering amplitudes of the spin-4/3 fractional superstring are shown to satisfy spurious state decoupling and cyclic symmetry (duality) at tree-level in the string perturbation expansion. This fractional superstring is characterized by…