Ordered graph limits and their applications
From MaRDI portal
Cites work
- A (terse) introduction to Lebesgue integration
- A Characterization of the (Natural) Graph Properties Testable with One-Sided Error
- A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
- A measure-theoretic approach to the theory of dense hypergraphs
- Avoiding Patterns in Matrices Via a Small Number of Changes
- Community detection and stochastic block models: recent developments
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Convergent sequences of sparse graphs: a large deviations approach
- Counting graph homomorphisms
- Earthmover Resilience and Testing in Ordered Structures
- Efficient testing of large graphs
- Gowers norm, function limits, and parameter estimation
- Graph limits and exchangeable random graphs
- Graph limits and parameter testing
- scientific article; zbMATH DE number 3641497 (Why is no real title available?)
- Hypergraph limits: A regularity approach
- Large networks and graph limits
- Limits of dense graph sequences
- Limits of permutation sequences
- Moments of two-variable functions and the uniqueness of graph limits
- Multicolor and directed edit distance
- Poset limits and exchangeable random posets
- Quick approximation to matrices and applications
- Reflection positivity, rank connectivity, and homomorphism of graphs
- Szemerédi's lemma for the analyst
- Testing hereditary properties of ordered graphs and matrices
- Testing properties of graphs and functions
- Testing versus Estimation of Graph Properties
- The edit distance in graphs: methods, results, and generalizations
- What is the furthest graph from a hereditary property?
This page was built for publication: Ordered graph limits and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229329)
