Moderate deviations of triangle counts -- the lower tail (extended abstract)
From MaRDI portal
Cites work
- A central limit theorem for decomposable random variables with applications to random graphs
- A functional limit theorem for random graphs with applications to subgraph count statistics
- A large deviation result on the number of small subgraphs of a random graph
- An introduction to large deviations for random graphs
- Discrete Malliavin-Stein method: Berry-Esseen bounds for random graphs and percolation
- Gaussian-width gradient complexity, reverse log-Sobolev inequalities and nonlinear large deviations
- Large deviations of subgraph counts for sparse Erdős-Rényi graphs
- Mod- convergence. Normality zones and precise deviations
- Moderate deviations in a random graph and for the spectrum of Bernoulli random matrices
- Moderate deviations of subgraph counts in the Erdős-Rényi random graphs \(G(n,m)\) and \(G(n,p)\)
- Moderate deviations via cumulants
- On the lower tail variational problem for random graphs
- On the variational problem for upper tails in sparse random graphs
- Orthogonal decompositions and functional limit theorems for random graph statistics
- Random subgraph counts and U-statistics: multivariate normal approximation via exchangeable pairs and embedding
- The asymptotic distributions of generalized U-statistics with applications to random graphs
- The infamous upper tail
- The large deviation principle for the Erdős-Rényi random graph
- When are small subgraphs of a random graph normally distributed?
This page was built for publication: Moderate deviations of triangle counts -- the lower tail (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7000375)
