Recommendations
Cited in
(66)- Finitely forcible graph limits are universal
- Homogenization of parabolic equations with an arbitrary number of scales in both space and time
- 2-transitivity is insufficient for local testability
- Sparse affine-invariant linear codes are locally testable
- Mean-field and graph limits for collective dynamics models with time-varying weights
- Cut distance identifying graphon parameters over weak* limits
- Predicting winner and estimating margin of victory in elections using sampling
- Testing proximity to subspaces: approximate \(\ell_\infty\) minimization in constant time
- Compactness and finite forcibility of graphons
- Linear embeddings of graphs and graph limits
- Lower bounds for testing triangle-freeness in Boolean functions
- Co-clustering separately exchangeable network data
- Random graphons and a weak positivstellensatz for graphs
- Approximating Cayley diagrams versus Cayley graphs
- Parameter testing in bounded degree graphs of subexponential growth
- 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
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Densities in large permutations and parameter testing
- Counting graph homomorphisms
- What is the furthest graph from a hereditary property?
- Testability of minimum balanced multiway cut densities
- Hierarchy theorems for property testing
- A measure-theoretic approach to the theory of dense hypergraphs
- Network essence: PageRank completion and centrality-conforming Markov chains
- Weak regularity and finitely forcible graph limits
- Finitely forcible graphons and permutons
- Sublinear-time Algorithms
- Invariance in property testing
- Dynamics and control for multi-agent networked systems: a finite-difference approach
- On the testability of graph partition properties
- Graphon mean field games and their equations
- On derivatives of graphon parameters
- A unified approach to structural limits and limits of graphs with bounded tree-depth
- Earthmover Resilience and Testing in Ordered Structures
- Sparse graphs: metrics and random models
- Existence of modeling limits for sequences of sparse structures
- Local-global convergence, an analytic and structural approach
- An algebraic characterization of testable Boolean CSPs
- First-Order Convergence and Roots
- Testing permutation properties through subpermutations
- A note on permutation regularity
- Graphon convergence of random cographs
- Testing properties of graphs and functions
- Metastable mixing of Markov chains: efficiently sampling low temperature exponential random graphs
- Local-vs-global combinatorics
- Hyper resolution and equality axioms without function substitutions
- Limits of kernel operators and the spectral regularity lemma
- Recent advances on mechanisms of network generation: community, exchangeability, and scale-free properties
- Testing versus estimation of graph properties, revisited
- Interview with Joel Spencer
- A characterization of testable hypergraph properties
- The dimension of the feasible region of pattern densities (extended abstract)
- A compactification of the set of sequences of positive real numbers with applications to limits of graphs (extended abstract)
- The dimension of the feasible region of pattern densities
- An analytic approach to stability
- Ordered graph limits and their applications
- Graph similarity and homomorphism densities
- On counting (quantum-)graph homomorphisms in finite fields of prime order
- Characterizations of locally testable linear- and affine-invariant families
- Limits of dense graph sequences
- \(L^{2}\)-spectral invariants and convergent sequences of finite graphs
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Every minor-closed property of sparse graphs is testable
- Generalizations of the removal lemma
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)
