Hypergraph limits: A regularity approach
From MaRDI portal
Publication:3192379
DOI10.1002/rsa.20537zbMath1322.05103arXiv1302.1634OpenAlexW3124571071MaRDI QIDQ3192379
Publication date: 12 October 2015
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.1634
Related Items (7)
Random Simplicial Complexes: Models and Phenomena ⋮ A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth ⋮ On the limit of the positive \(\ell\)-degree Turán problem ⋮ Limits of structures and the example of tree semi-lattices ⋮ Triforce and corners ⋮ Cut-norm and entropy minimization over \(\text{weak}^{\ast}\) limits ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- A measure-theoretic approach to the theory of dense hypergraphs
- A variant of the hypergraph removal lemma
- Limits of dense graph sequences
- Szemerédi's lemma for the analyst
- A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- On exchangeable random variables and the statistics of large graphs and hypergraphs
- Quick approximation to matrices and applications
- Representations for partially exchangeable arrays of random variables
- Symmetries on random arrays and set-indexed processes
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Graph limits and exchangeable random graphs
- Probability with Martingales
- The counting lemma for regular k‐uniform hypergraphs
This page was built for publication: Hypergraph limits: A regularity approach
