arXiv (All)
open access
Robust Reconstruction on Trees with a Growing Alphabet
We study robust reconstruction for the \(q\)-state Potts broadcast process on a Galton-Watson tree in the growing-alphabet regime \(q\to\infty\), with boundary depth growing sufficiently quickly in relation to \(q\). We show that, in the regime \(dλ>1\), where \(d\) is the expected number of offspri
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Dynamical Gibbs-non-Gibbs transitions for finite-alphabet models on trees#609226
- The graph reconstruction number#490175
- Improved lower bounds for decomposable randomized encoding#1011729
- Improved lower bounds for decomposable randomized encoding#965355
- Toward a Characterization of Simulation Between Arithmetic Theories#1155182
Record · ID 1117975
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive