Moments of two-variable functions and the uniqueness of graph limits
From MaRDI portal
Publication:2379365
DOI10.1007/s00039-010-0044-0zbMath1223.05193arXiv0803.1244OpenAlexW2115076673MaRDI QIDQ2379365
Jennifer T. Chayes, Christian Borgs
Publication date: 19 March 2010
Published in: Geometric and Functional Analysis. GAFA (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0803.1244
Combinatorial probability (60C05) Miscellaneous topics in measure theory (28E99) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (61)
Random graphons and a weak Positivstellensatz for graphs ⋮ Finitely forcible graph limits are universal ⋮ Edgeworth expansions for network moments ⋮ Time evolution of dense multigraph limits under edge-conservative preferential attachment dynamics ⋮ On edge exchangeable random graphs ⋮ Weak regularity and finitely forcible graph limits ⋮ Graphons and renormalization of large Feynman diagrams ⋮ A noncommutative approach to the graphon Fourier transform ⋮ A graphon counter example ⋮ Decomposition of tournament limits ⋮ Multipodal structure and phase transitions in large constrained graphs ⋮ Uniqueness of Banach space valued graphons ⋮ A measure theoretic perspective on the space of Feynman diagrams ⋮ From quasirandom graphs to graph limits and graphlets ⋮ On a question of Vera T. Sós about size forcing of graphons ⋮ Convergence and limits of finite trees ⋮ Natural quasirandomness properties ⋮ Extremal graph theory and finite forcibility ⋮ Graph limits and hereditary properties ⋮ A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth ⋮ Γ-limit of the cut functional on dense graph sequences ⋮ Typical large graphs with given edge and triangle densities ⋮ Poset limits and exchangeable random posets ⋮ Existence of a symmetric bipodal phase in the edge-triangle model ⋮ Sparse Graphs Using Exchangeable Random Measures ⋮ Phase transitions in finite random networks ⋮ On the Lower Tail Variational Problem for Random Graphs ⋮ Interval graph limits ⋮ Convergent sequences of dense graphs. II. Multiway cuts and statistical physics ⋮ Finitely forcible graphons with an almost arbitrary structure ⋮ Multigraph limit of the dense configuration model and the preferential attachment graph ⋮ A measure-theoretic approach to the theory of dense hypergraphs ⋮ Limits of randomly grown graph sequences ⋮ Quasi-random graphs and graph limits ⋮ Limits of kernel operators and the spectral regularity lemma ⋮ The automorphism group of a graphon ⋮ Limits of locally-globally convergent graph sequences ⋮ Identifiability for Graphexes and the Weak Kernel Metric ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence ⋮ Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing ⋮ Limits of \(k\)-dimensional poset sequences ⋮ Sparse exchangeable graphs and their limits via graphon processes ⋮ Limits of structures and the example of tree semi-lattices ⋮ An analytic approach to stability ⋮ Finitely forcible graphons ⋮ Contractors and connectors of graph algebras ⋮ The cut metric, random graphs, and branching processes ⋮ Consistent nonparametric estimation for heavy-tailed sparse graphs ⋮ EXISTENCE OF MODELING LIMITS FOR SEQUENCES OF SPARSE STRUCTURES ⋮ Local-global convergence, an analytic and structural approach ⋮ Cut-norm and entropy minimization over \(\text{weak}^{\ast}\) limits ⋮ Weak regularity and finitely forcible graph limits ⋮ The Entropy of Random-Free Graphons and Properties ⋮ Compactness and finite forcibility of graphons ⋮ Poset limits can be totally ordered ⋮ Singularities in the entropy of asymptotically large simple graphs ⋮ Linear embeddings of graphs and graph limits ⋮ Differential calculus on graphon space ⋮ The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs ⋮ Action convergence of operators and graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Limits of dense graph sequences
- Szemerédi's lemma for the analyst
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Random sampling and approximation of MAX-CSPs
- Property testing and its connection to learning and approximation
- Reflection positivity, rank connectivity, and homomorphism of graphs
- Probability with Martingales
This page was built for publication: Moments of two-variable functions and the uniqueness of graph limits
