Cut distance identifying graphon parameters over weak* limits

DOI10.1016/j.jcta.2022.105615zbMath1486.05276arXiv1809.03797MaRDI QIDQ6306550

Jan Grebík, Israel Rocha, Václav Rozhoň, Martin Doležal, Jan Hladký

Publication date: 11 September 2018

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

This page was built for publication: Cut distance identifying graphon parameters over weak* limits