arXiv (All)
open access
A first order phase transition for lower tails in sparse random graphs
We study the graphon variational problem that governs lower tail large deviations of the number of copies of a fixed nonbipartite graph $H$ in a sparse Erdős--Rényi random graph. Our main new insight is that any non-constant minimizer of the variational problem exhibits a discontinuous jump away fro
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Local large deviations for triangles in sparse random graphs#1036279
- Nonlinear lower-tail large deviations at criticality#1234600
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph#818668
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph#808676
- Integrality Gap Bounds for the Goemans-Linial SDP on Finite Abelian Cayley Graphs#972296
Record · ID 1402845
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive