An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
From MaRDI portal
Publication:1747754
DOI10.1214/17-AOP1187zbMath1386.05099arXiv1408.0744OpenAlexW3105212187WikidataQ59410900 ScholiaQ59410900MaRDI QIDQ1747754
Christian Borgs, Yufei Zhao, Jennifer T. Chayes, Henry Cohn
Publication date: 27 April 2018
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.0744
Random graphs (graph-theoretic aspects) (05C80) Equilibrium statistical mechanics (82B99) Density (toughness, etc.) (05C42)
Related Items
A counterexample to the Bollobás–Riordan conjectures on sparse graph limits, Universality of the mean-field for the Potts model, Dynamic random networks and their graph limits, Weighted exponential random graph models: scope and large network limits, Interview with Yufei Zhao, A detailed investigation into near degenerate exponential random graphs, Iterative Collaborative Filtering for Sparse Matrix Estimation, Multivariate Hawkes processes on inhomogeneous random graphs, 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, Large deviations of subgraph counts for sparse Erdős-Rényi graphs, Graphon mean field systems, Differential calculus on the space of countable labelled graphs, Semantic limits of dense combinatorial objects, Network models: structure and function. Abstracts from the workshop held December 10--16, 2017, Quenched asymptotics for interacting diffusions on inhomogeneous random graphs, On limits of sparse random graphs, Respondent-driven sampling and sparse graph convergence, Phase transitions in edge-weighted exponential random graphs: near-degeneracy and universality, Sparse exchangeable graphs and their limits via graphon processes, The Semilinear Heat Equation on Sparse Random Graphs, Sampling perspectives on sparse exchangeable graphs, A transportation approach to the mean-field approximation, Sampling and estimation for (sparse) exchangeable graphs, Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing, Consistent nonparametric estimation for heavy-tailed sparse graphs, An introduction to large deviations for random graphs, An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions, Measures on the square as sparse graph limits, Optimal graphon estimation in cut distance, Unnamed Item, Limits of sparse configuration models and beyond: graphexes and multigraphexes, An infinite-dimensional metapopulation SIS model, Higher-order fluctuations in dense random graph models, The Cut Metric for Probability Distributions, A random graph of moderate density, Remarks on power-law random graphs, Action convergence of operators and graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Szemerédi's lemma for the analyst
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Quick approximation to matrices and applications
- Recurrence of distributional limits of finite planar graphs
- Moments of two-variable functions and the uniqueness of graph limits
- Metrics for sparse graphs
- Left and right convergence of graphs with bounded degree
- An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
- Convergent sequences of sparse graphs: A large deviations approach
