Moments of Two-Variable Functions and the Uniqueness of Graph Limits

Christian Borgs, Jennifer Chayes, Laszlo Lovasz

Introduction

Our interest in these integrals stems from graph theory (see next paragraph), but such integrals appear in physics, statistics, and other areas. In many respects, these integrals can be thought of as 2-variable analogues of moments of 1-variable functions, so instead of moment sequences, such 22-variable functions have a ”moment graph parameter” (function defined on graphs). Just like moments of a 1-variable function determine the function up to measure preserving transformations, these “moments” determine the 2-variable function up to measure preserving transformations. The exact formulation and proof of this fact is the main goal of this paper.

Our main motivation for this study comes from the theory of convergent graph sequences. Let FF and GG be two simple graphs (graphs without loops and multiple edges). Let us map the nodes of FF randomly into V(G)V(G), and let t(F,G)t(F,G) denote the probability that this map preserves adjacency. For example, t(K2,G)t(K_{2},G) denotes the edge density of GG. In general, we call t(F,G)t(F,G) the homomorphism density or simply the density of FF in GG.

We call a sequence of simple graphs (Gn)(G_{n}) convergent, if t(F,Gn)t(F,G_{n}) has a limit for every simple graph FF. The notion of convergent graph sequences was introduced by Borgs, Chayes, Lovász, Sós and Vesztergombi , see also , and further studied in and . Lovász and Szegedy proved that every convergent graph sequence has a “limit object” in the form of a function W∈W0W\in{\cal W}_{0} in the sense that

for every simple graph FF. In this case we say that GnG_{n} converges to WW. It was also shown in that for every function W∈W0W\in{\cal W}_{0} there is a convergent sequence (Gn)(G_{n}) of simple graphs converging to WW. To complete the picture, the results in this paper imply that the limit object is unique up to measure preserving transformations.

Results

For the precise statement of our results, we need some definitions. Instead of the interval $$, we consider two-variable functions on an arbitrary probability space; while this does not add real generality it leads to a cleaner picture. We need a few definitions.

We start by recalling some basic notions from probability theory. Let (Ω,A,π)(\Omega,{\cal A},\pi) be a probability space (where Ω\Omega is the underlying set, A{\cal A} is a σ\sigma-algebra on Ω\Omega, and π\pi is a probability measure on A{\cal A}). As usual, (Ω,A,π)(\Omega,{\cal A},\pi) is called complete if A{\cal A} contains all sets of external measure 00, and the completion of (Ω,A,π)(\Omega,{\cal A},\pi) is obtained by replacing A{\cal A} with the σ\sigma-algebra generated by A{\cal A} and all subsets N⊂ΩN\subset\Omega of external measure 00.

Let (Ω,A,π)(\Omega,{\cal A},\pi) and (Ω′,A′,π′)(\Omega^{\prime},{\cal A}^{\prime},\pi^{\prime}) be probability spaces, and let ϕ\phi be a measure preserving map from Ω\Omega to Ω′\Omega^{\prime}. The map ϕ\phi is called an isomorphism if it is a bijection between Ω\Omega and Ω′\Omega^{\prime} and both ϕ\phi and ϕ−1\phi^{-1} are measure preserving, and it is called an isomorphism mod 00 if there are null sets N∈AN\in{\cal A} and N′∈A′N^{\prime}\in{\cal A}^{\prime} such that the restriction of ϕ\phi to Ω∖N\Omega\setminus N is an isomorphism between Ω∖N\Omega\setminus N and Ω′∖N′\Omega^{\prime}\setminus N^{\prime} (equipped with the suitable restrictions of (A,π)({\cal A},\pi) and (A′,π′)({\cal A}^{\prime},\pi^{\prime}), respectively). In the last case (Ω,A,π)(\Omega,{\cal A},\pi) and (Ω′,A′,π′)(\Omega^{\prime},{\cal A}^{\prime},\pi^{\prime}) are called isomorphic mod 00.

It turns out that several of our results require a little bit more structure than that of an arbitrary probability space. In particular, we will consider Lebesgue spaces, i.e., complete probability spaces that are isomorphic mod 00 to the disjoint union of a closed interval (equipped with the standard Lebesgue sets and Lebesgue measure) and a countable set of atoms. See , Section 2.2 for an axiomatic definition of Lebesgue spaces, and Section 2.4 for the proof that a probability space is Lebesgue if and only if it is isomorphic mod 0 to the disjoint union of a closed interval and a countable set of atoms.

We are now ready to introduce the main objects studied in this paper.

From our point of view, graphons obtained by changing WW on a set of measure 00, or changing the σ\sigma-algebra A{\cal A} so that WW remains measurable, do not differ essentially from the original. However, for technical reasons we have to distinguish them. We say that a graphon is strong, if WW is measurable with respect to A×A{\cal A}\times{\cal A} (not just the completion of it). We can always change WW on a set of measure 00 to make the graphon strong (Theorem 3.2(i)).

We say that HH is complete, if the underlying probability space is complete, and we say that it is Lebesguian, if the underlying probability space is a Lebesgue space. The completion, H‾\overline{H}, of HH is obtained by completing the underlying probability space, i.e., by replacing A{\cal A} by its completion A‾\overline{{\cal A}}.

Let H=(Ω,A,π,W)H=(\Omega,{\cal A},\pi,W) be a graphon, and let FF be a finite graph with V(F)={1,…,k}V(F)=\{1,\dots,k\}. The definition (1) then can be extended as

Let H=(Ω,A,π,W)H=(\Omega,{\cal A},\pi,W) and H′=(Ω′,A′,π′,W′)H^{\prime}=(\Omega^{\prime},{\cal A}^{\prime},\pi^{\prime},W^{\prime}) be two graphons. The goal of this paper is to determine necessary and sufficient conditions under which

To this end, we will introduce two different notions of isomorphism. Both will be expressed in terms of the following operation: given a graphon H′=(Ω′,A′,π′,W′)H^{\prime}=(\Omega^{\prime},{\cal A}^{\prime},\pi^{\prime},W^{\prime}) and a measure preserving map ϕ\phi from a probability space (Ω,A,W)(\Omega,{\cal A},W) into (Ω′,A′,π′)(\Omega^{\prime},{\cal A}^{\prime},\pi^{\prime}), let (W′)ϕ(W^{\prime})^{\phi} be “pull-back” of W′W^{\prime}, defined by (W′)ϕ(x,y)=W(ϕ(x),ϕ(y))(W^{\prime})^{\phi}(x,y)=W(\phi(x),\phi(y)). If H=(Ω,A,π,W)H=(\Omega,{\cal A},\pi,W) and G=(Γ,B,ρ,U)G=(\Gamma,{\cal B},\rho,U) are two graphons and ϕ: Ω→Gamma\phi:~\Omega\to Gamma is measure preserving from the completion A‾\overline{{\cal A}} into B{\cal B} such that W=UϕW=U^{\phi} almost everywhere, then we call ϕ\phi a weak isomorphism from HH to GG. Note that a weak isomorphism is not necessarily invertible.

We say that HH and H′H^{\prime} are isomorphic mod 0 (in notation H′≅H′H^{\prime}\cong H^{\prime}), if there exists a map ϕ: Ω→Ω′\phi:~\Omega\to\Omega^{\prime} such that ϕ\phi is an isomorphism mod 0 and (W′)ϕ=W(W^{\prime})^{\phi}=W almost everywhere in Ω×Ω\Omega\times\Omega. For simplicity, we often drop the qualifier mod 0.

We call HH and H′H^{\prime} weakly isomorphic if there is a third graphon GG and weak isomorphisms from HH and H′H^{\prime} into GG. It will follow from Theorems 3.2 and 2.1 that we could require here that GG is a strong Lebesguian graphon.

The isomorphism relation ≅\cong is clearly an equivalence relation, and it will follow from Theorem 2.1 (ii) below that weak isomorphism is an equivalence relation as well. Every graphon is weakly isomorphic with its completion, and every pair of isomorphic graphons is weakly isomorphic. It is clear that if two graphons HH and H′H^{\prime} are weakly isomorphic then (4) holds for every graph HH. Theorem 2.1 (ii) below will show that the converse also holds.

To state our results, we need one more notion, the notion of twins. Let H=(Ω,A,π,W)H=(\Omega,{\cal A},\pi,W) be a graphon. Two points x1,x2∈Ωx_{1},x_{2}\in\Omega are called twins if W(x1,y)=W(x2,y)W(x_{1},y)=W(x_{2},y) for almost all y∈Ωy\in\Omega. Note that relation of being twins is an equivalence relation. We call the graphon HH almost twin-free if all there exists a set NN of measure zero such that no two points in Ω∖N\Omega\setminus N are twins.

2 Main results

With these definitions, we can state our main result:

