Information flow on trees
type: Item
instance of: scholarly article
title: Information flow on trees
zbMATH Open document ID: 1050.60082
author: Elchanan Mossel
author: Yuval Peres
published in: The Annals of Applied Probability
publication date: 2004-03-21T00:00:00Z
full work available at URL: https://arxiv.org/abs/math/0107033
review text: The authors try to answer the following question: Let \(T\) be a tree network, where each edge acts as an independent copy of a given channel \(M\). Suppose that information is propagated from the root. For which \(T\) and \(M\) the configuration obtained at level \(n\) of \(T\) typically contains significant information on the root variable?
Mathematics Subject Classification ID: 60J80
Mathematics Subject Classification ID: 60K35
Mathematics Subject Classification ID: 60F05
Mathematics Subject Classification ID: 94B99
zbMATH DE Number: 2061203
zbMATH Keywords: tree network
zbMATH Keywords: information flow
reviewed by: V. A. Zagrebnov
MaRDI profile type: Publication
OpenAlex ID: W2017816219
arXiv ID: math/0107033
cites work: Q5674726
cites work: On the purity of the limiting Gibbs state for the Ising model on the Bethe lattice.
cites work: Graph homomorphisms and phase transitions
cites work: Gibbs measures and dismantlable graphs
cites work: Taxonomy with confidence
cites work: Q4023085
cites work: Q4251557
cites work: Q3706275
cites work: Broadcasting on trees and the Ising model.
cites work: On the maximum tolerable noise for reliable computation by formulas
cites work: Remarks on the limiting Gibbs states on a (d+1)-tree
cites work: On the extremality of the disordered state for the Ising model on the Bethe lattice
cites work: Glauber dynamics on trees and hyperbolic graphs
cites work: A Limit Theorem for Multidimensional Galton-Watson Processes
cites work: Additional Limit Theorems for Indecomposable Multidimensional Galton-Watson Processes
cites work: Q4208451
cites work: Random walks and percolation on trees
cites work: Random walk in a random environment and first-passage percolation on trees
cites work: Q4705320
cites work: Reconstruction on trees: Beating the second eigenvalue
cites work: Robust phase transitions for Heisenberg and other models on general trees
cites work: How to share a secret
cites work: Markov random fields on an infinite tree
DOI: 10.1214/AOAP/1060202828
description: scientific article