An L^p theory of sparse graph convergence. II: LD convergence, quotients and right convergence
From MaRDI portal
Publication:1747754
Abstract: We extend the theory of sparse graph limits, which was introduced in a companion paper, by analyzing different notions of convergence. Under suitable restrictions on node weights, we prove the equivalence of metric convergence, quotient convergence, microcanonical ground state energy convergence, microcanonical free energy convergence, and large deviation convergence. Our theorems extend the broad applicability of dense graph convergence to all sparse graphs with unbounded average degree, while the proofs require new techniques based on uniform upper regularity. Examples to which our theory applies include stochastic block models, power law graphs, and sparse versions of -random graphs.
Recommendations
- An \(L^p\) theory of sparse graph convergence. I: Limits, sparse random graph models, and power law distributions
- Convergent sequences of sparse graphs: a large deviations approach
- Right-convergence of sparse random graphs
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- On limits of sparse random graphs
Cites work
- scientific article; zbMATH DE number 1158743 (Why is no real title available?)
- An \(L^p\) theory of sparse graph convergence. I: Limits, sparse random graph models, and power law distributions
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Convergent sequences of sparse graphs: a large deviations approach
- Counting graph homomorphisms
- Left and right convergence of graphs with bounded degree
- Metrics for sparse graphs
- Moments of two-variable functions and the uniqueness of graph limits
- Quick approximation to matrices and applications
- Recurrence of distributional limits of finite planar graphs
- Szemerédi's lemma for the analyst
Cited in
(50)- Consistent nonparametric estimation for heavy-tailed sparse graphs
- Graphon mean field systems
- Differential calculus on the space of countable labelled graphs
- Semantic limits of dense combinatorial objects
- Long-term stability of interacting Hawkes processes on random graphs
- Network models: structure and function. Abstracts from the workshop held December 10--16, 2017
- On the continuum limit of epidemiological models on graphs: convergence and approximation results
- Weighted exponential random graph models: scope and large network limits
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Graph polynomials associated with Dyson-Schwinger equations
- The cut metric for probability distributions
- Sampling perspectives on sparse exchangeable graphs
- Large deviations of subgraph counts for sparse Erdős-Rényi graphs
- Respondent-driven sampling and sparse graph convergence
- Dynamic random networks and their graph limits
- Asymptotic analysis of statistical estimators related to multigraphex processes under misspecification
- A counterexample to the Bollobás–Riordan conjectures on sparse graph limits
- Continuum limit of p-Laplacian evolution problems on graphs: Lq graphons and sparse graphs
- Remarks on power-law random graphs
- The semilinear heat equation on sparse random graphs
- A transportation approach to the mean-field approximation
- Action convergence of operators and graphs
- A detailed investigation into near degenerate exponential random graphs
- Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing
- Universality of the mean-field for the Potts model
- On limits of sparse random graphs
- Multivariate Hawkes processes on inhomogeneous random graphs
- Matrix estimation, latent variable model and collaborative filtering
- Right-convergence of sparse random graphs
- An introduction to large deviations for random graphs
- An infinite-dimensional metapopulation SIS model
- Measures on the square as sparse graph limits
- Optimal graphon estimation in cut distance
- Robust recovery of Robinson property in \(L^p\)-graphons: a cut-norm approach
- A short proof of the equivalence of left and right convergence for sparse graphs
- Quenched asymptotics for interacting diffusions on inhomogeneous random graphs
- Sampling and estimation for (sparse) exchangeable graphs
- A unified view of graph regularity via matrix decompositions
- Iterative Collaborative Filtering for Sparse Matrix Estimation
- Phase transitions in edge-weighted exponential random graphs: near-degeneracy and universality
- Computational lower bounds for graphon estimation via low-degree polynomials
- Limits of sparse configuration models and beyond: graphexes and multigraphexes
- Interview with Yufei Zhao
- An \(L^p\) theory of sparse graph convergence. I: Limits, sparse random graph models, and power law distributions
- Convergent sequences of sparse graphs: a large deviations approach
- Higher-order fluctuations in dense random graph models
- A random graph of moderate density
- Sparse exchangeable graphs and their limits via graphon processes
- Fluctuations in mean-field Ising models
- Hypergraphon mean field games
This page was built for publication: An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1747754)
