:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Addario-Berry, Louigi, Fontaine, Catherine, Khanfir, Robin, Langevin, Louis-Roy, Têtu, Simone
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Social and Information Networks Probability Statistics Theory 60C05, 05C80, 62M05, 94C15
Online Access:	https://arxiv.org/abs/2411.18614
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)

Critical trees are neither too short nor too fat
by: Addario-Berry, Louigi, et al.
Published: (2023)

The top eigenvalue of uniformly random trees
by: Addario-Berry, Louigi, et al.
Published: (2024)

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

Scaling limits of random graphs
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)

Refined Horton-Strahler numbers I: a discrete bijection
by: Addario-Berry, Louigi, et al.
Published: (2024)

What is The Probability That A Random Graph With A Given Degree Sequence is Connected?
by: Addario-Berry, Louigi, et al.
Published: (2026)

Tight universal bounds on the height times the width of random trees
by: Donderwinkel, Serte, 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)

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

Boosted second moment method in random regular graphs
by: Gerencsér, Balázs, et al.
Published: (2025)

Where do (random) trees grow leaves?
by: Caraceni, Alessandra, et al.
Published: (2024)

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

Logarithmic typical distances in preferential attachment models
by: van der Hofstad, Remco, et al.
Published: (2025)

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

Can the root cluster remain largest forever in random recursive tree percolation?
by: Zheng, Yushu
Published: (2026)

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

The distribution of the maximum protection number in simply generated trees
by: Heuberger, Clemens, et al.
Published: (2023)

Scaling limits of multitype Bienaymé trees
by: Addario-Berry, Louigi, et al.
Published: (2025)

On the number of linear uniform hypergraphs with linear girth constraint
by: Tian, Fang, et al.
Published: (2025)

Asymptotic diameter of preferential attachment model
by: Du, Hang, et al.
Published: (2025)

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

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

Chromatic number and regular subgraphs
by: Janzer, Barnabás, et al.
Published: (2024)

Turán density of cliques of order five in $3$-uniform hypergraphs with quasirandom links
by: Berger, Sören, et al.
Published: (2022)

Trees with flowers: A catalog of integer partition and integer composition trees with their asymptotic analysis
by: Aíza, Ricardo Gómez
Published: (2024)

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

The stable trees revisited
by: Goldschmidt, Christina, et al.
Published: (2025)

Total coloring of regular graphs of girth = degree + 1
by: Dejter, Italo J.
Published: (2024)

The asymptotic rank of adjacency matrices of weighted configuration models over arbitrary fields
by: van der Hofstad, Remco, et al.
Published: (2025)

Catching a robber on a random $k$-uniform hypergraph
by: Erde, Joshua, et al.
Published: (2023)

Total coloring and efficient domination applications to non-Cayley non-Schreier vertex-transitive graphs
by: Dejter, Italo J.
Published: (2020)

A logarithmic bound for the chromatic number of the associahedron
by: Berry, Louigi Addario, et al.
Published: (2018)

Shotgun assembly of random regular graphs
by: Huang, Brice, et al.
Published: (2015)

Burnings of trees and their homologies
by: Muranov, Yuri, et al.
Published: (2026)

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

Maximally probable tree topologies with $r$-furcation
by: Dickey, Emily H., et al.
Published: (2026)

Dense and nondense limits for uniform random intersection graphs
by: Bassino, Frédérique, et al.
Published: (2024)