(i) If HH and H′H^{\prime} are almost twin-free Lebesguian graphons, then (4) holds for every simple graph FF if and only if H≅H′H\cong H^{\prime}.

(ii) If HH and H′H^{\prime} are general graphons, then (4) holds for every simple graph FF if and only if HH and H′H^{\prime} are weakly isomorphic.

A natural idea of the proof of Theorem 2.1 is the following: can we bring a graphon (Ω,A,π,W)(\Omega,{\cal A},\pi,W) to a “canonical form”, so that isomorphic or weakly isomorphic graphons would have identical canonical forms? In the case of functions in a single variable, this is possible, through “monotonization”: for every bounded real function on thereisanuniquemonotoneincreasingleft−continuousfunctiononthere is an unique monotone increasing left-continuous function on that has the same moments.

In Section 4 we’ll construct not quite a canonical form, but a “canonical ensemble”, a probability distribution (Hα)(H_{\alpha}) of graphons on the same σ\sigma-algebra such that H≅HαH\cong H_{\alpha} for almost all α\alpha, and two graphons are isomorphic if and only if their ensembles can be coupled so that corresponding graphons are identical (up to sets of measure 00).

An important element of the proof is a curious measure-theoretic fact. Consider a 2-variable function for which all 1-variable functions obtained by fixing one of the variables are measurable. This of course does not in general imply that the 2-variable function is measurable, but it does imply it in some circumstances (see e.g. Corollary 4.2).

As we will see, the second statement of Theorem 2.1 can easily be deduced from the first. In fact, we’ll show that every graphon is weakly isomorphic to a twin-free Lebesguian graphon. (See Theorem 3.2 for more details of this isomorphism.)

We can also transform a Lebesguian graphon into a graphon whose underlying probability space is the unit interval with the Lebesgue measure, by “resolving” the atoms into intervals of the appropriate length. This form is the most elementary and therefore useful in applications; however, it is not so convenient for the purposes of this paper because we loose twin-freeness.

It is easy to see that if HH and H′H^{\prime} are weakly isomorphic, then (4) holds not only for simple graphs FF but also for graphs with multiple edges (which we’ll call multigraphs if we want to emphasize that multiple edges are allowed; but we don’t allow loops). Thus (4) for simple graphs implies this equation for multigraphs. (This fact will be an important step in the proof, see Section 5.2.)

We can formulate our results in a probabilistic way. Recall that a coupling between two probability spaces (Ω,A,π)(\Omega,{\cal A},\pi) and (Ω′,A′,π′)(\Omega^{\prime},{\cal A}^{\prime},\pi^{\prime}) is a probability distribution on A×A′{\cal A}\times{\cal A}^{\prime} whose marginals are π\pi and π′\pi^{\prime}, respectively. A coupling between two graphons means a coupling between their underlying probability spaces. Let H=(Ω,A,π,W)H=(\Omega,{\cal A},\pi,W) be a graphon, and let X1,…,XnX_{1},\dots,X_{n} be independent random samples from π\pi. Then we have

Let H=(Ω,A,π,W)H=(\Omega,{\cal A},\pi,W) and H′=(Ω′,A′,π′,W′)H^{\prime}=(\Omega^{\prime},{\cal A}^{\prime},\pi^{\prime},W^{\prime}) two graphons, and suppose that there exists a coupling γ\gamma between them such that W(X1,Y1)=W′(X2,Y2)W(X_{1},Y_{1})=W^{\prime}(X_{2},Y_{2}) holds with probability 11 for two independent samples (X1,X2)(X_{1},X_{2}) and (Y1,Y2)(Y_{1},Y_{2}) from γ\gamma. In this case clearly (4) holds for every graph FF. As we will see, Theorem 2.1 implies that in the Lebesguian case the converse also holds.

For two functions W,W′∈WW,W^{\prime}\in{\cal W} the following are equivalent.

(a) For every simple graph FF, t(F,W′)=t(F,W)t(F,W^{\prime})=t(F,W).

(b) For every multigraph FF, t(F,W′)=t(F,W)t(F,W^{\prime})=t(F,W).

(c) There exists a function U∈WU\in{\cal W} and two measure preserving maps φ,ψ: →\varphi,\psi:~\to such that W=UφW=U^{\varphi} and W′=UψW^{\prime}=U^{\psi} almost everywhere.

(d) There exist two measure preserving maps φ,ψ: →\varphi,\psi:~\to such that (W′)φ=Wψ(W^{\prime})^{\varphi}=W^{\psi} almost everywhere.

(e) There exists a probability measure γ\gamma on ×\times such that each marginal of γ\gamma is the Lebesgue measure, and if (X,X′)(X,X^{\prime}) and (Y,Y′)(Y,Y^{\prime}) are two independent samples from γ\gamma, then W(X,Y)=W′(X′,Y′))W(X,Y)=W^{\prime}(X^{\prime},Y^{\prime})) with probability 11.

3 Examples

The property of being twin-free is crucial for Theorem 2.1 (i).

Let ϕk: →\phi_{k}:~\to be the map ϕk(x)=kx(mod1)\phi_{k}(x)=kx\pmod{1}. For any function W∈WW\in{\cal W}, the functions Wϕ2W^{\phi_{2}} and Wϕ3W^{\phi_{3}} define graphons that are weakly isomorphic but in general not isomorphic. Indeed, for a “generic” WW (say W=xyW=xy), every point has two twins in Wϕ2W^{\phi_{2}} and three twins in Wϕ3W^{\phi_{3}}. The pair of maps in Corollary 2.2 (c) go from WW, while in (d), they go into (Wϕ3)ϕ2=(Wϕ2)ϕ3=Wϕ6(W^{\phi_{3}})^{\phi_{2}}=(W^{\phi_{2}})^{\phi_{3}}=W^{\phi_{6}}.

Our next example shows that the Lebesgue property is also needed.

Let Ω\Omega be a subset of $withinnerLebesguemeasurewith inner Lebesgue measure0andouterLebesguemeasureand outer Lebesgue measure1,andlet, and let\Omega^{\prime}beitscomplement.Letbe its complement. Let{\cal A}andand{\cal A}^{\prime}consistofthetracesofLebesguemeasurablesetsonconsist of the traces of Lebesgue measurable sets on\Omegaandand\Omega^{\prime},respectively.Let, respectively. LetWandandW^{\prime}betherestrictionsofthefunctionbe the restrictions of the functionxytoto\Omega\times\Omegaandand\Omega^{\prime}\times\Omega^{\prime},respectively.Theidenticalembeddings, respectively. The identical embeddings\varphi:~\Omega\toandand\varphi^{\prime}:~\Omega^{\prime}\toaremeasurepreserving,andhenceare measure preserving, and henceH=(\Omega,{\cal A},\pi,W)andandH^{\prime}=(\Omega^{\prime},{\cal A}^{\prime},\pi^{\prime},W^{\prime})areweaklyisomorphic.Butforeveryare weakly isomorphic. But for everyx\in\Omega$, we have

which shows that there is no way to “match up” the points in Ω\Omega and Ω′\Omega^{\prime} to get an isomorphism mod 00. The same example shows that conclusions (d), (e) in Corollary 2.2 could not be extended to the non-Lebesgue case either.

Isomorphism

The main goal of this section is to describe how a general graphon can be transformed into a twin-free Lebesguian graphon. To this end, we have to recall some basic notions from measure theory (mostly because their usage does not seem standard), and then discuss different “isomorphism-like” mappings between graphons.

For a set S{\cal S} of subsets of a set Ω\Omega, we denote by σ(S)\sigma({\cal S}) the σ\sigma-algebra generated by S{\cal S}. We call a σ\sigma-algebra A{\cal A} countably generated if there is countable set S⊆AS\subseteq{\cal A} such that σ(S)=A\sigma({\cal S})={\cal A}. This is equivalent to the existence of a sequence A1⊆A2⊆…{\cal A}_{1}\subseteq{\cal A}_{2}\subseteq\dots of finite σ\sigma-algebras whose union generates A{\cal A}.

We say that a set S⊆A{\cal S}\subseteq{\cal A} is a basis for the probability space (Ω,A,π)(\Omega,{\cal A},\pi), if σ(S)\sigma(S) is dense in A{\cal A}, i.e., for every X∈AX\in{\cal A} there is a Y∈σ(S)Y\in\sigma({\cal S}) such that π(X△Y)=0\pi(X\triangle Y)=0.

Given sets A⊂ΩA\subset\Omega and two points x,y∈Ωx,y\in\Omega, we say that AA separates xx and yy if ∣{x,y}∩A∣=1|\{x,y\}\cap A|=1. We say that a set S{\cal S} of subsets of Ω\Omega separates xx and yy if there exists a set A∈SA\in{\cal S} that separates xx and yy. This leads to a partition P[S]{\cal P}[{\cal S}] of Ω\Omega by placing two points in the same class if and only if they are not separated by S{\cal S}. We say that S{\cal S} is separating if it separates any two points in Ω\Omega. We’ll say that a graphon is separating if its underlying σ\sigma-algebra is separating.

