Cut-norm and entropy minimization over \(\text{weak}^{\ast}\) limits
From MaRDI portal
Publication:2312609
DOI10.1016/j.jctb.2018.12.010zbMath1415.05098arXiv1705.09160OpenAlexW2618773088MaRDI QIDQ2312609
Publication date: 17 July 2019
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.09160
Related Items (2)
Cut distance identifying graphon parameters over weak* limits ⋮ Relating the cut distance and the weak* topology for graphons
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A measure-theoretic approach to the theory of dense hypergraphs
- Testing properties of graphs and functions
- A new proof of the graph removal lemma
- The large deviation principle for the Erdős-Rényi random graph
- Limits of dense graph sequences
- Szemerédi's lemma for the analyst
- Compact orbit spaces in Hilbert spaces and limits of edge-colouring models
- 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
- The step Sidorenko property and non-norming edge-transitive graphs
- Cut distance identifying graphon parameters over weak* limits
- Relating the cut distance and the weak* topology for graphons
- Quasirandom permutations are characterized by 4-point densities
- Moments of two-variable functions and the uniqueness of graph limits
- Graph removal lemmas
- Szemerédi's Regularity Lemma for Matrices and Sparse Graphs
- Hypergraph limits: A regularity approach
- Graph limits and exchangeable random graphs
- Efficient testing of large graphs
- Graph norms and Sidorenko's conjecture
This page was built for publication: Cut-norm and entropy minimization over \(\text{weak}^{\ast}\) limits
