The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Broadcasting on trees and the Ising model
Open accessAbstract
Consider a process in which information is transmitted from a given root node on a noisy tree network $T$.We start with an unbiased random bit $R$ at the root of the tree and send it down the edges of $T$.On every edge the bit can be reversed with probability $\varepsilon$, and these errors occur independently. The goal is to reconstruct $R$ from the values which arrive at the $n$th level of the tree. This model has been studied in information theory,genetics and statistical mechanics.We bound the reconstruction probability from above, using the maximum flow on $T$ viewed as a capacitated network, and from below using the electrical conductance of $T$. For general infinite trees, we establish a sharp threshold: the probability of correct reconstruction tends to 1/2 as $n \to \infty$ if $(1 - 2\varepsilon)^2 < p_c(T)$, but the reconstruction probability stays bounded away from ½ if the opposite inequality holds. Here $p_c(T)$ is the critical probability for percolation on $T$; in particular $p_c(T) = 1/b$ for the $b + 1$-regular tree. The asymptotic reconstruction problem is equivalent to purity of the “free boundary” Gibbs state for the Ising model on a tree. The special case of regular trees was solved in 1995 by Bleher, Ruiz and Zagrebnov; our extension to general trees depends on a coupling argument and on a reconstruction algorighm that weights the input bits by the electrical current flow from the root to the leaves.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Toward Defining the Course of Evolution: Minimum Change for a Specific Tree Topology
Fitch, W. M. (1971) · Systematic Biology · doi:10.1093/sysbio/20.4.406 · Cited by 6,492
Probabilistic Logic and the Synthesis of Reliable Organisms from Unreliable Components
von Neumann, J. (1956) · Cited by 1,652
Probabilistic Logics and the Synthesis of Reliable Organisms From Unreliable Components
Neumann, J. V. (1956) · Automata Studies. (AM-34) · doi:10.1515/9781400882618-003 · Cited by 1,456
Gibbs Measures and Phase Transitions
Georgii, H.-O. (2011) · De Gruyter eBooks · doi:10.1515/9783110250329 · Cited by 1,374
Random Walks and Electric Networks
Doyle, P., & Snell, J. (1984) · Carus Mathematical Monographs · doi:10.5948/upo9781614440222 · Cited by 1,061
Theory of statistical inference and information
Vajda, I. (1989) · Medical Entomology and Zoology · Cited by 463
Gibbs States on Countable Sets
Preston, C. J. (1974) · Cambridge University Press eBooks · doi:10.1017/cbo9780511897122 · Cited by 423
Random Walks and Percolation on Trees
Lyons, R. (1990) · The Annals of Probability · doi:10.1214/aop/1176990730 · Cited by 354
Minimum Mutation Fits to a Given Tree
Hartigan, J. A. (1973) · Biometrics · doi:10.2307/2529676 · Cited by 271
Cited by
Information, Physics, and Computation
Mézard, M., & Montanari, A. (2009) · doi:10.1093/acprof:oso/9780198570837.001.0001 · Cited by 1,913
Community Detection and Stochastic Block Models
Abbe, E. (2018) · now publishers, Inc. eBooks · doi:10.1561/9781680834772 · Cited by 544
Reconstruction and estimation in the planted partition model
Mossel, E., Neeman, J., & Sly, A. (2015) · Probability Theory and Related Fields · doi:10.1007/s00440-014-0576-6 · Cited by 301
Classical algorithms and quantum limitations for maximum cut on high-girth graphs
Barak, B., & Marwaha, K. (2021) · arXiv · doi:10.48550/arxiv.2106.05900 · Cited by 19
Classical Algorithms and Quantum Limitations for Maximum Cut on High-Girth Graphs
Barak, B., & Marwaha, K. (2022) · Schloss Dagstuhl – Leibniz-Zentrum für Informatik · doi:10.4230/lipics.itcs.2022.14 · Cited by 19
Metadata
- Authors
- Evans, W., Kenyon, C., Peres, Y., & Schulman, L. J.
- Venue
- The Annals of Applied Probability
- Publisher
- Institute of Mathematical Statistics
- Published
- 2000-05-01
- Volume
- 10
- Issue
- 2
- Pages
- 410-433
- ISSN
- 1050-5164 (ISSN-L)
- OpenAlex
- W1996199671
- Cited by
- 270
- References
- 17
- FWCI
- 9.39
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Broadcasting on trees and the Ising model. https://app.cochat.ai/papers/10.1214/aoap/1019487349
- The paper
- Evans, W., Kenyon, C., Peres, Y., & Schulman, L. J. (2000). Broadcasting on trees and the Ising model. The Annals of Applied Probability. https://doi.org/10.1214/aoap/1019487349
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.