Large deviation principles for graphon sampling

DOI10.1214/26-EJP1512MaRDI QIDQ7230551zbMATH OpenFDO

Authors Jan Grebík, Oleg Pikhurko

Publication date 20 April 2026

Published in Electronic Journal of Probability (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://projecteuclid.org/journals/electronic-journal-of-probability/volume-31/issue-none/Large-deviation-principles-for-graphon-sampling/10.1214/26-EJP1512.full

zbMATH Keywords

stochastic block modelgraphonlarge deviation principleinhomogeneous random graph

Mathematics Subject Classification ID

Large deviations (60F10) Random graphs (graph-theoretic aspects) (05C80) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites work

• scientific article; zbMATH DE number 6675450 (Why is no real title available?)
• scientific article; zbMATH DE number 3128672 (Why is no real title available?)
• scientific article; zbMATH DE number 3504682 (Why is no real title available?)
• A course on large deviations with an introduction to Gibbs measures
• A large deviation principle for block models
• A large deviation principle for the Erdős-Rényi uniform random graph
• A limit theorem for small cliques in inhomogeneous random graphs
• A proof of the block model threshold conjecture
• A spectral signature of breaking of ensemble equivalence for constrained random graphs
• An introduction to large deviations for random graphs
• Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon
• Breaking of ensemble equivalence for dense random graphs under a single constraint
• Community detection thresholds and the weak Ramanujan property
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Ensemble equivalence for dense graphs
• Fluctuations of subgraph counts in graphon based random graphs
• Graphons, permutons and the Thoma simplex: three mod-Gaussian moduli spaces
• Large deviation for uniform graphs with given degrees
• Large deviation principle for the maximal eigenvalue of inhomogeneous Erdős-Rényi random graphs
• Large deviation principle for the norm of the Laplacian matrix of inhomogeneous Erdős-Rényi random graphs
• Large deviations for products of empirical probability measures in the \(\tau\)-topology
• Large deviations from the mckean-vlasov limit for weakly interacting diffusions
• Large deviations of U-empirical measures in strong topologies and applications
• Large deviations techniques and applications.
• Large networks and graph limits
• Measure theory
• Measure theory. Vol. I and II
• Nonlinear large deviations
• On replica symmetry of large deviations in random graphs
• On the variational problem for upper tails in sparse random graphs
• 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 probabilistic method
• Upper tails and independence polynomials in random graphs
• Upper tails for subgraph counts in random graphs
• Upper tails via high moments and entropic stability

This page was built for publication: Large deviation principles for graphon sampling

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