EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 29 (2025) ESAIM: PS, 29 (2025) 184-203 References
Open Access
Issue
ESAIM: PS
Volume 29, 2025
Page(s) 184 - 203
DOI https://doi.org/10.1051/ps/2025002
Published online 08 April 2025
  1. T. Coolen, A. Annibale and E. Roberts, Generating Random Networks and Graphs. Oxford University Press (2017). ISBN 9780198709893. [CrossRef] [Google Scholar]
  2. W. Evans, C. Kenyon, Y. Peres and L.J. Schulman, Broadcasting on trees and the Ising model. Ann. Appl. Probab. 10 (2000) 410–433. [CrossRef] [MathSciNet] [Google Scholar]
  3. L. Addario-Berry, L. Devroye, G. Lugosi and V. Velona, Broadcasting on random recursive trees. Ann. Appl. Probab. 32 (2022) 497–528. [MathSciNet] [Google Scholar]
  4. C. Desmarais, C. Holmgren and S. Wagner, Broadcasting-induced colorings of preferential attachment trees. Random Structures & Algorithms, 63, (2023) 364–405. [CrossRef] [MathSciNet] [Google Scholar]
  5. A. Sly, Reconstruction for the Potts model. Ann. Probab. 39 (2011) 1365–1406. [MathSciNet] [Google Scholar]
  6. E. Mossel, Reconstruction on trees: beating the second eigenvalue. Ann. Appl. Probab. 11 (2001) 285–300. [CrossRef] [MathSciNet] [Google Scholar]
  7. S. Janson and E. Mossel, Robust reconstruction on trees is determined by the second eigenvalue. Ann. Probab. 32 (2004) 2630–2649. [CrossRef] [MathSciNet] [Google Scholar]
  8. E. Mossel, Survey: information flow on trees, in Graphs, morphisms and statistical physics. Vol. 63 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci. American Mathematical Society, Providence, RI (2004) 155–170. [Google Scholar]
  9. H.A. Harutyunyan and Z. Li, A new construction of broadcast graphs. Discrete Appl. Math. 280 (2020) 144–155. [CrossRef] [MathSciNet] [Google Scholar]
  10. P. Bhabak, H.A. Harutyunyan and S. Tanna, Broadcasting in Harary-like graphs, in 2014 IEEE 17th International Conference on Computational Science and Engineering (2014) 1269–1276. [Google Scholar]
  11. A. Makur, E. Mossel and Y. Polyanskiy, Broadcasting on random directed acyclic graphs. IEEE Trans. Inform. Theory 66 (2020) 780–812. [CrossRef] [MathSciNet] [Google Scholar]
  12. T. AntunoviC, E. Mossel and M.Z. Racz, Coexistence in preferential attachment networks. Combinatorics Probab. Comput. 25 (2016) 797–822. [Google Scholar]
  13. R. Pemantle, A survey of random processes with reinforcement. Probab. Surv. 4 (2007) 9–12. [Google Scholar]
  14. R. Pemantle, Nonconvergence to unstable points in urn models and stochastic approximations. Ann. Probab. 18 (1990) 698–712. [Google Scholar]
  15. S. Janson, Functional limit theorems for multitype branching processes and generalized polya urns. Stoch. Processes Applic. 110 (2004) 177–245. [Google Scholar]
  16. M. Knape and R. Neininger, Polya urns via the contraction method. Combinatorics Probab. Comput. 23 (2014) 1148–1186. [Google Scholar]
  17. L.J. Wei, The generalized Polya’s urn design for sequential medical trials. Ann. Statist. 7 (1979) 291–296. [Google Scholar]
  18. J. Bertoin, Limits of Polya urns with innovations (2022). URL https://arxiv.org/abs/2204.03470. [Google Scholar]
  19. M. Kuba and H.M. Mahmoud, Two-color balanced affine urn models with multiple drawings. Adv. Appl. Math. 90 (2017) 1–26. [Google Scholar]
  20. S. Janson, Random replacements in Polya urns with infinitely many colours. Electron. Commun. Probab. 24 (2019) 1–11. [Google Scholar]
  21. L.-X. Zhang, Convergence of randomized urn models with irreducible and reducible replacement policy. arXiv preprint arXiv:2204.04810 (2022). [Google Scholar]
  22. I. Crimaldi, P.-Y. Louis and I.G. Minelli, An urn model with random multiple drawing and random addition. Stoch. Processes Applic. 147 (2022) 270–299. [Google Scholar]
  23. S. Briend, F. Calvillo and G. Lugosi, Archaeology of random recursive dags and cooper-frieze random networks. Combinatorics, Probab. Comput. 32 (2023) 859–873. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.