{'fraction_non_alphanumeric': 0.03522504892367906, 'fraction_numerical': 0.003913894324853229, 'mean_word_length': 4.752808988764045, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Graphons, cut norm and distance, couplings and rearrangements

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.