Broadcasting on random recursive trees

DOI10.1214/21-AAP1686zbMATH Open1492.60017arXiv2006.11787OpenAlexW4214608920MaRDI QIDQ2117452FDOQ2117452

Authors: Louigi Addario-Berry, Gábor Lugosi, Vasiliki Velona, Luc Devroye 

Publication date: 21 March 2022

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Abstract: We study the broadcasting problem when the underlying tree is a random recursive tree. The root of the tree has a random bit value assigned. Every other vertex has the same bit value as its parent with probability $1-q$ and the opposite value with probability $q$, where $qin[0,1]$. The broadcasting problem consists in estimating the value of the root bit upon observing the unlabeled tree, together with the bit value associated with every vertex. In a more difficult version of the problem, the unlabeled tree is observed but only the bit values of the leaves are observed. When the underlying tree is a uniform random recursive tree, in both variants of the problem we characterize the values of $q$ for which the optimal reconstruction method has a probability of error bounded away from $1/2$. We also show that the probability of error is bounded by a constant times $q$. Two simple reconstruction rules are analyzed in detail. One of them is the simple majority vote, the other is the bit value of the centroid of the tree. Most results are extended to linear preferential attachment trees as well.

Full work available at URL: https://arxiv.org/abs/2006.11787

Recommendations

• Broadcasting on trees and the Ising model.
• scientific article; zbMATH DE number 1380585
• Robust reconstruction on trees is determined by the second eigenvalue.
• scientific article; zbMATH DE number 2046068
• Reconstruction on trees and spin glass transition

zbMATH Keywords

preferential attachmentrandom treesbroadcasting problemuniform attachment

Mathematics Subject Classification ID

Trees (05C05) Combinatorial probability (60C05)

Cites Work

• The jackknife estimate of variance
• Belief propagation, robust reconstruction and optimal recovery of block models
• Concentration inequalities. A nonasymptotic theory of independence
• Random Trees
• Title not available (Why is that?)
• Logarithmic combinatorial structures: A probabilistic approach
• Functional limit theorems for multitype branching processes and generalized Pólya urns.
• Broadcasting on trees and the Ising model.
• Reconstruction on trees: Beating the second eigenvalue
• An Efron-Stein inequality for nonsymmetric statistics
• An Estimate for Concentration Functions
• Rumors in a Network: Who's the Culprit?
• The generalized Polya's urn design for sequential medical trials
• Optimal phylogenetic reconstruction
• Title not available (Why is that?)
• Evolutionary trees and the Ising model on the Bethe lattice: A proof of Steel's conjecture
• Reconstruction on trees and spin glass transition
• Scaling limits and influence of the seed graph in preferential attachment trees
• Reconstruction for the Potts model
• Title not available (Why is that?)
• Robust reconstruction on trees is determined by the second eigenvalue.
• Phase transitions in phylogeny
• Applications of the theory of records in the study of random trees
• The height of increasing trees
• Pólya urns via the contraction method
• Broadcasting on Random Directed Acyclic Graphs
• Finding Adam in random growing trees
• From trees to seeds: on the inference of the seed from large trees in the uniform attachment model
• Finding the seed of uniform attachment trees
• Discrete minimax estimation with trees
• On the centroid of increasing trees
• The recovery of the root of a tree

Cited In (8)

• An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication
• Tree evolution processes for bucket increasing trees
• Archaeology of random recursive dags and Cooper-Frieze random networks
• Inference in balanced community modulated recursive trees
• Broadcasting‐induced colorings of preferential attachment trees
• Broadcasting on Random Directed Acyclic Graphs
• Broadcasting on trees and the Ising model.
• Title not available (Why is that?)

This page was built for publication: Broadcasting on random recursive trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117452)