Abstract

Consider a Markov chain (ξv)v∈V∈[k]V(ξ_v)_{v \in V} \in [k]^V on the infinite bb-ary tree T=(V,E)T = (V,E) with irreducible edge transition matrix MM, where b≥2b \geq 2, k≥2k \geq 2 and [k]={1,...,k}[k] = \{1,...,k\}. We denote by LnL_n the level-nn vertices of TT. Assume MM has a real second-largest (in absolute value) eigenvalue λλ with corresponding real eigenvector ν≠0ν\neq 0. Letting σv=νξvσ_v = ν_{ξ_v}, we consider the following root-state estimator, which was introduced by Mossel and Peres (2003) in the context of the "recontruction problem" on trees: \begin{equation*} S_n = (bλ)^{-n} \sum_{x\in L_n} σ_x. \end{equation*} As noted by Mossel and Peres, when bλ2>1bλ^2 > 1 (the so-called Kesten-Stigum reconstruction phase) the quantity SnS_n has uniformly bounded variance. Here, we give bounds on the moment-generating functions of SnS_n and Sn2S_n^2 when bλ2>1bλ^2 > 1. Our results have implications for the inference of evolutionary trees.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.