Graphon

Definition

A graphon is a symmetric measurable function W : [ 0 , 1 ] 2 → [ 0 , 1 ] . Usually a graphon is understood as defining an exchangeable random graph model according to the following scheme:

1. Each vertex j of the graph is assigned an independent random value u j ∼ U [ 0 , 1 ]
2. Edge ( i , j ) is independently included in the graph with probability W ( u i , u j ) .

A random graph model is an exchangeable random graph model if and only if it can be defined in terms of a (possibly random) graphon in this way.

It is an immediate consequence of this definition and the law of large numbers that, if W ≠ 0 , exchangeable random graph models are dense almost surely.

Examples

The simplest example of a graphon is W = p for some constant p ∈ [ 0 , 1 ] . In this case the associated exchangeable random graph model is the Erdős–Rényi model that includes each edge independently with probability p .

The Erdős–Rényi model can be generalized by:

1. Divide the unit square into K × K block
2. Let W equal p l m on the l , m th block.

Effectively, this gives rise to the random graph model that has K distinct Erdős–Rényi graphs with parameters p l l respectively and bigraphs between them where each possible edge between blocks l , l and m , m is included independently with probability p l m . This is simply the K community stochastic block model.

Many other popular random graph models can be understood as exchangeable random graph models defined by some graphon, a detailed survey is included in.

Jointly exchangeable adjacency matrices

A random graph of size n can be represented as a random n × n adjacency matrix. In order to impose consistency (in the sense of projectivity) between random graphs of different sizes it is natural to study the sequence of adjacency matrices arising as the upper-left n × n sub-matrices of some infinite array of random variables; this allows us to generate G n by adding a node to G n − 1 and sampling the edges ( j , n ) for j < n . With this perspective, random graphs are defined as random infinite symmetric arrays ( X i j ) .

Following the fundamental importance of exchangeable sequences in classical probability, it is natural to look for an analogous notion in the random graph setting. One such notion is given by jointly exchangeable matrices; i.e. random matrices satisfying

for all permutations σ of the natural numbers, where = d means equal in distribution. Intuitively, this condition means that the distribution of the random graph is unchanged by a relabeling of its vertices: that is, the labels of the vertices carry no information.

There is a representation theorem for jointly exchangeable random adjacency matrices, analogous to de Finetti’s representation theorem for exchangeable sequences. This is a special case of the Aldous–Hoover theorem for jointly exchangeable arrays and, in this setting, asserts that the random matrix ( X i j ) is generated by:

1. Sample u j ∼ U [ 0 , 1 ] independently
2. X i j = X j i = 1 independently at random with probability W ( u i , u j ) ,

where W : [ 0 , 1 ] 2 → [ 0 , 1 ] is a (possibly random) graphon. That is, a random graph model has a jointly exchangeable adjacency matrix if and only if it is a jointly exchangeable random graph model defined in terms of some graphon.

Limits of sequences of dense graphs

Consider a sequence of graphs ( G n ) where the number of vertices of G n goes to infinity. It is possible to define several notions of convergence of such sequences, each of which may give rise to a distinct limit object. For example, if the sequence ( G n ) was a realization of an Erdős–Rényi graphs with parameter p the natural notion of limit would be the edge density of the graphs, which converges to p . In this case it would be natural to say that the limit of the sequence is the constant graphon W = p . It turns out that for sequences of dense graphs a number of apparently distinct notions of convergence are equivalent and under all of them the natural limit object is a graphon.

Related notions

Graphons are naturally associated with dense simple graphs. There are straightforward extensions to dense directed weighted graphs. There are also recent extensions to the sparse graph regime, from both the perspective of random graph models and graph limit theory.