The root cluster after percolation on preferential attachment trees
EUROCOMB’23
343–348
L. Addario-Berry, L. Devroye, G. Lugosi, and V. Velona, Broadcasting on random recursive trees, Ann. Appl. Probab., 32:497-528, 2022.
https://doi.org/10.1214/21-AAP1686
E. Baur, On a class of random walks with reinforced memory, J. Stat. Phys., 181:772-802, 2020.
https://doi.org/10.1007/s10955-020-02602-3
E. Baur and J. Bertoin, The fragmentation process of an infinite recursive tree and Ornstein-Uhlenbeck type processes, Electron. J. Probab., 20:1-20, 2015.
https://doi.org/10.1214/EJP.v20-3866
S. Businger, The shark random swim, J. Stat. Phys., 172:701-717, 2018.
https://doi.org/10.1007/s10955-018-2062-5
L. Comtet, Advanced combinatorics. The art of finite and infinite expansions, D. Reidel Publishing Co., 1974.
https://doi.org/10.1007/978-94-010-2196-8
C. Desmarais, C. Holmgren, and S. Wagner, Broadcasting-induce colorings of preferential attachment trees, Random Structures & Algorithms, available online at https://doi.org/10.1002/rsa.21142, 42pp., 2023.
https://doi.org/10.1002/rsa.21142
M. Drmota, Random trees: an interplay between combinatorics and probability, Springer Science and Business Media, 2009.
https://doi.org/10.1007/978-3-211-75357-6
P. Flajolet and R. Sedgewick, Analytic Combinatorics, Cambridge University Press, 2009.
https://doi.org/10.1017/CBO9780511801655

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Copyright © 2023 Colin Desmarais, Cecilia Holmgren, Stephan Wagner