Graph limits and parameter testing
From MaRDI portal
Publication:2931391
DOI10.1145/1132516.1132556zbMATH Open1301.68199OpenAlexW2126296671WikidataQ105584207 ScholiaQ105584207MaRDI QIDQ2931391FDOQ2931391
Authors: Vera T. Sós, Balázs Szegedy, Katalin Vesztergombi, Christian Borgs, Jennifer T. Chayes, László Lovász 
Publication date: 25 November 2014
Published in: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: http://real.mtak.hu/110695/1/1132516.1132556.pdf
Recommendations
- Graph limits
- Testing properties of graphs and functions
- scientific article; zbMATH DE number 922268
- Testing graph blow-up
- Testing graph blow-up
- Testing versus Estimation of Graph Properties
- Testing of graph properties
- Interval graph limits
- Testing graphs against an unknown distribution
- Testing graphs against an unknown distribution
Cited In (61)
- Recent advances on mechanisms of network generation: community, exchangeability, and scale-free properties
- Testing versus estimation of graph properties, revisited
- Local-vs-global combinatorics
- Hyper resolution and equality axioms without function substitutions
- Interview with Joel Spencer
- Metastable mixing of Markov chains: efficiently sampling low temperature exponential random graphs
- An algebraic characterization of testable Boolean CSPs
- Sublinear-time Algorithms
- Limits of kernel operators and the spectral regularity lemma
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Co-clustering separately exchangeable network data
- Sunflowers and testing triangle-freeness of functions
- \(L^{2}\)-spectral invariants and convergent sequences of finite graphs
- A measure-theoretic approach to the theory of dense hypergraphs
- Generalizations of the removal lemma
- First-Order Convergence and Roots
- Cut distance identifying graphon parameters over weak* limits
- Testability of minimum balanced multiway cut densities
- On the testability of graph partition properties
- Network essence: PageRank completion and centrality-conforming Markov chains
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Hierarchy theorems for property testing
- Earthmover Resilience and Testing in Ordered Structures
- Counting graph homomorphisms
- An analytic approach to stability
- Graphon mean field games and their equations
- Homogenization of parabolic equations with an arbitrary number of scales in both space and time
- Dynamics and control for multi-agent networked systems: a finite-difference approach
- Regularity lemmas in a Banach space setting
- Graphon convergence of random cographs
- Weak regularity and finitely forcible graph limits
- Mean-field and graph limits for collective dynamics models with time-varying weights
- Parameter testing in bounded degree graphs of subexponential growth
- Testing proximity to subspaces: approximate \(\ell_\infty\) minimization in constant time
- Local-global convergence, an analytic and structural approach
- Testing properties of graphs and functions
- Densities in large permutations and parameter testing
- Inflatable graph properties and natural property tests
- Finitely forcible graphons and permutons
- Characterizations of locally testable linear- and affine-invariant families
- Testing permutation properties through subpermutations
- Limits on the Rate of Locally Testable Affine-Invariant Codes
- A unified approach to structural limits and limits of graphs with bounded tree-depth
- Invariance in property testing
- What is the furthest graph from a hereditary property?
- Approximating Cayley diagrams versus Cayley graphs
- A note on permutation regularity
- Sparse affine-invariant linear codes are locally testable
- Finitely forcible graph limits are universal
- Linear embeddings of graphs and graph limits
- Limits of dense graph sequences
- Lower bounds for testing triangle-freeness in Boolean functions
- Sparse graphs: metrics and random models
- Predicting winner and estimating margin of victory in elections using sampling
- Every minor-closed property of sparse graphs is testable
- On derivatives of graphon parameters
- 2-transitivity is insufficient for local testability
- Existence of modeling limits for sequences of sparse structures
- Compactness and finite forcibility of graphons
- Random graphons and a weak positivstellensatz for graphs
- On Sums of Locally Testable Affine Invariant Properties
This page was built for publication: Graph limits and parameter testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931391)
