Large deviation for uniform graphs with given degrees

Cites Work

Title not available (Why is that?)
Concentration inequalities. A nonasymptotic theory of independence
Updating the Inverse of a Matrix
Title not available (Why is that?)
Estimating and understanding exponential random graph models
Title not available (Why is that?)
Random graphs with a given degree sequence
Large deviations techniques and applications.
A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
Title not available (Why is that?)
Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
Title not available (Why is that?)
A sequential importance sampling algorithm for generating random graphs with prescribed degrees
Asymptotic enumeration by degree sequence of graphs of high degree
Multipodal structure and phase transitions in large constrained graphs
Large deviations and exact asymptotics for constrained exponential random graphs
Nonlinear large deviations
Phase transitions in a complex network
On replica symmetry of large deviations in random graphs
Phase transitions in exponential random graphs
On the asymptotics of constrained exponential random graphs
On the variational problem for upper tails in sparse random graphs
The large deviation principle for the Erdős-Rényi random graph
Consistent nonparametric estimation for heavy-tailed sparse graphs
A large deviation principle for the Erdős-Rényi uniform random graph
Upper tail for homomorphism counts in constrained sparse random graphs
The number of graphs and a random graph with a given degree sequence
Large deviations for random graphs. École d'Été de Probabilités de Saint-Flour XLV -- 2015
Gaussian-width gradient complexity, reverse log-Sobolev inequalities and nonlinear large deviations
Ensemble equivalence for dense graphs
Upper tails and independence polynomials in random graphs
Bipodal Structure in Oversaturated Random Graphs
Phases in large combinatorial systems
The phases of large networks with edge and triangle constraints
Large deviations of subgraph counts for sparse Erdős-Rényi graphs
Regular graphs with many triangles are structured
A counterexample to the DeMarco‐Kahn upper tail conjecture

Cited In (5)

On Sums of Independent Random Variables with Unbounded Variance and Estimating the Average Degree in a Graph
The large deviation principle for inhomogeneous Erdős-Rényi random graphs
A sample-path large deviation principle for dynamic Erdős-Rényi random graphs
Large deviation for uniform graphs with given degrees
Large deviation principle for the maximal eigenvalue of inhomogeneous Erdős-Rényi random graphs

This page was built for publication: Large deviation for uniform graphs with given degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170378)