A probability space (Ω′,A′,π′)(\Omega^{\prime},{\cal A}^{\prime},\pi^{\prime}) is called a full subspace of (Ω,A,π)(\Omega,{\cal A},\pi) if Ω′\Omega^{\prime} is a (not necessarily measurable) subset of Ω\Omega of external measure 11, A′={A∩Ω′∣A∈A}{\cal A}^{\prime}=\{A\cap\Omega^{\prime}\mid A\in{\cal A}\}, and π′(A∩Ω′))=π(A)\pi^{\prime}(A\cap\Omega^{\prime}))=\pi(A) for all A∈AA\in{\cal A}.

Consider two probability spaces (Ω,A,π)(\Omega,{\cal A},\pi) and (Ω′,A′,π′)(\Omega^{\prime},{\cal A}^{\prime},\pi^{\prime}) and a measure preserving map ϕ:Ω→Ω′\phi:\Omega\to\Omega^{\prime}. The map ϕ\phi is called an embedding of the first space into the second if ϕ\phi is an isomorphism between (Ω,A,π)(\Omega,{\cal A},\pi) and a full subspace of (Ω′,A′,π′)(\Omega^{\prime},{\cal A}^{\prime},\pi^{\prime}). We call ϕ\phi an embedding of a graphon H=(Ω,A,π,W)H=(\Omega,{\cal A},\pi,W) into a graphon H′=(Ω′,A′,π′,W′)H^{\prime}=(\Omega^{\prime},{\cal A}^{\prime},\pi^{\prime},W^{\prime}) if ϕ\phi is an embedding of (Ω,A,π)(\Omega,{\cal A},\pi) into (Ω′,A′,π′)(\Omega^{\prime},{\cal A}^{\prime},\pi^{\prime}) and (W′)ϕ=W(W^{\prime})^{\phi}=W almost everywhere.

2 Push-Forward and Quotients

Let (Ω,A,π)(\Omega,{\cal A},\pi) and (Ω′,A′,π′)(\Omega^{\prime},{\cal A}^{\prime},\pi^{\prime}) be probability spaces and let ϕ: Ω→Ω′\phi:~\Omega\to\Omega^{\prime} be a measure preserving map. We have described how to “pull back” a graphon on (Ω′,A′,π′)(\Omega^{\prime},{\cal A}^{\prime},\pi^{\prime}) to a (weakly isomorphic) graphon on (Ω,A,π)(\Omega,{\cal A},\pi). It is also possible to “push-forward” a graphon H=(Ω,A,π,W)H=(\Omega,{\cal A},\pi,W) to a graphon (Ω′,A′,π′,Wϕ)(\Omega^{\prime},{\cal A}^{\prime},\pi^{\prime},W_{\phi}). This is defined by the requirement that

for all A1′,A2′∈A′A_{1}^{\prime},A_{2}^{\prime}\in{\cal A}^{\prime}. The next lemma states that the “push-forward” WϕW_{\phi} is well defined, and that (Wϕ)ϕ(W_{\phi})^{\phi} is a certain conditional expectation of WW.

Let (Ω,A,π)(\Omega,{\cal A},\pi) and (Ω′,A′,π′)(\Omega^{\prime},{\cal A}^{\prime},\pi^{\prime}) be probability spaces, let ϕ:Ω→Ω′\phi:\Omega\to\Omega^{\prime} be a measure preserving map, and let WW be a graphon on (Ω,A,π)(\Omega,{\cal A},\pi).

(ii) Let Aϕ=ϕ−1(A′){\cal A}_{\phi}=\phi^{-1}({\cal A}^{\prime}). Then (Wϕ)ϕ=E(W∣Aϕ×Aϕ)(W_{\phi})^{\phi}={\sf E}(W\mid{\cal A}_{\phi}\times{\cal A}_{\phi}) almost everywhere.

(iii) If ϕ\phi is an embedding of (Ω,A,π)(\Omega,{\cal A},\pi) into (Ω′,A′,π′)(\Omega^{\prime},{\cal A}^{\prime},\pi^{\prime}), then (Wϕ)ϕ=W(W_{\phi})^{\phi}=W almost everywhere.

(i) By linearity, it is easy to see that we can restrict ourselves to the case where WW takes values in $.Defineameasure. Define a measure\muonon{\cal A}^{\prime}\times{\cal A}^{\prime}$ by

for A1′,A2′∈AA_{1}^{\prime},A_{2}^{\prime}\in{\cal A}. With this definition, we have that

implying in particular that μ\mu is absolutely continuous with respect to π′×π′\pi^{\prime}\times\pi^{\prime}. Hence the Radon-Nikodym derivative,

is well defined. Using the above bound once more, together with the fact that μ(A1×A2)=μ(A2×A1)\mu(A_{1}\times A_{2})=\mu(A_{2}\times A_{1}), we furthermore have that

almost everywhere. Changing WϕW_{\phi} on a set of measure zero, we may assume that these relations hold everywhere. To define WϕW_{\phi} for a general bounded function WW, we use linearity.

(ii) Let A1,A2∈AϕA_{1},A_{2}\in{\cal A}_{\phi}, i.e., let A1=ϕ−1(A1′)A_{1}=\phi^{-1}(A_{1}^{\prime}) and A2=ϕ−1(A2′)A_{2}=\phi^{-1}(A_{2}^{\prime}) for some A1′,A2′∈A′A_{1}^{\prime},A_{2}^{\prime}\in{\cal A}^{\prime}. By the definition of WϕW_{\phi}, the fact that ϕ\phi is measure preserving, and the definition of (Wϕ)ϕ(W_{\phi})^{\phi}, we have that

This implies that (Wϕ)ϕ=E(W∣Aϕ×Aϕ)(W_{\phi})^{\phi}={\sf E}(W\mid{\cal A}_{\phi}\times{\cal A}_{\phi}) almost everywhere.

(iii) Since ϕ\phi is an isomorphism between (Ω,A,π)(\Omega,{\cal A},\pi) and a subspace of (Ω′,A′,π′)(\Omega^{\prime},{\cal A}^{\prime},\pi^{\prime}), we know that given any A∈AA\in{\cal A}, we can find an A′∈A′A^{\prime}\in{\cal A}^{\prime} such that ϕ(A)=A′∩ϕ(Ω)\phi(A)=A^{\prime}\cap\phi(\Omega). But then ϕ−1(A′)=ϕ−1(ϕ(A))=A\phi^{-1}(A^{\prime})=\phi^{-1}(\phi(A))=A, proving that A∈AϕA\in{\cal A}_{\phi}. Thus Aϕ=A{\cal A}_{\phi}={\cal A}, which implies that (Wϕ)ϕ=W(W_{\phi})^{\phi}=W almost everywhere. ∎

We can use the “push-forward” construction to define quotients of graphons. Let H=(Ω,A,π,W)H=(\Omega,{\cal A},\pi,W) be a graphon, let P{\cal P} be an arbitrary partition of Ω\Omega into disjoint sets, and for x∈Ωx\in\Omega, let [x][x] denote the class in P{\cal P} that contains the point xx. We then define a graphon H/P=(Ω/P,A/P,π/P,W/P)H/{\cal P}=(\Omega/{\cal P},{\cal A}/{\cal P},\pi/{\cal P},W/{\cal P}) and a measure preserving map ϕ:Ω→Ω/P\phi:\Omega\to\Omega/{\cal P} as follows: the points in Ω/P\Omega/{\cal P} are the classes of the partition P{\cal P}, ϕ\phi is the map ϕ:x↦[x]\phi:x\mapsto[x], A/P{\cal A}/{\cal P} is the σ\sigma-algebra consisting of the sets A′⊂Ω/PA^{\prime}\subset\Omega/{\cal P} such that ϕ−1(A′)∈A\phi^{-1}(A^{\prime})\in{\cal A}, and (π/P)(A′):=π(ϕ−1(A′))(\pi/{\cal P})(A^{\prime}):=\pi(\phi^{-1}(A^{\prime})). Then ϕ\phi is measure preserving, and the function W/P=WϕW/{\cal P}=W_{\phi} is defined by (5).

3 Reductions

Now we are able to state the theorem that allows us to reduce every graphon to a twin-free Lebesguian graphon.

(i) Let H=(Ω,A,π,W)H=(\Omega,{\cal A},\pi,W) be a graphon. Then one can change the value of WW on a set of π×π\pi\times\pi-measure 00 to get a strong graphon.

