Optimal graphons in the edge-2star model
From MaRDI portal
Cites work
- A large deviation principle for the Erdős-Rényi uniform random graph
- Bipodal structure in oversaturated random graphs
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Estimating and understanding exponential random graph models
- Existence of a symmetric bipodal phase in the edge-triangle model
- Finitely forcible graphons
- Large deviations for random graphs. École d'Été de Probabilités de Saint-Flour XLV -- 2015
- Large networks and graph limits
- Limits of dense graph sequences
- Moderate deviations in cycle count
- Moments of two-variable functions and the uniqueness of graph limits
- Multipodal structure and phase transitions in large constrained graphs
- On the variational problem for upper tails in sparse random graphs
- Phase transitions in a complex network
- Singularities in the entropy of asymptotically large simple graphs
- Spectral edge in sparse random graphs: upper and lower tail large deviations
- Szemerédi's lemma for the analyst
- The large deviation principle for the Erdős-Rényi random graph
- Typical large graphs with given edge and triangle densities
- Upper tails and independence polynomials in random graphs
- Upper tails for edge eigenvalues of random graphs
This page was built for publication: Optimal graphons in the edge-2star model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6837980)
