A large deviation principle for block models
From MaRDI portal
Cites work
- A counterexample to the DeMarco-Kahn upper tail conjecture
- A generalization of Hölder's inequality and some probability inequalities
- A large deviation principle for the Erdős-Rényi uniform random graph
- A large deviation result on the number of small subgraphs of a random graph
- Applications of Stein's method for concentration inequalities
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Divide and conquer martingales and the number of triangles in a random graph
- Gaussian-width gradient complexity, reverse log-Sobolev inequalities and nonlinear large deviations
- Graphons, cut norm and distance, couplings and rearrangements
- Large deviation for uniform graphs with given degrees
- Large deviations for random graphs. École d'Été de Probabilités de Saint-Flour XLV -- 2015
- Large deviations of subgraph counts for sparse Erdős-Rényi graphs
- Large networks and graph limits
- Nonlinear large deviation bounds with applications to Wigner matrices and sparse Erdős-Rényi graphs
- Nonlinear large deviations
- On replica symmetry of large deviations in random graphs
- On the upper tail problem for random hypergraphs
- Probability
- Szemerédi's lemma for the analyst
- The deletion method for upper tail estimates
- The infamous upper tail
- The large deviation principle for inhomogeneous Erdős-Rényi random graphs
- The large deviation principle for the Erdős-Rényi random graph
- The missing log in large deviations for triangle counts
- The structure of low-complexity Gibbs measures on product spaces
- Tight upper tail bounds for cliques
- Upper tail for homomorphism counts in constrained sparse random graphs
- Upper tail large deviations for arithmetic progressions in a random set
- Upper Tail Large Deviations of Regular Subgraph Counts in Erdős‐Rényi Graphs in the Full Localized Regime
- Upper tails and independence polynomials in random graphs
- Upper tails for edge eigenvalues of random graphs
- Upper tails for subgraph counts in random graphs
- Upper tails for triangles
This page was built for publication: A large deviation principle for block models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6879461)
