Cover Image

Lower tails for triangles inside the critical window

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Jenssen, Matthew, Perkins, Will, Potukuchi, Aditya, Simkin, Michael
Format:	Preprint
Published:	2024
Subjects:	Probability Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Non-existence probabilities and lower tails in the critical regime via Belief Propagation
by: Jenssen, Matthew, et al.
Published: (2026)

Sampling and counting triangle-free graphs near the critical density
by: Jenssen, Matthew, et al.
Published: (2024)

On the evolution of structure in triangle-free graphs
by: Jenssen, Matthew, et al.
Published: (2023)

On the chromatic number of random triangle-free graphs
by: Mizgerd, Clayton, et al.
Published: (2025)

Large random intersection graphs inside the critical window and triangle counts
by: Wang, Minmin
Published: (2023)

A new lower bound for the Ramsey numbers $R(3,k)$
by: Campos, Marcelo, et al.
Published: (2025)

Searching for (sharp) thresholds in random structures: where are we now?
by: Perkins, Will
Published: (2024)

Limiting distributions of triangle counts in linear preferential attachment models
by: Dey, Partha S., et al.
Published: (2026)

The typical structure of dense claw-free graphs
by: Perkins, Will, et al.
Published: (2025)

Local central limit theorem for triangle counts in sparse random graphs
by: Araújo, Pedro, et al.
Published: (2023)

Upper tails for arithmetic progressions revisited
by: Harel, Matan, et al.
Published: (2024)

On fractional triangle decompositions of random graphs
by: Mahabaduge, Ghaura, et al.
Published: (2025)

Structure of lower tails in sparse random graphs
by: Chin, Byron
Published: (2023)

Interlacing triangles, Schubert puzzles, and graph colorings
by: Gaetz, Christian, et al.
Published: (2024)

Moderate deviations of triangle counts in sparse Erdős-Rényi random graphs $G(n,m)$ and $G(n,p)$
by: Alvarado, José D., et al.
Published: (2023)

Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes
by: Bhamidi, Shankar, et al.
Published: (2020)

Lower bounds for the isoperimetric numbers of random regular graphs
by: Kolesnik, Brett, et al.
Published: (2013)

Lower Bounds for the Probability of a Union via Chordal Graphs
by: Dohmen, Klaus
Published: (2010)

The critical Karp--Sipser core of random graphs
by: Budzinski, Thomas, et al.
Published: (2022)

The critical Karp--Sipser core of Erdős--Rényi random graphs
by: Budzinski, Thomas, et al.
Published: (2024)

Moderate Deviations of Triangle Counts in the Erdős-Rényi Random Graph $G(n,m)$: The Lower Tail
by: Alvarado, José, et al.
Published: (2024)

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

Exponential anticoncentration of the permanent
by: Hunter, Zach, et al.
Published: (2025)

On the number of spanning trees in random regular graphs
by: Greenhill, Catherine, et al.
Published: (2013)

An Unconditional Barrier for Proving Multilinear Algebraic Branching Program Lower Bounds
by: Kush, Deepanshu
Published: (2026)

A central limit theorem for the matching number of a sparse random graph
by: Glasgow, Margalit, et al.
Published: (2024)

Singularity of the k-core of a random graph
by: Ferber, Asaf, et al.
Published: (2021)

Anticoncentration in Ramsey graphs and a proof of the Erdős-McKay conjecture
by: Kwan, Matthew, et al.
Published: (2022)

Geometry of critical discrete structures: percolation on the hierarchical lattice
by: Sen, Sanchayan
Published: (2025)

On the threshold for triangulations inside convex polygons
by: Kolesnik, Brett, et al.
Published: (2025)

The self-dual point of Fortuin--Kasteleyn planar maps is critical
by: Berestycki, Nathanaël, et al.
Published: (2025)

Scaling limits of critical FK-decorated random planar maps with $q=4$
by: Da Silva, William, et al.
Published: (2025)

Hitting time of connectedness in the random hypercube process
by: Diskin, Sahar, et al.
Published: (2024)

Components, large and small, are as they should be II: supercritical percolation on regular graphs of constant degree
by: Diskin, Sahar, et al.
Published: (2024)

Components, large and small, are as they should be I: supercritical percolation on regular graphs of growing degree
by: Diskin, Sahar, et al.
Published: (2024)

Nearly spanning cycle in the percolated hypercube
by: Anastos, Michael, et al.
Published: (2025)

Cycle lengths in the percolated hypercube
by: Anastos, Michael, et al.
Published: (2025)

Supercritical Site Percolation on Regular Graphs
by: Diskin, Sahar, et al.
Published: (2026)

Individual testing is optimal for nonadaptive group testing in the linear regime
by: Aldridge, Matthew
Published: (2018)

The generalized Zagreb index for non-plane and plane recursive trees
by: Feng, Qunqiang, et al.
Published: (2025)