Cut distance identifying graphon parameters over weak* limits
From MaRDI portal
Publication:2120830
DOI10.1016/j.jcta.2022.105615zbMath1486.05276OpenAlexW4289548081MaRDI QIDQ2120830
Jan Grebík, Israel Rocha, Václav Rozhoň, Jan Hladký, Martin Doležal
Publication date: 1 April 2022
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2022.105615
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
Subgraph densities in Markov spaces, Relating the cut distance and the weak* topology for graphons, Cut-norm and entropy minimization over \(\text{weak}^{\ast}\) limits
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A measure-theoretic approach to the theory of dense hypergraphs
- Subgraph densities in signed graphons and the local Simonovits-Sidorenko conjecture
- An approximate version of Sidorenko's conjecture
- On the uniform convexity of \(L^p\) and \(l^p\)
- Supersaturated graphs and hypergraphs
- 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
- Finitely forcible graph limits are universal
- The step Sidorenko property and non-norming edge-transitive graphs
- On the local approach to Sidorenko's conjecture
- Bipartite subgraphs and quasi-randomness
- Convex graphon parameters and graph norms
- Relating the cut distance and the weak* topology for graphons
- Cut-norm and entropy minimization over \(\text{weak}^{\ast}\) limits
- Finite reflection groups and graph norms
- A correlation inequality for bipartite graphs
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Two approaches to Sidorenko’s conjecture
- Quasi-Random Oriented Graphs
- Szemerédi's Regularity Lemma for Matrices and Sparse Graphs
- Sidorenko's conjecture for blow-ups
- Graph limits and exchangeable random graphs
- Weak regularity and finitely forcible graph limits
- Some advances on Sidorenko's conjecture
- Finitely forcible graphons with an almost arbitrary structure
- Quasi-random graphs
- Graph norms and Sidorenko's conjecture