(ii) Let H=(Ω,A,π,W)H=(\Omega,{\cal A},\pi,W) be a graphon. Then there exists a countably generated σ\sigma-algebra A0⊂A{\cal A}_{0}\subset{\cal A} such that WW is (A0×A0)({\cal A}_{0}\times{\cal A}_{0})-measurable.

(iii) Let H=(Ω,A,π,W)H=(\Omega,{\cal A},\pi,W) be a graphon. Then the graphon H/P[A]H/{\cal P}[{\cal A}] is separating. If HH is countably generated, then so is H/P[A]H/{\cal P}[{\cal A}].

(iv) Let H=(Ω,A,π,W)H=(\Omega,{\cal A},\pi,W) be a separating graphon on a probability space with a countable basis. Then the completion of HH can be embedded into a Lebesguian graphon.

(v) Let H=(Ω,A,π,W)H=(\Omega,{\cal A},\pi,W) be a graphon, and let P{\cal P} be the partition into the twin-classes of HH. Then H/PH/{\cal P} is almost twin-free. If HH is Lebesguian, then H/PH/{\cal P} is Lebesguian as well. Furthermore, the projection H→H/PH\to H/{\cal P} is a weak isomorphism.

Every graphon has a weak isomorphism into a strong Lebesguian graphon.

The proof of this theorem (which is not hard, but technical) will be given in the rest of this section.

Let H=(Ω,A,π,W)H=(\Omega,{\cal A},\pi,W) be a graphon, and let W′=E(W∣A×A)W^{\prime}={\sf E}(W\mid{\cal A}\times{\cal A}). Then W′W^{\prime} is A×A{\cal A}\times{\cal A}-measurable, and changing W′W^{\prime} on a set of measure 00, we may assume that W′W^{\prime} is symmetric and bounded. Moreover, ∫A×A′(W′−W)=0\int_{A\times A^{\prime}}(W^{\prime}-W)=0 for all A,A′∈AA,A^{\prime}\in{\cal A}, which implies that ∫S(W′−W)=0\int_{S}(W^{\prime}-W)=0 for all sets SS in the completion of A×A{\cal A}\times{\cal A}, so W=W′W=W^{\prime} almost everywhere. These observations prove part (i) of the Theorem.

3.2 Countable generation

We prove a simple lemma, which implies Theorem 3.2(ii), and will also be used at several other places (Sections 4.1 and 5.2).

Let C{\cal C} be the set of bounded, (A×A′)({\cal A}\times{\cal A}^{\prime})-measurable functions WW for which the statement of the lemma is true. The set C{\cal C} is clearly a vector space that contains the constant function 11 as well as the indicator functions of all rectangles A×BA\times B with A∈AA\in{\cal A} and B∈A′B\in{\cal A}^{\prime}. If is further not hard to show that if (Wk)(W_{k}) is a sequence of non-negative functions in C{\cal C} and Wk↑WW_{k}\uparrow W for a bounded function WW, then the limiting function WW is in C{\cal C} as well. By the monotone class theorem (see, e.g., Theorem 3.14 in ), we conclude that C{\cal C} contains all bounded functions which are measurable with respect to the σ\sigma-algebra generated by the rectangles A×BA\times B, i.e., the σ\sigma-algebra A×A′{\cal A}\times{\cal A}^{\prime}. ∎

3.3 Merging inseparable elements

If we identify elements in the same class of the partition P[A]{\cal P}[{\cal A}], we get a σ\sigma-algebra which is isomorphic under the obvious map. This implies (iii) of Theorem 3.2.

3.4 Lebesgue property

Consider a separating graphon H=(Ω,A,π,W)H=(\Omega,{\cal A},\pi,W), and assume that A{\cal A} is generated by the countable set S{\cal S}. Then S{\cal S} is a basis for the completion of (Ω,A,π)(\Omega,{\cal A},\pi). We invoke the fact (see e.g. , Section 2.2) that any separating complete probability space with a countable basis can be embedded into a Lebesgue space. Thus there exists an embedding ψ\psi of the completion of (Ω,A,π)(\Omega,{\cal A},\pi) into a Lebesgue space (Ω′,L′,λ′)(\Omega^{\prime},{\cal L}^{\prime},\lambda^{\prime}). Let W′W^{\prime} be the push-forward of WW, W′=WψW^{\prime}=W_{\psi}. By Lemma 3.1, we have that (W′)ψ=W(W^{\prime})^{\psi}=W almost everywhere, which shows that ψ\psi is an embedding of the completion of HH into (Ω′,L′,λ′,W′)(\Omega^{\prime},{\cal L}^{\prime},\lambda^{\prime},W^{\prime}). This proves part (iv) of Theorem 3.2.

3.5 Partitions into Twin-Classes

We prove (v) in Theorem 3.2. We may assume that A{\cal A} is countably generated. Indeed, by Lemma 3.4, we can replace A{\cal A} by a countably generated σ\sigma-algebra A0{\cal A}_{0}. This does not change the relation of being twins: Two points x,x′∈Ωx,x^{\prime}\in\Omega are twins if and only if the set Ax,x′={y∈Ω:W(x,y)=W(x,y′)}A_{x,x^{\prime}}=\{y\in\Omega:W(x,y)=W(x,y^{\prime})\} has measure 11. Since WW is measurable with respect to A0×A0{\cal A}_{0}\times{\cal A}_{0}, the set Ax,x′A_{x,x^{\prime}} lies in A0⊂A{\cal A}_{0}\subset{\cal A}, implying that xx and x′x^{\prime} are twins with respect to HH if and only if they are twins with respect to H0H_{0}.

Let AP{\cal A}_{\cal P} consists of those sets in A{\cal A} that do not separate any pair of twin points. Clearly AP{\cal A}_{\cal P} is a σ\sigma-algebra.

WW is almost AP×AP{\cal A}_{\cal P}\times{\cal A}_{\cal P}-measurable.

Let W~=E(W∣AP×AP)\widetilde{W}={\sf E}(W\mid{\cal A}_{\cal P}\times{\cal A}_{\cal P}). We want to prove that

for all A,B∈AA,B\in{\cal A}. Define the functions

Since UA(y)=UA(z)U_{A}(y)=U_{A}(z) if y,zy,z are twins, the function UAU_{A} is AP{\cal A}_{\cal P}-measurable, similarly for VAV_{A}, and obviously for gAg_{A}. Repeatedly using the fact that ∫fg=∫fE(g∣A0)\int fg=\int f{\sf E}(g\mid{\cal A}_{0}) if ff is A0{\cal A}_{0}-measurable, this implies

(where the last equality follows since W~\widetilde{W} is AP×AP{\cal A}_{\cal P}\times{\cal A}_{\cal P}-measurable). This implies (8) and completes the proof of Claim 1.

Let W~=E(W∣AP×AP)\widetilde{W}={\sf E}(W\mid{\cal A}_{\cal P}\times{\cal A}_{\cal P}) as before, then HP=(Ω,AP,π,W~)H_{\cal P}=(\Omega,{\cal A}_{\cal P},\pi,\widetilde{W}) is a graphon, which is clearly weakly isomorphic to (Ω,A,π,W)(\Omega,{\cal A},\pi,W). Let NN be the set of points x∈Ωx\in\Omega for which {y∈Ω: W~(x,y)≠W(x,y)}\{y\in\Omega:~\widetilde{W}(x,y)\not=W(x,y)\} has positive measure. Then clearly NN is a null set, and two points x,x′∈Ω∖Nx,x^{\prime}\in\Omega\setminus N are twins in HH if and only if they are twins in HPH_{\cal P}. The graphon H/PH/{\cal P} is obtained from HPH_{\cal P} by identifying indistinguishable elements, which implies that H/PH/{\cal P} is twin-free.

To prove that H/PH/{\cal P} is Lebesguian if HH is Lebesguian, we invoke the fact (established in Section 3.2 of ) that (Ω/P,A/P,π/P)(\Omega/{\cal P},{\cal A}/{\cal P},\pi/{\cal P}) is a Lebesgue space provided (Ω,A,π)(\Omega,{\cal A},\pi) is a Lebesgue space and there exists a countable set S⊆A{\cal S}\subseteq{\cal A} that separates two points if and only they are in different partition classes.

To construct such a set S{\cal S}, let T{\cal T} be a countable set generating A{\cal A}, closed under finite intersections. For A∈AA\in{\cal A} and x∈Ωx\in\Omega, let

Since WW is a bounded A×A{\cal A}\times{\cal A}-measurable function, the function A↦μx(A)A\mapsto\mu_{x}(A) is a finite measure for all x∈Ωx\in\Omega, while the function x↦μx(A)x\mapsto\mu_{x}(A) is a A{\cal A}-measurable function on Ω\Omega for all A∈AA\in{\cal A}.

