Cover Image

Tight universal bounds on the height times the width of random trees

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Donderwinkel, Serte, Khanfir, Robin
Format:	Preprint
Published:	2024
Subjects:	Probability Combinatorics 60C05, 60J80, 05C05
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The largest common subtree of two random trees
by: Angel, Omer, et al.
Published: (2025)

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)

Random friend trees
by: Berry, Louigi Addario, et al.
Published: (2024)

Fluctuations of the Horton-Strahler number of stable Galton-Watson trees
by: Khanfir, Robin
Published: (2024)

The Horton-Strahler number of Galton-Watson trees with possibly infinite variance
by: Khanfir, Robin
Published: (2023)

Asymptotic height of Plancherel random trees
by: Zhang, Shengjun
Published: (2026)

The number and structure of connected graphs with a fixed degree sequence
by: Bell, Sasha, et al.
Published: (2026)

Asymptotic normality for general subtree counts in conditioned Galton--Watson trees
by: Rakotoniaina, Fameno, et al.
Published: (2026)

Limits of chordal graphs with bounded tree-width
by: Castellví, Jordi, et al.
Published: (2023)

Discrete snakes with globally centered displacements
by: Addario-Berry, Louigi, et al.
Published: (2025)

The largest subcritical component in inhomogeneous random graphs of preferential attachment type
by: Mörters, Peter, et al.
Published: (2025)

A Galton-Watson tree approach to local limits of permutations avoiding a pattern of length three
by: Park, Jungeun, et al.
Published: (2024)

Tournaments and random walks
by: Donderwinkel, Serte, et al.
Published: (2024)

Universal diameter bounds for random graphs with given degrees
by: Addario-Berry, Louigi, et al.
Published: (2025)

The Horton-Strahler Number of Conditioned Galton-Watson Trees
by: Brandenberger, Anna M., et al.
Published: (2020)

Local limit of the random degree constrained process
by: Ráth, Balázs, et al.
Published: (2024)

Extreme local statistics in random graphs: maximum tree extension counts
by: Araújo, Pedro, et al.
Published: (2023)

Scaling limits of random graphs
by: Addario-Berry, Louigi, et al.
Published: (2024)

Majority dynamics on sparse random graphs
by: Chakraborti, Debsoumya, et al.
Published: (2021)

The stable trees revisited
by: Goldschmidt, Christina, 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)

Isomorphisms between dense random graphs
by: Surya, Erlang, et al.
Published: (2023)

Genealogies of records of stochastic processes with stationary increments as unimodular trees
by: Baccelli, François, et al.
Published: (2024)

The height of the infection tree
by: Kammerer, Emmanuel, et al.
Published: (2025)

Upper tail bounds for irregular graphs
by: Basak, Anirban, et al.
Published: (2025)

A tail bound for cumulant series for complex functions of independent random variables
by: Isaev, Mikhail
Published: (2025)

On the upper tail of star counts in random graphs
by: Akhmejanova, Margarita, et al.
Published: (2025)

Sinaĭ excursions: An analogue of Sparre Andersen's formula for the area process of a random walk
by: Donderwinkel, Serte, et al.
Published: (2024)

On the jump of the cover time in random geometric graphs
by: Martinez, Carlos, et al.
Published: (2025)

Isomorphisms between random $d$-hypergraphs
by: Lenoir, Théo
Published: (2024)

Upper tails of subgraph counts in directed random graphs
by: Park, Jiyun
Published: (2024)

The distance to the border of a random tree
by: Maciá, Víctor J.
Published: (2022)

Hitting times in the stochastic block model
by: Ottolini, Andrea
Published: (2024)

Condensation in subcritical Cauchy Bienaymé trees
by: Kortchemski, Igor, et al.
Published: (2025)

A note on Two-Point Concentration of the Independence Number of $G_{n,m}$
by: Bohman, Tom, et al.
Published: (2024)

On the Deepest Cycle of a Random Mapping
by: Mutafchiev, Ljuben, et al.
Published: (2023)

Large Components and Trees of Random Mappings
by: Mutafchiev, Ljuben, 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)

Monochromatic Subgraphs in Randomly Colored Dense Multiplex Networks
by: Andrade, Mauricio Daros, et al.
Published: (2025)