Pages that link to "Item:Q2931391"

The following pages link to Graph limits and parameter testing (Q2931391):

Displaying 50 items.

• Densities in large permutations and parameter testing (Q338581) (← links)
• Testability of minimum balanced multiway cut densities (Q423907) (← links)
• Hierarchy theorems for property testing (Q430844) (← links)
• A measure-theoretic approach to the theory of dense hypergraphs (Q456779) (← links)
• Finitely forcible graphons and permutons (Q473103) (← links)
• Testing permutation properties through subpermutations (Q551179) (← links)
• Testing properties of graphs and functions (Q607829) (← links)
• Limits of kernel operators and the spectral regularity lemma (Q648972) (← links)
• An analytic approach to stability (Q710597) (← links)
• Characterizations of locally testable linear- and affine-invariant families (Q764306) (← links)
• \(L^{2}\)-spectral invariants and convergent sequences of finite graphs (Q924662) (← links)
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing (Q952421) (← links)
• Every minor-closed property of sparse graphs is testable (Q962147) (← links)
• Generalizations of the removal lemma (Q987562) (← links)
• Finitely forcible graph limits are universal (Q1621473) (← links)
• 2-transitivity is insufficient for local testability (Q1947041) (← links)
• Sparse affine-invariant linear codes are locally testable (Q2012176) (← links)
• Mean-field and graph limits for collective dynamics models with time-varying weights (Q2045843) (← links)
• Predicting winner and estimating margin of victory in elections using sampling (Q2238579) (← links)
• Testing proximity to subspaces: approximate \(\ell_\infty\) minimization in constant time (Q2309471) (← links)
• Compactness and finite forcibility of graphons (Q2327712) (← links)
• Lower bounds for testing triangle-freeness in Boolean functions (Q2353187) (← links)
• Sunflowers and testing triangle-freeness of functions (Q2410684) (← links)
• Co-clustering separately exchangeable network data (Q2448722) (← links)
• Random graphons and a weak Positivstellensatz for graphs (Q2888890) (← links)
• Parameter testing in bounded degree graphs of subexponential growth (Q3055893) (← links)
• On Sums of Locally Testable Affine Invariant Properties (Q3088113) (← links)
• Limits on the Rate of Locally Testable Affine-Invariant Codes (Q3088114) (← links)
• Inflatable Graph Properties and Natural Property Tests (Q3088125) (← links)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
• What is the furthest graph from a hereditary property? (Q3522831) (← links)
• Network Essence: PageRank Completion and Centrality-Conforming Markov Chains (Q4604398) (← links)
• Weak regularity and finitely forcible graph limits (Q4608759) (← links)
• Sublinear-time Algorithms (Q4933363) (← links)
• Invariance in Property Testing (Q4933370) (← links)
• Dynamics and control for multi-agent networked systems: A finite-difference approach (Q4972953) (← links)
• (Q5009551) (← links)
• Graphon Mean Field Games and Their Equations (Q5013560) (← links)
• A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth (Q5108706) (← links)
• Earthmover Resilience and Testing in Ordered Structures (Q5121906) (← links)
• Sparse graphs: Metrics and random models (Q5198669) (← links)
• EXISTENCE OF MODELING LIMITS FOR SEQUENCES OF SPARSE STRUCTURES (Q5222519) (← links)
• Local-global convergence, an analytic and structural approach (Q5227148) (← links)
• An Algebraic Characterization of Testable Boolean CSPs (Q5326555) (← links)
• First-Order Convergence and Roots (Q5366887) (← links)
• Regularity lemmas in a Banach space setting (Q5890899) (← links)
• A note on permutation regularity (Q5916098) (← links)
• Graphon convergence of random cographs (Q6074665) (← links)
• Metastable mixing of Markov chains: efficiently sampling low temperature exponential random graphs (Q6126113) (← links)
• Local-vs-global combinatorics (Q6198642) (← links)