REVIEW 2 cited by
Graphons, cut norm and distance, couplings and rearrangements
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We give a survey of basic results on the cut norm and cut metric for graphons (and sometimes more general kernels), with emphasis on the equivalence problem. The main results are not new, but we add various technical complements, and a new proof of the uniqueness theorem by Borgs, Chayes and Lov\'asz. We allow graphons on general probability spaces whenever possible. We also give some new results for {0,1}-valued graphons and for pure graphons.
Forward citations
Cited by 2 Pith papers
-
Decorated graphons for temporal network estimation
Dynamic networks can be modeled as decorated graphons whose edge labels are binary time-series laws, estimated by two-stage blockwise least squares with rates depending on the number of time steps and edge-estimator quality.
-
Stochastic Graphon Games with Interventions
For dynamic graphon games, the paper claims existence, uniqueness, and finite-N approximation of welfare-maximizing interventions, with explicit linear-quadratic solutions.
Discussion (0). Continue with ORCID to comment.