Limits of CSP Problems and Efficient Parameter Testing
Preprint
Abstract
We present a unified framework on the limits of constraint satisfaction problems (CSPs) and efficient parameter testing which depends only on array exchangeability and the method of cut decomposition without recourse to the weakly regular partitions. In particular, we formulate and prove a representation theorem for compact colored $r$-uniform directed hypergraph ($r$-graph) limits, and apply this to $r$CSP limits. We investigate the sample complexity of testable $r$-graph parameters, we discuss the generalized ground state energies and demonstrate that they are efficiently testable.Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Hypergraph limits: A regularity approachRandom Structures & Algorithms, 2014
- A measure-theoretic approach to the theory of dense hypergraphsAdvances in Mathematics, 2012
- Poset limits and exchangeable random posetsCombinatorica, 2011
- Testing properties of graphs and functionsIsrael Journal of Mathematics, 2010
- Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testingAdvances in Mathematics, 2008
- Limits of dense graph sequencesJournal of Combinatorial Theory, Series B, 2006
- A new rounding procedure for the assignment problem with applications to dense graph arrangement problemsMathematical Programming, 2002
- Quick Approximation to Matrices and ApplicationsCombinatorica, 1999
- Symmetries on random arrays and set-indexed processesJournal of Theoretical Probability, 1992
- Representations for partially exchangeable arrays of random variablesJournal of Multivariate Analysis, 1981