By definition, x,x′∈Ωx,x^{\prime}\in\Omega are twins iff the set {y∈Ω:W(x,y)=W(x,y′)}\{y\in\Omega:W(x,y)=W(x,y^{\prime})\} has measure zero. This is equivalent to the condition that μx(A)=μx′(A)\mu_{x}(A)=\mu_{x^{\prime}}(A) for all A∈AA\in{\cal A}. Since the measure μx(⋅)\mu_{x}(\cdot) on A{\cal A} is uniquely determined by the sets in T{\cal T}, we have that xx and x′x^{\prime} are twins if and only if μx(T)=μx′(T)\mu_{x}(T)=\mu_{x^{\prime}}(T) for all T∈TT\in{\cal T}.

For every T∈TT\in{\cal T} and rational number rr, consider the sets ST,r={x∈Ω: μx(T)≥r}S_{T,r}=\{x\in\Omega:~\mu_{x}(T)\geq r\}. There is a countable number of these. Furthermore, if xx and x′x^{\prime} are twins, then they belong to exactly the same sets ST,rS_{T,r}; if they are not twins, then there is a T∈TT\in{\cal T} such that μx(T)≠μx′(T)\mu_{x}(T)\not=\mu_{x^{\prime}}(T), and for any rational number between μx(T)\mu_{x}(T) and μx′(T)\mu_{x^{\prime}}(T), the set ST,rS_{T,r} separates xx and x′x^{\prime}.

4 Isomorphism and Weak Isomorphism

We conclude this section with relating isomorphism and weak isomorphism.

Let Hi=(Ωi,Ai,πi,Wi)H_{i}=(\Omega_{i},{\cal A}_{i},\pi_{i},W_{i}) be graphons with the Lebesgue property (i=1,2i=1,2), and let ϕ: Ω1→Ω2\phi:~\Omega_{1}\to\Omega_{2} be measure-preserving. If H1H_{1} is almost twin-free, and W1=W2ϕW_{1}=W_{2}^{\phi} almost everywhere, then ϕ\phi is an isomorphism mod 00, so in particular H1≅H2H_{1}\cong H_{2}.

and let N1=Ω1∖Ω1′N_{1}=\Omega_{1}\setminus\Omega_{1}^{\prime}. Then π1(N1)=0\pi_{1}(N_{1})=0 by Fubini and our assumption that W1=W2ϕW_{1}=W_{2}^{\phi} almost everywhere.

Let N1′N_{1}^{\prime} be a nullset such that all twin-classes of H1H_{1} have at most one point in Ω1∖N1′\Omega_{1}\setminus N_{1}^{\prime}, and let ϕ′\phi^{\prime} to be the restriction of ϕ\phi to Ω1′∖N1′\Omega_{1}^{\prime}\setminus N_{1}^{\prime}. Then ϕ′\phi^{\prime} is injective: indeed, if x1,x2∈Ω1′∖N1′x_{1},x_{2}\in\Omega_{1}^{\prime}\setminus N_{1}^{\prime} and ϕ(x1)=ϕ(x2)\phi(x_{1})=\phi(x_{2}), then W1(x1,y)=W2(ϕ(x1),ϕ(y))=W2(ϕ(x2),ϕ(y))=W1(x2,y)W_{1}(x_{1},y)=W_{2}(\phi(x_{1}),\phi(y))=W_{2}(\phi(x_{2}),\phi(y))=W_{1}(x_{2},y) for almost all yy by the definition of Ω1′\Omega_{1}^{\prime}, hence x1x_{1} and x2x_{2} are twins, a contradiction. As shown in , Section 2.5, an injective measure preserving map between Lebesgue spaces has a measurable inverse defined almost everywhere. This implies that ϕ′:Ω1′∖N1′→Ω2\phi^{\prime}:\Omega_{1}^{\prime}\setminus N_{1}^{\prime}\to\Omega_{2} is an isomorphism mod 00, which shows that ϕ\phi is an isomorphism mod 00 as well. ∎

If two twin-free graphons with the Lebesgue property are weakly isomorphic, then they are isomorphic.

Canonical Ensembles

We could try to construct a “canonical form” of a graphon by assigning “tags” to the points in Ω\Omega. For example, we could tag a point xx with its marginal d(x)=∫W(x,y) dπ(y)d(x)=\int W(x,y)\,d\pi(y), or by the sequence of marginals of higher powers of WW. This, however, would not work: for example, there could be a transitive group of measure-preserving permutations of Ω\Omega leaving WW invariant, and then all points would still have the same tag.

To break the symmetry, we select an infinite sequence α=(a1,a2,… )\alpha=(a_{1},a_{2},\dots) of points in Ω\Omega, which we call anchor points. Now we can tag each point x∈Ωx\in\Omega with the sequence

We will show that if α1,α2,…\alpha_{1},\alpha_{2},\dots are taken i.i.d. at random with distribution π\pi then with probability one, then HαH_{\alpha} is isomorphic mod 00 to the original graphon HH (see Section 4.2 for details). So using an infinite sequence of independent random points as anchor points, the tags of the points contain all information about the points.

These tags are almost canonical, except for the choice of the sequence α\alpha. So instead of a canonical form, we get a “canonical ensemble”, a probability distribution (Hα)(H_{\alpha}) of graphons such that H≅HαH\cong H_{\alpha} for almost all α\alpha, and two graphons are isomorphic if and only if their ensembles can be coupled so that corresponding graphons are isomorphic.

To prove Theorem 2.1 (i), we will therefore have to show that if HH and H′H^{\prime} satisfy (4), then we can “couple” the choice of anchor points α\alpha in HH and β\beta in H′H^{\prime} so that Hα≅Hβ′H_{\alpha}\cong H^{\prime}_{\beta}, thus yielding an isomorphism of HH and H′H^{\prime}. This second step in the proof will be carried out in Section 5.3.

The next technical lemma will be important in the construction of “canonical ensembles”.

By Lemma 3.4, we may assume that A{\cal A} and A′{\cal A}^{\prime} are countably generated. Let A1′⊂A2′⊂…{\cal A}^{\prime}_{1}\subset{\cal A}^{\prime}_{2}\subset\dots and A1′⊂A2′⊂…{\cal A}^{\prime}_{1}\subset{\cal A}^{\prime}_{2}\subset\dots be a sequence of finite σ\sigma-algebras with σ(∪nAn)=A\sigma(\cup_{n}{\cal A}_{n})={\cal A} and σ(∪nAn′)=A′\sigma(\cup_{n}{\cal A}^{\prime}_{n})={\cal A}^{\prime}, and let Pn′P_{n}^{\prime} denote the partition of Ω′\Omega^{\prime} into the atoms of An′{\cal A}^{\prime}_{n}. For y∈S∈Pn′y\in S\in P_{n}^{\prime} with π′(S)>0\pi^{\prime}(S)>0, define

We define Un,m(x,y)=0U_{n,m}(x,y)=0 if y∈S∈Pn′y\in S\in P_{n}^{\prime} with π′(S)=0\pi^{\prime}(S)=0.

First we prove that for every n≥1n\geq 1, every A∈AA\in{\cal A} and A′∈An′A^{\prime}\in{\cal A}^{\prime}_{n}, we have with probability 11

It suffices to prove this in the case when A′=S∈Pn′A^{\prime}=S\in P_{n}^{\prime} and π′(S)>0\pi^{\prime}(S)>0. Then for every y0∈A′y_{0}\in A^{\prime}, we have

Since both sides are independent of y0∈Sy_{0}\in S, integrating over y0∈Sy_{0}\in S equation (11) follows.

The number of choices of nn, A∈∪kAkA\in\cup_{k}{\cal A}_{k} and A′∈An′A^{\prime}\in{\cal A}^{\prime}_{n} is countable, and hence it follows that with probability 1, (11) holds for all n≥1n\geq 1, every A∈∪kAkA\in\cup_{k}{\cal A}_{k} and A′∈An′A^{\prime}\in{\cal A}^{\prime}_{n}. Since ∪kAk\cup_{k}{\cal A}_{k} is dense in A{\cal A}, this implies that (11) holds for all n≥1n\geq 1, every A∈AA\in{\cal A} and A′∈An′A^{\prime}\in{\cal A}^{\prime}_{n}.

From now on, we suppose that the choice of the YiY_{i} is such that this holds.

For a fixed nn, the indices mm have a subsequence m1<m2<…m_{1}<m_{2}<\dots such that Un,mjU_{n,m_{j}} converges to some function UnU_{n} in the weak-∗*-topology of L∞(A0×An′)L_{\infty}({\cal A}_{0}\times{\cal A}^{\prime}_{n}). Hence by (11),

