Cover Image

Upper tail bounds for irregular graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Basak, Anirban, Karmakar, Shaibal
Format:	Preprint
Published:	2025
Subjects:	Probability Combinatorics 60C05, 60F10, 05C80
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

A large deviation principle for block models
by: Borgs, Christian, et al.
Published: (2020)

Sparse random graphs with many triangles
by: Chakraborty, Suman, et al.
Published: (2021)

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

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

Typical structure of sparse exponential random graph models
by: Cook, Nicholas A., et al.
Published: (2022)

Upper tails for homomorphism counts in sparse random hypergraphs
by: Cook, Nicholas A., et al.
Published: (2025)

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

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

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

Normal approximation for number of edges in random intersection graphs
by: Rybarczyk, Katarzyna, et al.
Published: (2025)

Diameter and mixing time of the giant component in the percolated hypercube
by: Anastos, Michael, 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)

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

A short proof of a central limit theorem for the order of the giant component and $k$-core
by: Anastos, Michael, et al.
Published: (2025)

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

Local limit theorem for joint subgraph counts
by: Sah, Ashwin, et al.
Published: (2024)

Large deviations of the giant component in scale-free inhomogeneous random graphs
by: Jorritsma, Joost, et al.
Published: (2024)

Marked random graphs with given degree sequence: large deviations on the local topology
by: Baldasso, Rangel, 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)

Higher-Order Graphon Theory: Fluctuations, Degeneracies, and Inference
by: Chatterjee, Anirban, et al.
Published: (2024)

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

Concentration inequalities for Poisson $U$-statistics
by: Bonnet, Gilles, et al.
Published: (2024)

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

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

A novel approach to the giant component fluctuations
by: Corujo, Josué, et al.
Published: (2024)

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

A limit theorem for the total progeny distribution of multi-type branching processes
by: Hoogendijk, Jochem, et al.
Published: (2025)

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

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

On the components of random geometric graphs in the dense limit
by: Penrose, Mathew D., et al.
Published: (2025)

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

Normal approximation for exponential random graphs
by: Fang, Xiao, et al.
Published: (2024)

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

Asymptotics for cliques in scale-free random graphs
by: Daly, Fraser, et al.
Published: (2020)

Conditional central limit theorems for exponential random graphs
by: Fang, Xiao, et al.
Published: (2025)

Central limit theorem for crossings in randomly embedded graphs
by: Arenas-Velilla, Santiago, et al.
Published: (2023)

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