Reconstruction/Non-reconstruction Thresholds for Colourings of General Galton-Watson Trees
Charilaos Efthymiou

TL;DR
This paper investigates the reconstruction thresholds for coloring models on Galton-Watson trees with general offspring distributions, extending known results from regular trees to more complex, probabilistic tree structures.
Contribution
It generalizes the reconstruction threshold analysis from regular trees to Galton-Watson trees with arbitrary offspring distributions, linking thresholds to offspring distribution concentration properties.
Findings
Reconstruction thresholds are derived for a wide family of offspring distributions.
Threshold for distributions with expected offspring d is d/ln(d) under weaker concentration conditions.
Results imply thresholds for coloring on G(n,d/n) graphs based on Galton-Watson tree analysis.
Abstract
The broadcasting models on trees arise in many contexts such as discrete mathematics, biology statistical physics and cs. In this work, we consider the colouring model. A basic question here is whether the root's assignment affects the distribution of the colourings at the vertices at distance h from the root. This is the so-called "reconstruction problem". For a d-ary tree it is well known that d/ln (d) is the reconstruction threshold. That is, for k=(1+eps)d/ln(d) we have non-reconstruction while for k=(1-eps)d/ln(d) we have. Here, we consider the largely unstudied case where the underlying tree is chosen according to a predefined distribution. In particular, our focus is on the well-known Galton-Watson trees. This model arises naturally in many contexts, e.g. the theory of spin-glasses and its applications on random Constraint Satisfaction Problems (rCSP). The aforementioned study…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · Markov Chains and Monte Carlo Methods · Data Management and Algorithms
