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
- 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
- scientific article; zbMATH DE number 1158743 (Why is no real title available?)
- 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
(63)- Weighted exponential random graph models: scope and large network limits
- Network models: structure and function. Abstracts from the workshop held December 10--16, 2017
- Respondent-driven sampling and sparse graph convergence
- Phase transitions in edge-weighted exponential random graphs: near-degeneracy and universality
- A transportation approach to the mean-field approximation
- Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing
- Consistent nonparametric estimation for heavy-tailed sparse graphs
- Limits of sparse configuration models and beyond: graphexes and multigraphexes
- An infinite-dimensional metapopulation SIS model
- Higher-order fluctuations in dense random graph models
- A random graph of moderate density
- Remarks on power-law random graphs
- Multivariate Hawkes processes on inhomogeneous random graphs
- Large deviations of subgraph counts for sparse Erdős-Rényi graphs
- Differential calculus on the space of countable labelled graphs
- Quenched asymptotics for interacting diffusions on inhomogeneous random graphs
- Sampling perspectives on sparse exchangeable graphs
- Sampling and estimation for (sparse) exchangeable graphs
- Measures on the square as sparse graph limits
- Optimal graphon estimation in cut distance
- Universality of the mean-field for the Potts model
- An introduction to large deviations for random graphs
- Dynamic random networks and their graph limits
- A detailed investigation into near degenerate exponential random graphs
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Sparse exchangeable graphs and their limits via graphon processes
- Right-convergence of sparse random graphs
- The cut metric for probability distributions
- Action convergence of operators and graphs
- Interview with Yufei Zhao
- Iterative Collaborative Filtering for Sparse Matrix Estimation
- On limits of sparse random graphs
- Matrix estimation, latent variable model and collaborative filtering
- Semantic limits of dense combinatorial objects
- 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
- The semilinear heat equation on sparse random graphs
- 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
- A unified view of graph regularity via matrix decompositions
- Fluctuations in mean-field Ising models
- Long-term stability of interacting Hawkes processes on random graphs
- Graph polynomials associated with Dyson-Schwinger equations
- Graphon mean field systems
- Hypergraphon mean field games
- On the continuum limit of epidemiological models on graphs: convergence and approximation results
- Asymptotic analysis of statistical estimators related to multigraphex processes under misspecification
- Robust recovery of Robinson property in L^p-graphons: a cut-norm approach
- Computational lower bounds for graphon estimation via low-degree polynomials
- The sparse regularity method with Schatten norms and entropy
- On network-based epidemiological models: analysis, simulations, and continuum limit
- The ``zero charge problem via graphon processes
- Graph limit and exponential consensus for the large-scale multi-agent system with delay
- A compactification of the set of sequences of positive real numbers with applications to limits of graphs (extended abstract)
- Mean-field limit of non-exchangeable systems
- LDP for inhomogeneous U-statistics
- The mean-field limit of sparse networks of integrate-and-fire neurons
- Large deviations of mean-field jump-Markov processes on structured sparse random graphs
- Control strategies and trends to equilibrium for kinetic models of opinion dynamics driven by social activity
- Fluctuations in random field Ising models
- Inverse graph limit problem of the graphon multi-agent systems
- A random graph representation for Green's functions
- A short proof of the equivalence of left and right convergence for sparse graphs
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)
