Graphons, cut norm and distance, couplings and rearrangements

Details Graphons, cut norm and distance, couplings and rearrangements Graphons, cut norm and distance, couplings and rearrangements

2010-09-13

arxiv.org/abs/1009.2376v3

Mathematics

Combinatorics

72 pages. This version contains a new section on pure graphons and some other minor additions, including a new appendix and ne

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Graphons, cut norm and distance, couplings and rearrangements does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Graphons, cut norm and distance, couplings and rearrangements, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graphons, cut norm and distance, couplings and rearrangements will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-337609