Random friend trees
Fuente:
arXiv
Saved in:
| Main Authors: | Berry, Louigi Addario, Briend, Simon, Devroye, Luc, Donderwinkel, Serte, Kerriou, Céline, Lugosi, Gábor |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Random trees have height $O(\sqrt{n})$
by: Addario-Berry, Louigi, et al.
Published: (2022)
by: Addario-Berry, Louigi, et al.
Published: (2022)
Critical trees are neither too short nor too fat
by: Addario-Berry, Louigi, et al.
Published: (2023)
by: Addario-Berry, Louigi, et al.
Published: (2023)
Discrete snakes with globally centered displacements
by: Addario-Berry, Louigi, et al.
Published: (2025)
by: Addario-Berry, Louigi, et al.
Published: (2025)
Tight universal bounds on the height times the width of random trees
by: Donderwinkel, Serte, et al.
Published: (2024)
by: Donderwinkel, Serte, et al.
Published: (2024)
The largest common subtree of two random trees
by: Angel, Omer, et al.
Published: (2025)
by: Angel, Omer, et al.
Published: (2025)
The top eigenvalue of uniformly random trees
by: Addario-Berry, Louigi, et al.
Published: (2024)
by: Addario-Berry, Louigi, et al.
Published: (2024)
Scaling limits of random graphs
by: Addario-Berry, Louigi, et al.
Published: (2024)
by: Addario-Berry, Louigi, et al.
Published: (2024)
Universal diameter bounds for random graphs with given degrees
by: Addario-Berry, Louigi, et al.
Published: (2025)
by: Addario-Berry, Louigi, et al.
Published: (2025)
What is The Probability That A Random Graph With A Given Degree Sequence is Connected?
by: Addario-Berry, Louigi, et al.
Published: (2026)
by: Addario-Berry, Louigi, et al.
Published: (2026)
The Horton-Strahler Number of Conditioned Galton-Watson Trees
by: Brandenberger, Anna M., et al.
Published: (2020)
by: Brandenberger, Anna M., et al.
Published: (2020)
The number and structure of connected graphs with a fixed degree sequence
by: Bell, Sasha, et al.
Published: (2026)
by: Bell, Sasha, et al.
Published: (2026)
The stable trees revisited
by: Goldschmidt, Christina, et al.
Published: (2025)
by: Goldschmidt, Christina, et al.
Published: (2025)
Genealogies of records of stochastic processes with stationary increments as unimodular trees
by: Baccelli, François, et al.
Published: (2024)
by: Baccelli, François, et al.
Published: (2024)
Local limit of the random degree constrained process
by: Ráth, Balázs, et al.
Published: (2024)
by: Ráth, Balázs, et al.
Published: (2024)
Asymptotic normality for general subtree counts in conditioned Galton--Watson trees
by: Rakotoniaina, Fameno, et al.
Published: (2026)
by: Rakotoniaina, Fameno, et al.
Published: (2026)
Fluctuations of the Horton-Strahler number of stable Galton-Watson trees
by: Khanfir, Robin
Published: (2024)
by: Khanfir, Robin
Published: (2024)
Condensation in subcritical Cauchy Bienaymé trees
by: Kortchemski, Igor, et al.
Published: (2025)
by: Kortchemski, Igor, et al.
Published: (2025)
Network evolution with self-reinforcement
by: Bhamidi, Shankar, et al.
Published: (2026)
by: Bhamidi, Shankar, et al.
Published: (2026)
A Galton-Watson tree approach to local limits of permutations avoiding a pattern of length three
by: Park, Jungeun, et al.
Published: (2024)
by: Park, Jungeun, et al.
Published: (2024)
Asymptotic height of Plancherel random trees
by: Zhang, Shengjun
Published: (2026)
by: Zhang, Shengjun
Published: (2026)
The Horton-Strahler number of Galton-Watson trees with possibly infinite variance
by: Khanfir, Robin
Published: (2023)
by: Khanfir, Robin
Published: (2023)
Scaling limits of multitype Bienaymé trees
by: Addario-Berry, Louigi, et al.
Published: (2025)
by: Addario-Berry, Louigi, et al.
Published: (2025)
Refined Horton-Strahler numbers I: a discrete bijection
by: Addario-Berry, Louigi, et al.
Published: (2024)
by: Addario-Berry, Louigi, et al.
Published: (2024)
Sampling schemes of multitype continuous-time Bienaymé-Galton-Watson trees and limiting critical genealogies
by: Hernández, Osvaldo Angtuncio, et al.
Published: (2025)
by: Hernández, Osvaldo Angtuncio, et al.
Published: (2025)
The largest subcritical component in inhomogeneous random graphs of preferential attachment type
by: Mörters, Peter, et al.
Published: (2025)
by: Mörters, Peter, et al.
Published: (2025)
Optimal root recovery for uniform attachment trees and $d$-regular growing trees
by: Addario-Berry, Louigi, et al.
Published: (2024)
by: Addario-Berry, Louigi, et al.
Published: (2024)
The multi-level friendship paradox for sparse random graphs
by: Hazra, Rajat Subhra, et al.
Published: (2025)
by: Hazra, Rajat Subhra, et al.
Published: (2025)
Tournaments and random walks
by: Donderwinkel, Serte, et al.
Published: (2024)
by: Donderwinkel, Serte, et al.
Published: (2024)
The height of the infection tree
by: Kammerer, Emmanuel, et al.
Published: (2025)
by: Kammerer, Emmanuel, et al.
Published: (2025)
To see the forest for the trees: On the infinite divisibility of unlabeled forests
by: Bassan, Michal, et al.
Published: (2025)
by: Bassan, Michal, et al.
Published: (2025)
Monochromatic Subgraphs in Randomly Colored Dense Multiplex Networks
by: Andrade, Mauricio Daros, et al.
Published: (2025)
by: Andrade, Mauricio Daros, et al.
Published: (2025)
Extreme local statistics in random graphs: maximum tree extension counts
by: Araújo, Pedro, et al.
Published: (2023)
by: Araújo, Pedro, et al.
Published: (2023)
Explosion and non-explosion in pure birth Crump--Mode--Jagers branching processes
by: Galganov, Oleksii, et al.
Published: (2026)
by: Galganov, Oleksii, et al.
Published: (2026)
Approximating inter-point distances in directed Bernoulli graphs
by: Barbour, A. D., et al.
Published: (2026)
by: Barbour, A. D., et al.
Published: (2026)
Existence of critical tiltings and local limits of general size-conditioned Bienaymé-Galton-Watson multitype trees
by: Poudevigne, Rémy, et al.
Published: (2025)
by: Poudevigne, Rémy, et al.
Published: (2025)
Can the root cluster remain largest forever in random recursive tree percolation?
by: Zheng, Yushu
Published: (2026)
by: Zheng, Yushu
Published: (2026)
Limits of chordal graphs with bounded tree-width
by: Castellví, Jordi, et al.
Published: (2023)
by: Castellví, Jordi, et al.
Published: (2023)
Binary Galton-Watson trees with mutations
by: Huang, Qiao, et al.
Published: (2025)
by: Huang, Qiao, et al.
Published: (2025)
On the Deepest Cycle of a Random Mapping
by: Mutafchiev, Ljuben, et al.
Published: (2023)
by: Mutafchiev, Ljuben, et al.
Published: (2023)
Large Components and Trees of Random Mappings
by: Mutafchiev, Ljuben, et al.
Published: (2025)
by: Mutafchiev, Ljuben, et al.
Published: (2025)
Similar Items
-
Random trees have height $O(\sqrt{n})$
by: Addario-Berry, Louigi, et al.
Published: (2022) -
Critical trees are neither too short nor too fat
by: Addario-Berry, Louigi, et al.
Published: (2023) -
Discrete snakes with globally centered displacements
by: Addario-Berry, Louigi, et al.
Published: (2025) -
Tight universal bounds on the height times the width of random trees
by: Donderwinkel, Serte, et al.
Published: (2024) -
The largest common subtree of two random trees
by: Angel, Omer, et al.
Published: (2025)