for all n≥1n\geq 1, every A∈AA\in{\cal A} and A′∈An′A^{\prime}\in{\cal A}^{\prime}_{n}. Thus UnU_{n} is a representative of E(W∣A×An′){\sf E}(W\mid{\cal A}\times{\cal A}^{\prime}_{n}). Since UnU_{n} is A0×An′{\cal A}_{0}\times{\cal A}^{\prime}_{n} measurable, it is also a representative of E(W∣A0×An′){\sf E}(W\mid{\cal A}_{0}\times{\cal A}^{\prime}_{n}). This shows that for every n≥1n\geq 1 we have

By Levy’s Upward Theorem, the left hand side of (12) tends to E(W∣A×A′)=W{\sf E}(W\mid{\cal A}\times{\cal A}^{\prime})=W almost everywhere. The right hand side of (12) tends to E(W∣A0×A′){\sf E}(W\mid{\cal A}_{0}\times{\cal A}^{\prime}) almost everywhere, so W=E(W∣A0×A′)W={\sf E}(W\mid{\cal A}_{0}\times{\cal A}^{\prime}) almost everywhere, which proves the Lemma. ∎

We formulate a couple of corollaries, the first of which is immediate:

Let (Ω,A,π,W)(\Omega,{\cal A},\pi,W) be a graphon, and let X1,X2,…X_{1},X_{2},\dots be independent random points from Ω\Omega. Let A0⊆A{\cal A}_{0}\subseteq{\cal A} be the (random) σ\sigma-algebra generated by the functions W(⋅,Xk)W(\cdot,X_{k}). Then with probability 11, WW is almost A0×A0{\cal A}_{0}\times{\cal A}_{0}-measurable.

Let A1{\cal A}_{1} denote the σ\sigma-algebras generated by the functions W(⋅,X2k)W(\cdot,X_{2k}). Clearly A1⊆A0{\cal A}_{1}\subseteq{\cal A}_{0}. By Lemma 4.1, WW is almost A1×A{\cal A}_{1}\times{\cal A} measurable with probability 11, so we can change it on a set of measure 00 to get an A1×A{\cal A}_{1}\times{\cal A} measurable function W′W^{\prime}. Let A2′{\cal A}_{2}^{\prime} be the σ\sigma-algebras generated by the functions W′(X2k+1,⋅)W^{\prime}(X_{2k+1},\cdot). Applying the lemma again, we get that W′W^{\prime} is almost A1×A2′{\cal A}_{1}\times{\cal A}_{2}^{\prime} measurable. With probability 11, each function W(X2k+1,⋅)W(X_{2k+1},\cdot) differs from W′(X2k+1,⋅)W^{\prime}(X_{2k+1},\cdot) on a set of measure 00 only (since the X2k+1X_{2k+1} are independent of A1{\cal A}_{1}), and so A2′⊆σ(A0){\cal A}_{2}^{\prime}\subseteq\sigma({\cal A}_{0}). So W′W^{\prime} is A0×σ(A0){\cal A}_{0}\times\sigma({\cal A}_{0}) measurable, which implies that W′W^{\prime}, and hence WW, are almost A0×A0{\cal A}_{0}\times{\cal A}_{0} measurable. ∎

2 Anchor Sequences

Let Aα{\cal A}_{\alpha} denote the σ\sigma-algebra of subsets of Ω\Omega of the form Φα−1(A)\Phi_{\alpha}^{-1}(A), where A∈LA\in{\cal L}. Note that Aα⊆A{\cal A}_{\alpha}\subseteq{\cal A} by the fact that Φα\Phi_{\alpha} is measurable. Further, almost by definition, Aα{\cal A}_{\alpha} is the smallest sub-σ\sigma-algebra of A{\cal A} such that all the functions W(⋅,αi)W(\cdot,\alpha_{i}) are measurable. As a consequence, we may apply Lemma 4.3 to conclude that for almost all α\alpha, WW is almost Aα×Aα){\cal A}_{\alpha}\times{\cal A}_{\alpha})-measurable, which by Lemma 3.1 gives that W=WαΦαW=W_{\alpha}^{\Phi_{\alpha}} almost everywhere. ∎

Let HH be a twin free graphon with the Lebesgue property. If α\alpha is regular, then Φα\Phi_{\alpha} is an isomorphism mod 00 and Hα≅HH_{\alpha}\cong H.

Coupling

We recall some notions from . A partially labeled graph is a finite graph in which some of the nodes are labeled by different nonnegative integers. Two partially labeled graphs are isomorphic, if there is a label-preserving isomorphism between them. A kk-labeled graph is a partially labeled graph with labels 1,…,k1,\dots,k.

Let F1F_{1} and F2F_{2} be two partially labeled graphs. Their product F1F2F_{1}F_{2} is defined as follows: we take their disjoint union, and then identify nodes with the same label (retaining the labels, and any multiple edges which this might create). For two unlabeled graphs, F1F2F_{1}F_{2} is their disjoint union. Clearly this multiplication is associative and commutative.

It is easy to see that if F1F_{1} and F2F_{2} are two kk-labeled graphs, then

2 Multiple Edges

Let H=(Ω,A,π,W)H=(\Omega,{\cal A},\pi,W) and H′=(Ω′,A′,π′,W′)H^{\prime}=(\Omega^{\prime},{\cal A}^{\prime},\pi^{\prime},W^{\prime}) be two graphons, and assume that t(F,H)=t(F,H′)t(F,H)=t(F,H^{\prime}) for every simple graph FF. Then t(F,H)=t(F,H′)t(F,H)=t(F,H^{\prime}) for every multigraph FF.

We use induction on the number of parallel edges in FF. Suppose that FF has two nodes, say ii and jj, connected by more than one edge. Let FkF_{k} denote the multigraph obtained from FF by subdividing one of these edges by k−1k-1 new nodes. Let F′F^{\prime} denote the multigraph obtained by removing one copy of the edge ijij. So F1=FF_{1}=F, but for k>1k>1, FkF_{k} has fewer parallel edges than FF, and so we may assume that

holds for every k≥2k\geq 2. We consider all the multigraphs FkF_{k} and F′F^{\prime} as 22-labeled graphs, with ii and jj labeled 11 and 22.

Since FkF_{k} can be thought of as the product of F′F^{\prime} and a path Pk+1P_{k+1} with k+1k+1 nodes (the endpoints labeled), we can write

The first factor inside the integral can be expressed as

which we can recognize as kk-th power of the kernel WW as an integral operator.

At this point, it will be useful to assume that HH and H′H^{\prime} are countably generated graphons (this can be done without loss of generality by Lemma 3.4). As a consequence, WW is an integral operator on the separable Hilbert space L2(Ω,A,π)L_{2}(\Omega,{\cal A},\pi), and since WW is bounded, this implies that WW is Hilbert-Schmidt and thus compact, which in turn implies that WW has a spectral representation:

be the spectral representation of W′W^{\prime}, then we get that for every k≥2k\geq 2,

are independent of kk. (The integrals exist since tx,y(F′,H)t_{x,y}(F^{\prime},H) is a bounded function of xx and yy.) It follows that in (14) everything must cancel, in other words, for every value cc,

(it is known that the sums on both sides have a finite number of terms, since the multiplicities of the eigenvalues are finite).

Now while (13) may not be true with equality, the “trace” with any other kernel gives an equation; in particular,

which shows that t(F,H)=t(F,H′)t(F,H)=t(F,H^{\prime}) as claimed. ∎

It will be convenient to assume that 0≤W,W′≤10\leq W,W^{\prime}\leq 1. If this does not hold, we can apply a linear transformation to the values of the functions, to get two functions W0W_{0} and W0′W_{0}^{\prime} with 0≤W0,W0′≤10\leq W_{0},W_{0}^{\prime}\leq 1. Expanding the product in the definition (3), t(F,W0)t(F,W_{0}) can be written as a linear combination of the values t(F′,W)t(F^{\prime},W), where F′F^{\prime} is a subgraph of FF. Thus t(F,W)=t(F,W′)t(F,W)=t(F,W^{\prime}) for every graph FF if and only if t(F,W0)=t(F,W0′)t(F,W_{0})=t(F,W^{\prime}_{0}) for every graph FF (where “graph” could mean either simple graph or multigraph). So (4) holds for W0W_{0} and W0′W^{\prime}_{0} if and only if it holds for WW and W′W^{\prime}. If we prove that this implies (Ω,A,π,W0)≅(Ω′,A′,π′,W0′)(\Omega,{\cal A},\pi,W_{0})\cong(\Omega^{\prime},{\cal A}^{\prime},\pi^{\prime},W^{\prime}_{0}), then H≅H′H\cong H^{\prime} follows trivially.

3 Coupling Anchor Sequences

The condition on the coupling is described in the following lemma.

