20 citations · 61 across the 13 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.CO2018★ 2 cited
Finitely forcible graphons with an almost arbitrary structure
Daniel Kral, László Miklós Lovász, Jonathan A. Noel +1
Graphons are analytic objects representing convergent sequences of large graphs. A graphon is said to be finitely forcible if it is determined by finitely many subgraph densities,…
math.PR2018
Identifiability for graphexes and the weak kernel metric
Christian Borgs, Jennifer T. Chayes, Henry Cohn +1
In two recent papers by Veitch and Roy and by Borgs, Chayes, Cohn, and Holden, a new class of sparse random graph processes based on the concept of graphexes over -finite measur…