Cut distance identifying graphon parameters over weak* limits (Q2120830)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7501782
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cut distance identifying graphon parameters over weak* limits |
scientific article; zbMATH DE number 7501782 |
Statements
Cut distance identifying graphon parameters over weak* limits (English)
0 references
1 April 2022
0 references
graphon
0 references
graph limit
0 references
cut norm
0 references
weak* convergence
0 references
graph norms
0 references
Sidorenko's conjecture
0 references
0 references
0.7959359884262085
0 references
0.7896106243133545
0 references
0.7611280679702759
0 references
0.7351006269454956
0 references
0.7184382081031799
0 references