Let H=(Ω,A,π,W)H=(\Omega,{\cal A},\pi,W) and H′=(Ω′,A′,π′,W′)H^{\prime}=(\Omega^{\prime},{\cal A}^{\prime},\pi^{\prime},W^{\prime}) be two graphons, and let α=(a1,a2,… )\alpha=(a_{1},a_{2},\dots) and β=(b1,b2,… )\beta=(b_{1},b_{2},\dots) be regular sequences for HH and H′H^{\prime}, respectively. Suppose that for every partially labeled multigraph FF,

Then λα=λβ′\lambda_{\alpha}=\lambda_{\beta}^{\prime} and Wα=Wβ′W_{\alpha}=W^{\prime}_{\beta} almost everywhere (with respect to λα=λβ′\lambda_{\alpha}=\lambda_{\beta}^{\prime}).

First, we show that λα=λβ′\lambda_{\alpha}=\lambda_{\beta}^{\prime}. These probability measures are defined on the σ\sigma-algebra L{\cal L} as the distribution measures of the random variables W(X,a1),W(X,a2),… )W(X,a_{1}),W(X,a_{2}),\dots) and W′(Y,b1),W′(Y,b2),… )W^{\prime}(Y,b_{1}),W^{\prime}(Y,b_{2}),\dots), where XX and YY are random points from π\pi and π′\pi^{\prime}, respectively. By Lemma 6.1 it therefore suffices to prove that these random variables have the same mixed moments.

Let (k1,k2,… )(k_{1},k_{2},\dots) be a sequence of nonnegative integers, of which only a finite number is nonzero; say ki=0k_{i}=0 for i>mi>m. Then

where FF is the star on m+1m+1 nodes, with the endnodes labeled 1,…,m1,\dots,m, and the edge between the center and endnode ii replaced by kik_{i} parallel edges. Similarly,

These numbers are equal by the hypothesis of the Lemma. This proves that λα=λβ′\lambda_{\alpha}=\lambda_{\beta}^{\prime}.

We can generate Z1Z_{1} by choosing independent uniform random points X′X^{\prime} and Y′Y^{\prime} from Ω\Omega, and letting X=Φα(X′)X=\Phi_{\alpha}(X^{\prime}) and Y=Φβ(Y′)Y=\Phi_{\beta}(Y^{\prime}). Since α\alpha is regular, we have that

where X′′X^{\prime\prime} and Y′′Y^{\prime\prime} are independent random points from π′\pi^{\prime}. To prove that Z1Z_{1} and Z2Z_{2} have the same distribution, it again suffices to prove that they have the same mixed moments.

A particular mixed moment is given by nonnegative integers (k1,k2,… )(k_{1},k_{2},\dots), (l1,l2,… )(l_{1},l_{2},\dots) and mm (of which only a finite number is nonzero; say ki=li=0k_{i}=l_{i}=0 for i>ni>n). Let us define the multigraph FF as follows. FF has two unlabeled nodes vxv_{x} and vyv_{y}, and nn further nodes labeled 1,…,n1,\dots,n. We connect vxv_{x} to ii by kik_{i} edges, vyv_{y} to ii by lil_{i} edges (i=1,…,ni=1,\dots,n), and vxv_{x} to vyv_{y} by mm edges. Then

These two numbers are the same by hypothesis. This completes the proof of the Lemma. ∎

Let H=(Ω,A,π,W)H=(\Omega,{\cal A},\pi,W) and H′=(Ω′,A′,π′,W′)H^{\prime}=(\Omega^{\prime},{\cal A}^{\prime},\pi^{\prime},W^{\prime}) be two Lebesguian graphons such that

holds almost surely for every partially labeled multigraph FF.

Let Fk{\cal F}_{k} be the set of kk-labeled multigraphs. We define recursively a coupling of sequences α∈Ωk\alpha\in\Omega^{k} with sequences β∈Ω′k\beta\in{\Omega^{\prime}}^{k} so that tα′(F,H)=tβ′(F,H′)t_{\alpha^{\prime}}(F,H)=t_{\beta^{\prime}}(F,H^{\prime}) holds almost surely for every F∈FkF\in{\cal F}_{k}. Let (a1,…,ak)(a_{1},\dots,a_{k}) and (b1,…,bk)(b_{1},\dots,b_{k}) be chosen from this coupled distribution. Consider two random points XX from π\pi and YY from π′\pi^{\prime}, and the random variables

with values in Fk+1^{{\cal F}_{k+1}}. We claim that the variables AA and BB have the same distribution. It suffices to show that AA and BB have the same mixed moments. Consider any moment of AA; in other words, let F1,…,Fm∈Fk+1F_{1},\dots,F_{m}\in{\cal F}_{k+1}, let q1,…,qmq_{1},\dots,q_{m} be nonnegative integers, and let FiqiF_{i}^{q_{i}} be obtained from FiF_{i} by replacing each edge in FiF_{i} by qiq_{i} edges. Then the corresponding moment of AA is

where the multigraph FF is obtained by unlabeling the node labeled k+1k+1 in the multigraph F1q1…FmqmF_{1}^{q_{1}}\dots F_{m}^{q_{m}}. Expressing the moments of BB in a similar way, we see that they are equal by the induction hypothesis. This proves that AA and BB have the same distribution.

Using Lemma 6.2 it follows that we can couple the variables XX and YY so that A=BA=B with probability 1. In other words, we can replace XX and YY by a random variable (X′,Y′)∈Ω×Ω′(X^{\prime},Y^{\prime})\in\Omega\times\Omega^{\prime} so that X′X^{\prime} has distribution π\pi, Y′Y^{\prime} has distribution π′\pi^{\prime}, and their joint distribution satisfies

for every F∈Fk+1F\in{\cal F}_{k+1} with probability 1. Thus we have extended the coupling to Ωk×Ω′k\Omega^{k}\times{\Omega^{\prime}}^{k}.

4 Conclusion of proofs

Proof of Theorem 2.1. Part (i) follows easily: if we choose random sequences (α,β)(\alpha,\beta) from the coupled distribution given by Lemma 5.3, then these sequences will be regular with probability 11, and so they satisfy the conditions of Lemma 5.2.

To prove (ii), suppose that H=(Ω,A,π,W)H=(\Omega,{\cal A},\pi,W) and H′=(Ω′,A′,π′,W′)H^{\prime}=(\Omega^{\prime},{\cal A}^{\prime},\pi^{\prime},W^{\prime}) satisfy (4) for every simple graph FF. By Corollary 3.3, we can find twin-free Lebesguian graphons G=(Γ,B,ρ,U)G=(\Gamma,{\cal B},\rho,U) and G′=(Γ′,B′,ρ′,U′)G^{\prime}=(\Gamma^{\prime},{\cal B}^{\prime},\rho^{\prime},U^{\prime}) and weak isomorphisms ϕ\phi and ϕ′\phi^{\prime} from HH and H′H^{\prime} to GG and G′G^{\prime}, respectively. It follows by Theorem 2.1(i) that the G{G} and G′{G^{\prime}} are isomorphic mod 00, so in particular U=(U′)ψ′U=(U^{\prime})^{\psi^{\prime}} almost everywhere for some measure preserving map ψ′:Γ→Γ′\psi^{\prime}:\Gamma\to\Gamma^{\prime}. Defining ψ:Ω→Γ′\psi:\Omega\to\Gamma^{\prime} by ψ(x)=ψ′(ϕ(x))\psi(x)=\psi^{\prime}(\phi(x)), we conclude that W=(U′)ψW=(U^{\prime})^{\psi} almost everywhere. The maps ψ\psi and ϕ′\phi^{\prime} are measure preserving from the completions H‾\overline{H} and H′‾\overline{H^{\prime}} into G′G^{\prime}. □\square

Proof of Corollary 2.2. The equivalence of (a), (b) and (c) follows by Theorem 2.1 (ii) and the fact that a function which is measurable with respect to the completion of L×L{\cal L}\times{\cal L} is almost everywhere equal to a function which is measurable with respect to L×L{\cal L}\times{\cal L}. In the proof of (c), Theorem 2.1 may give a graphon containing atoms, but it is easy to replace these atoms by intervals of appropriate length.

To prove that (c)⟹\Longrightarrow(e), assume that φ,ψ\varphi,\psi and UU exist as in (c). Let X,X′∈X,X^{\prime}\in be independent random points from the uniform distribution λ\lambda on $.Since. Since\varphiandand\psiaremeasurepreserving,are measure preserving,\varphi(X)andand\psi(Y)havethesamedistribution,andhencebyLemma6.2thereisacouplingmeasurehave the same distribution, and hence by Lemma 6.2 there is a coupling measure\gammaonon\timeswithmarginalswith marginals\lambdasuchthatifsuch that if(X,X^{\prime})isarandomsamplefromis a random sample from\gamma,then, then\varphi(X)=\psi(X^{\prime})withprobabilitywith probability1.Soif. So if(X,X^{\prime})andand(Y,Y^{\prime})areindependentrandompointsfromare independent random points from\gamma$, then

