Related papers: Reconstruction on Trees: Exponential Moment Bounds…

For every sufficiently well-behaved function $g:\mathbb{R}_{\ge 0}\rightarrow\mathbb{R}_{\ge 0}$ that grows at least linearly and at most exponentially we construct a tree $T$ of uniform volume growth $g$, that is, $$C_1\cdot g(r/4)\le…

Let $K$ be a self-similar set satisfying the open set condition. Following Kaimanovich's elegant idea, it has been proved that on the symbolic space $X$ of $K$ a natural augmented tree structure ${\mathfrak E}$ exists; it is hyperbolic, and…

We observe $n$ sequences at each of $m$ sites, and assume that they have evolved from an ancestral sequence that forms the root of a binary tree of known topology and branch lengths, but the sequence states at internal nodes are unknown.…

A famous result in renewal theory is the Central Limit Theorem for renewal processes. As in applications usually only observations from a finite time interval are available, a bound on the Kolmogorov distance to the normal distribution is…

We study a model of random weighted uniform spanning trees on the complete graph with $n$ vertices, where each edge is assigned a weight of $n^{1+\gamma}$ with probability $1/n$ and $1$ otherwise. Whenever $\gamma$ is large enough, we prove…

A general formulation is presented for continuum scaling limits of stochastic spanning trees. A spanning tree is expressed in this limit through a consistent collection of subtrees, which includes a tree for every finite set of endpoints in…

Let $T$ be a finite tree with leaf set $\dO$ as the boundary and let $\lambda_2$ be the first nontrivial Steklov eigenvalue. Let $D$ and $\ell$ be the maximum vertex degree and the number of leaves, respectively. Motivated by the spectral…

We consider a stochastic image restoration model proposed by A. Gibbs (2004), and give an upper bound on the time it takes for a Markov chain defined by this model to be \epsilon - close in total variation to equilibrium. We use Gibbs'…

Let $T$ be a tree with induced partial order $\preceq$. We investigate centered Gaussian processes $X=(X_t)_{t\in T}$ represented as $$ X_t=\sigma(t)\sum_{v \preceq t}\alpha(v)\xi_v $$ for given weight functions $\alpha$ and $\sigma$ on $T$…

Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given `far away' observations. Several theoretical results (and simple algorithms) are available when…

In this work we investigate a class of random walks that interacts with its environment called Tree Builder Random Walk (TBRW). In our settings, at each step, the walker adds a random number of vertices to its position sampled according to…

We consider renewal-type processes whose positive inter-renewal times may be dependent, non-identically distributed, and may have mixed distributions. We introduce a generalised intensity measure extending the classical hazard-rate…

The set of all permutations with $n$ symbols is a symmetric group denoted by $S_n$. A transposition tree, $T$, is a spanning tree over its $n$ vertices $V_T=${$1, 2, 3, \ldots n$} where the vertices are the positions of a permutation $\pi$…

We study the low-degree hardness of broadcasting on trees. Broadcasting on trees has been extensively studied in statistical physics, in computational biology in relation to phylogenetic reconstruction and in statistics and computer science…

Let $\{X_n\}_{n\ge0}$ be a $V$-geometrically ergodic Markov chain. Given some real-valued functional $F$, define $M_n(\alpha):=n^{-1}\sum_{k=1}^nF(\alpha,X_{k-1},X_k)$, $\alpha\in\mathcal{A}\subset \mathbb {R}$. Consider an $M$ estimator…

Let $A$ be a commutative $k$-algebra over a field of $k$ and $\Xi$ a linear operator defined on $A$. We define a family of $A$-valued invariants $\Psi$ for finite rooted forests by a recurrent algorithm using the operator $\Xi$ and show…

Consider Bernoulli bond percolation on a locally finite, connected graph $G$ and let $p_{\mathrm{cut}}$ be the threshold corresponding to a "first-moment method" lower bound. Kahn (\textit{Electron.\ Comm.\ Probab.\ Volume 8, 184-187.}…

The ancestral maximum-likelihood and phylogeography problems are two fundamental problems involving evolutionary studies. The ancestral maximum-likelihood problem involves identifying a rooted tree alongside internal node sequences that…

We fix $d \geq 2$ and denote $\mathcal S$ the semi-group of $d \times d$ matrices with non negative entries. We consider a sequence $(A_n, B_n)_{n \geq 1} $ of i. i. d. random variables with values in $\mathcal S\times \mathbb R_+^d$ and…

Some, but not all processes of the form $M_t=\exp(-\xi_t)$ for a pure-jump subordinator $\xi$ with Laplace exponent $\Phi$ arise as residual mass processes of particle 1 (tagged particle) in Bertoin's partition-valued exchangeable…