A uniform k-dag generalizes the uniform random recursive tree by picking k parents uniformly at random from the existing nodes. It starts with k "roots". Each of the k roots is assigned a bit. These bits are propagated by a noisy channel. The parents' bits are flipped with probability p, and a majority vote is taken. When all nodes have received their bits, the k-dag is shown without identifying the roots. The goal is to estimate the majority bit among the roots. We identify the threshold for p as a function of k below which the majority rule among all nodes yields an error c + o(1) with c < 1/2. Above the threshold the majority rule errs with probability 1/2 + o(1).
(EDP Sciences, 2025) Briend, Simon; Devroye, Luc; Lugosi, Gábor
We collect and process your personal information for the following purposes: Authentication, Preferences, Acknowledgement and Statistics. To learn more, please read our privacy policy.