To prove that (e)⟹\Longrightarrow(d), consider the projections Φ,Ψ: 2→\Phi,\Psi:~^{2}\to defined by Φ(x,x′)=x\Phi(x,x^{\prime})=x and Ψ(x,x′)=x′\Psi(x,x^{\prime})=x^{\prime}. Then

Thus, WΦ=(W′)ΨW^{\Phi}=(W^{\prime})^{\Psi} almost everywhere. Furthermore, Φ\Phi and Ψ\Psi are measure preserving if we consider the coupling measure γ\gamma on $$.

Since the completion of (2,L2,γ)(^{2},{\cal L}_{2},\gamma) is a Lebesgue space, we can find a measure preserving map ρ: (,λ)→(2,γ)\rho:~(,\lambda)\to(^{2},\gamma). Setting φ=Φ∘ρ\varphi=\Phi\circ\rho and ψ=Ψ∘ρ\psi=\Psi\circ\rho, we obtain the desired measure preserving maps φ,ψ:→\varphi,\psi:\to such that Wφ=(W′)ψW^{\varphi}=(W^{\prime})^{\psi} almost everywhere.

Finally, (d)⇒\Rightarrow(a) is trivial. □\square

Acknowledgement

We are grateful to Miklós Laczkovich, Ron Peled, Yuval Peres and Oded Schramm for many useful discussions on the topic of this paper, and to Kati Vesztergombi and Svante Janson for carefully reading an earlier version and suggesting several improvements.

References

Appendix: Moments and coupling of probability distributions

In this section we prove some probability theory lemmas, that are “well known” but not easy to reference. We start with the fact that if two vector valued random variables have the same mixed moments, then they have the same distribution (cf Feller , Problem XV.9.21.).

It suffices to prove that π(f−1(B))=π′(g−1(B))\pi(f^{-1}(B))=\pi^{\prime}(g^{-1}(B)) for every Borel set of the form B=I1×I2×…In××…B=I_{1}\times I_{2}\times\dots I_{n}\times\times\dots, where I1,…,InI_{1},\dots,I_{n} are intervals. Let pj,m(x)p_{j,m}(x) be a polynomial that approximates the indicator function 1Ij{\mathbf{1}}_{I_{j}} on $ininL_{1}witherrorlessthanwith error less than1/m(j=1,\dots,n)$. Then

But the left hand sides of these two relations are equal for all mm, which proves the Lemma. ∎

We need the following natural fact about coupling.

Assume that (Ω,A,π)(\Omega,{\cal A},\pi) and (Ω′,A,π′)(\Omega^{\prime},{\cal A},\pi^{\prime}) are Lebesgue spaces, and (Γ,B,ρ)(\Gamma,{\cal B},\rho), a countably generated separating space. Let f: Ω→Γf:~\Omega\to\Gamma and g: Ω′→Γg:~\Omega^{\prime}\to\Gamma be measure preserving maps. Then there exists a coupling ν\nu of (Ω,A,π)(\Omega,{\cal A},\pi) and (Ω′,A,π′)(\Omega^{\prime},{\cal A},\pi^{\prime}) such that

For A∈AA\in{\cal A}, consider the measure λA(B)=π(A∩f−1(B))\lambda^{A}(B)=\pi(A\cap f^{-1}(B)) defined for B∈BB\in{\cal B}, and its Radon-Nikodym derivative fA=dλA/dρf^{A}=d\lambda^{A}/d\rho. Since λA≤π(f−1(B))=ρ(B)\lambda^{A}\leq\pi(f^{-1}(B))=\rho(B), this derivative exists, and 0≤fA≤10\leq f^{A}\leq 1 almost everywhere. Furthermore, f∅=0f^{\emptyset}=0 and fΩ=1f^{\Omega}=1 almost everywhere.

Similarly, for C∈A′C\in{\cal A}^{\prime}, define μC(B)=π′(C∩g−1(B))\mu^{C}(B)=\pi^{\prime}(C\cap g^{-1}(B)) and gC=dμC/dρg^{C}=d\mu^{C}/d\rho. Finally, let

and similarly ν(A×C)≤π′(C)\nu(A\times C)\leq\pi^{\prime}(C). Hence in particular ν(A×C)=0\nu(A\times C)=0 if either π(A)=0\pi(A)=0 or π′(C)=0\pi^{\prime}(C)=0.

If Ai∈AA_{i}\in{\cal A}, Ci∈A′C_{i}\in{\cal A}^{\prime} (i∈Ii\in I) and the sets Ai×CiA_{i}\times C_{i} form a (finite or countably infinite) partition of A×CA\times C (A∈AA\in{\cal A}, C∈A′C\in{\cal A}^{\prime}), then ∑iν(Ai×Ci)=ν(A×C)\sum_{i}\nu(A_{i}\times C_{i})=\nu(A\times C).

It is easy to see that if A1,A2∈AA_{1},A_{2}\in{\cal A} are disjoint sets and A=Ai∪A2A=A_{i}\cup A_{2}, then fA1+fA2=fAf^{A_{1}}+f^{A_{2}}=f^{A} almost everywhere. It follows that for every C∈A′C\in{\cal A}^{\prime}, we have ν(A1×C)+ν(A2×C)=ν(A×C)\nu(A_{1}\times C)+\nu(A_{2}\times C)=\nu(A\times C). This implies by standard arguments that the claim holds if ∣I∣|I| is finite. This in turn implies that ν\nu extends to a finitely additive measure on the algebra F{\cal F} of sets that can be written as the union of a finite number of product sets A×CA\times C (A∈AA\in{\cal A}, C∈A′C\in{\cal A}^{\prime}).

In the case of infinite ∣I∣|I|, it follows that ∑iν(Ai×Ci)≤ν(A×C)\sum_{i}\nu(A_{i}\times C_{i})\leq\nu(A\times C); in fact, for every finite J⊆IJ\subseteq I, we have ∪i∈JAi×Ci⊆A×C\cup_{i\in J}A_{i}\times C_{i}\subseteq A\times C, and hence by the finite additivity of ν\nu, we have

Since this holds for every finite subset JJ of II, it also holds for II.

on a set BB of positive measure. Now we use that (Ω,A,π)(\Omega,{\cal A},\pi) and (Ω′,A,π′)(\Omega^{\prime},{\cal A},\pi^{\prime}) are Lebesgue spaces, so we may assume that they are intervals [0,a][0,a] and [0,b][0,b] respectively, together with a countable set of atoms. Thinking of the atoms as converging to aa from above, we have a compact topology on them. For every ii, we can find an open sets Ui⊇AiU_{i}\supseteq A_{i} and Vi⊇CiV_{i}\supseteq C_{i} such that π(Ui)≤π(Ai)+ε2−i\pi(U_{i})\leq\pi(A_{i})+\varepsilon 2^{-i} and π′(Vi)≤π′(Ci)+ε/2i\pi^{\prime}(V_{i})\leq\pi^{\prime}(C_{i})+\varepsilon/2^{i}. Also, we can find closed sets U⊆AU\subseteq A and V⊆CV\subseteq C such that π(U)≥π(A)−ε\pi(U)\geq\pi(A)-\varepsilon and π′(V)≥π′(C)−ε\pi^{\prime}(V)\geq\pi^{\prime}(C)-\varepsilon. Then

The open sets Ui×ViU_{i}\times V_{i} cover the compact set U×VU\times V, and so a finite number of them also covers. But the contradicts the finite additivity of ν\nu which we already established.

The setfunction ν\nu extends to a measure on A×A′{\cal A}\times{\cal A}^{\prime}.

We have seen already that ν\nu extends to F{\cal F}; it follows by Claim 2 that this extension is σ\sigma-additive. Thus the Claim follows by the Measure Extension Theorem.

Define Δ={(x,y)∈Ω×Ω′:f(x)=g(y)}\Delta=\{(x,y)\in\Omega\times\Omega^{\prime}:f(x)=g(y)\}. To complete the proof of the Lemma, we want to prove that ν\nu is a coupling between (Ω,A,π)(\Omega,{\cal A},\pi) and (Ω′,A,π′)(\Omega^{\prime},{\cal A},\pi^{\prime}) (which is trivial), and that ν(Ω×Ω′∖Δ)=0\nu(\Omega\times\Omega^{\prime}\setminus\Delta)=0. Let S⊆B{\cal S}\subseteq{\cal B} be a countable family separating the elements of Γ\Gamma. Then

Consider any term here, say f−1(S)×g−1(Γ∖S)=A×Cf^{-1}(S)\times g^{-1}(\Gamma\setminus S)=A\times C. Then

This proves that ν(Ω×Ω′∖Δ)=0\nu(\Omega\times\Omega^{\prime}\setminus\Delta)=0. ∎