Graph limits and parameter testing
From MaRDI portal
Publication:2931391
DOI10.1145/1132516.1132556zbMath1301.68199OpenAlexW2126296671WikidataQ105584207 ScholiaQ105584207MaRDI QIDQ2931391
Vera T. Sós, Balázs Szegedy, Katalin Vesztergombi, Christian Borgs, Jennifer T. Chayes
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
Related Items (50)
Random graphons and a weak Positivstellensatz for graphs ⋮ Finitely forcible graph limits are universal ⋮ Densities in large permutations and parameter testing ⋮ An Algebraic Characterization of Testable Boolean CSPs ⋮ Testing properties of graphs and functions ⋮ Sunflowers and testing triangle-freeness of functions ⋮ Graphon convergence of random cographs ⋮ A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth ⋮ Metastable mixing of Markov chains: efficiently sampling low temperature exponential random graphs ⋮ Testability of minimum balanced multiway cut densities ⋮ Local-vs-global combinatorics ⋮ 2-transitivity is insufficient for local testability ⋮ Network Essence: PageRank Completion and Centrality-Conforming Markov Chains ⋮ Hierarchy theorems for property testing ⋮ Unnamed Item ⋮ First-Order Convergence and Roots ⋮ What is the furthest graph from a hereditary property? ⋮ A measure-theoretic approach to the theory of dense hypergraphs ⋮ Limits of kernel operators and the spectral regularity lemma ⋮ Regularity lemmas in a Banach space setting ⋮ \(L^{2}\)-spectral invariants and convergent sequences of finite graphs ⋮ Co-clustering separately exchangeable network data ⋮ Finitely forcible graphons and permutons ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Predicting winner and estimating margin of victory in elections using sampling ⋮ Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing ⋮ Every minor-closed property of sparse graphs is testable ⋮ Testing permutation properties through subpermutations ⋮ Sparse affine-invariant linear codes are locally testable ⋮ Sublinear-time Algorithms ⋮ Invariance in Property Testing ⋮ An analytic approach to stability ⋮ Generalizations of the removal lemma ⋮ Parameter testing in bounded degree graphs of subexponential growth ⋮ A note on permutation regularity ⋮ Sparse graphs: Metrics and random models ⋮ Earthmover Resilience and Testing in Ordered Structures ⋮ Mean-field and graph limits for collective dynamics models with time-varying weights ⋮ Dynamics and control for multi-agent networked systems: A finite-difference approach ⋮ On Sums of Locally Testable Affine Invariant Properties ⋮ Limits on the Rate of Locally Testable Affine-Invariant Codes ⋮ Inflatable Graph Properties and Natural Property Tests ⋮ EXISTENCE OF MODELING LIMITS FOR SEQUENCES OF SPARSE STRUCTURES ⋮ Testing proximity to subspaces: approximate \(\ell_\infty\) minimization in constant time ⋮ Local-global convergence, an analytic and structural approach ⋮ Characterizations of locally testable linear- and affine-invariant families ⋮ Weak regularity and finitely forcible graph limits ⋮ Compactness and finite forcibility of graphons ⋮ Graphon Mean Field Games and Their Equations ⋮ Lower bounds for testing triangle-freeness in Boolean functions
This page was built for publication: Graph limits and parameter testing
