Broadcasting in random recursive DAGs

DOI10.1051/PS/2025002MaRDI QIDQ6960463zbMATH OpenFDO

Authors Simon Briend, Luc Devroye, Gábor Lugosi

Publication date 14 July 2025

Published in European Series in Applied and Industrial Mathematics (ESAIM): Probability and Statistics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

broadcasting problemnetwork archaeologyrandom recursive DAGs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Cites work

• scientific article; zbMATH DE number 2151257 (Why is no real title available?)
• A new construction of broadcast graphs
• A survey of random processes with reinforcement
• An urn model with random multiple drawing and random addition
• Archaeology of random recursive dags and Cooper-Frieze random networks
• Broadcasting on Random Directed Acyclic Graphs
• Broadcasting on random recursive trees
• Broadcasting on trees and the Ising model.
• Broadcasting‐induced colorings of preferential attachment trees
• Coexistence in preferential attachment networks
• Functional limit theorems for multitype branching processes and generalized Pólya urns.
• Generating Random Networks and Graphs
• Nonconvergence to unstable points in urn models and stochastic approximations
• Pólya urns via the contraction method
• Random replacements in Pólya urns with infinitely many colours
• Reconstruction for the Potts model
• Reconstruction on trees: Beating the second eigenvalue
• Robust reconstruction on trees is determined by the second eigenvalue.
• The generalized Polya's urn design for sequential medical trials
• Two-color balanced affine urn models with multiple drawings

This page was built for publication: Broadcasting in random recursive DAGs

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