arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0406447math.PRmath.COmath.SPmath.STstat.TH
收藏

树上的鲁棒重建由第二个eigenvalue确定

Robust reconstruction on trees is determined by the second eigenvalue

Svante Janson, Elchanan Mossel

摘要:

考虑一个根为ρ的无限树T=(V,E)上的马尔可夫链。在这样的链中,一旦选择了初始根状态σ(ρ),每个顶点通过应用马尔可夫转移规则(并且所有这些应用都是独立的)从其父节点中迭代地选择其状态。设μ_j表示σ(ρ)= j的结果测度,结果测度μ_j定义在配置σ=(σ(x))_{x \in V} \in A^V上,其中A是某个有限集.设μ_j^n表示μ对由变量σ(x)生成的σ-代数的限制,其中x与ρ的距离正好为n。设α_n= max_{i,j\in A} d_{TV}(μ_i^n,μ_j^n),其中d_{TV}表示全变差距离,如果lim inf_{n\to\infty} α_n>0,我们说重建问题是可解的.重建可解性大致意味着树的第n层包含关于树的根的非零信息量,作为n \to \infty。本文研究了鲁棒重建问题。设ν是A上的非退化分布,ε>0.设σ是根据μ_j^n选择的,σ'是通过对每个节点独立地设σ(v)= σ'(v)以概率1-ε从σ中获得的,否则σ '(v)是来自ν的独立样本。我们用μ_j^n[ν,ε]表示在ε '上的结果测度。测度μ_j^n[ν,ε]是测度μ_j^n的扰动。

英文摘要:

Consider a Markov chain on an infinite tree T=(V,E) rooted at ρ. In such a chain, once the initial root state σ(ρ) is chosen, each vertex iteratively chooses its state from the one of its parent by an application of a Markov transition rule (and all such applications are independent). Let μ_j denote the resulting measure for σ(ρ)=j. The resulting measure μ_j is defined on configurations σ=(σ(x))_{x\in V}\in A^V, where A is some finite set. Let μ_j^n denote the restriction of μto the sigma-algebra generated by the variables σ(x), where x is at distance exactly n from ρ. Letting α_n=max_{i,j\in A}d_{TV}(μ_i^n,μ_j^n), where d_{TV} denotes total variation distance, we say that the reconstruction problem is solvable if lim inf_{n\to\infty}α_n>0. Reconstruction solvability roughly means that the nth level of the tree contains a nonvanishing amount of information on the root of the tree as n\to\infty. In this paper we study the problem of robust reconstruction. Let νbe a nondegenerate distribution on A and ε>0. Let σbe chosen according to μ_j^n and σ' be obtained from σby letting for each node independently, σ(v)=σ'(v) with probability 1-εand σ'(v) be an independent sample from νotherwise. We denote by μ_j^n[ν,ε] the resulting measure on σ'. The measure μ_j^n[ν,ε] is a perturbation of the measure μ_j^n.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