Cover Image

Extreme local statistics in random graphs: maximum tree extension counts

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Araújo, Pedro, Griffiths, Simon, Šileikis, Matas, Warnke, Lutz
Format:	Preprint
Published:	2023
Subjects:	Probability Combinatorics 05C80, 60G70, 60C05
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

On the concentration of the chromatic number of random graphs
by: Surya, Erlang, et al.
Published: (2022)

Poisson approximation for cycles in the generalised random graph
by: Lienau, Matthias
Published: (2024)

Limit laws for longest edges in empty region graphs
by: Sambale, Holger, et al.
Published: (2026)

The clique chromatic number of sparse random graphs
by: Fernandez V, Manuel, et al.
Published: (2024)

Note on down-set thresholds
by: Warnke, Lutz
Published: (2023)

Ordering and Convergence of Large Degrees in Random Hyperbolic Graphs
by: Gassmann, Loïc
Published: (2024)

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

Two-Point Concentration of the Domination Number of Random Graphs
by: Bohman, Tom, et al.
Published: (2024)

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

Extremes of the zero-average Gaussian Free Field on random regular graphs
by: Hartung, Lisa, et al.
Published: (2025)

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

Tight universal bounds on the height times the width of random trees
by: Donderwinkel, Serte, et al.
Published: (2024)

On tail inference in scale-free inhomogeneous random graphs
by: Cirkovic, Daniel, et al.
Published: (2024)

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

The degree-restricted random process is far from uniform
by: Molloy, Michael, et al.
Published: (2022)

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

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

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

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

The spread of fire on a random multigraph
by: Goldschmidt, Christina, et al.
Published: (2017)

Large and moderate deviations in Poisson navigations
by: Ghosh, Partha Pratim, et al.
Published: (2024)

Gaussian fluctuations of generalized $U$-statistics and subgraph counting in the binomial random-connection model
by: Liu, Qingwei, et al.
Published: (2025)

Graph connectivity with fixed endpoints in the random-connection model
by: Liu, Qingwei, et al.
Published: (2023)

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

Sharp Thresholds for Factors in Random Graphs
by: Burghart, Fabian, et al.
Published: (2024)

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

The multi-level friendship paradox for sparse random graphs
by: Hazra, Rajat Subhra, et al.
Published: (2025)

The phase transition in bounded-size Achlioptas processes
by: Riordan, Oliver, et al.
Published: (2017)

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

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

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

Normal approximation for subgraph count in random hypergraphs
by: Michalczuk, Wojciech, et al.
Published: (2024)

Multivariate Regular Variation of Preferential Attachment Models
by: Janßen, Anja, et al.
Published: (2023)

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

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

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

The law of the circumference of sparse binomial random graphs
by: Anastos, Michael, et al.
Published: (2025)

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