Geometric random graphs and Rado sets of continuous functions

- Mathematics, Ryerson University
- More about Anthony Bonato

- Mathematics and Statistics, Dalhousie University
- More about Jeannette Janssen

- Mathematics and Statistics, aquas@uvic.ca
**ORCID iD:**0000-0003-4504-0797- More about Anthony Quas

*Discrete Analysis*, April. https://doi.org/10.19086/da.21473.

### Editorial introduction

Geometric random graphs and Rado sets of continuous functions, Discrete Analysis 2021:3, 21 pp.

For several reasons, random graphs play a central role in the theory of finite graphs. For example, a typical random graph has properties that are hard to establish for explicitly defined graphs, as Erdős famously observed when obtaining his lower bound for diagonal Ramsey numbers. And random graphs provide a model for the study of fascinating phenomena such as phase transitions, a model that is simple enough for remarkably precise results to be obtained but complex enough for those results to be highly interesting and non-trivial.

It is natural to wonder what one can say about infinite random graphs. If, for example, we define a graph G with vertex set N by joining each pair of vertices xy with probability p, with all choices made independently, then what can we say about G?

A rather surprising result is that provided 0<p<1, all such graphs are isomorphic. More precisely, there is a single infinite graph Γ, known as *the random graph*, or sometimes *the Rado graph*, such that if G is chosen as above, then with probability 1 G is isomorphic to Γ.

Though surprising, this statement has an easy proof. Here is a quick sketch. Let G1 and G2 be two graphs chosen randomly as above and let x1,x2,… and y1,y2,… be enumerations of their vertices. Suppose now that we have finite sets A,B⊂N and a bijection ϕ:A→B such that if i,j∈A, then xixj is an edge of G1 if and only if yϕ(i)yϕ(j) is an edge of G2. Now let i∉A and let A′ be the set of j∈A such that xi is joined to xj. Then with probability 1 there exists r∉B such that the set of s∈B such that yr is joined to ys is precisely ϕ(A′). (That is because each yr has a non-zero probability of satisfying this condition, all edges are independently chosen, and there are infinitely many possibilities for yr.) Using this simple observation, and the corresponding one with the roles of the xi and yi reversed, we can keep extending ϕ until all vertices in both vertex sets are matched.

In one way, this shows that the theory of random infinite graphs is not very interesting. But the random graph turns out to have an important role to play in some contexts, model theory being a notable example.

This paper looks at a class of infinite random graphs defined with reference to a separable metric space X. The idea is to pick a positive real number α and a countable dense subset S⊂X, and to define a random graph G with vertex set S by joining x,y∈S with probability p if d(x,y)<α and not joining them otherwise. Thus, locally this graph looks like the random graph, but distant vertices are not joined.

This class was introduced in a paper of the first two authors in 2009. That paper contains the result that if X=R with the usual metric, and S is a countable dense subset of X such that no two distinct points in S have an integer distance from each other, then all the resulting random graphs are isomorphic. Again this is proved by a back-and-forth argument, but the details are significantly more complicated than they are for the original Rado graph. They also proved the same for the space ℓn∞ (this time the condition is that no two distinct points have a coordinate that differs by an integer), as well as showing that it fails for the plane with the Euclidean distance.

In general, it seems that the Rado property requires some kind of ℓ∞-ish structure to hold, which motivates the study in this paper of subsets of C[0,1], the space of continuous functions on the closed interval [0,1] with the sup norm. The authors consider the following three dense subsets of C[0,1]: piecewise linear functions, polynomials, and Brownian motions. In each case, in order to obtain countable dense sets that satisfy suitable conditions (similar to, but more complicated than, the conditions about coordinates that differ by an integer), they define a probability measure μ supported on the given class of functions that has *full support* in the sense that every non-empty open subset has positive measure, and they then choose points x1,x2,… independently at random using the measure μ.

In each case they obtain sets with the Rado property. However, it turns out, interestingly, that while the universal graphs that arise for piecewise linear functions and polynomials are the same, the one for Brownian motion paths is different. This reflects the fact that if two Brownian motion paths cross each other, then with probability 1 they cross each other infinitely many times. Moreover, the graphs in all three cases are not isomorphic to the graphs that arise for ℓn∞ or for infinite-dimensional sequence spaces that were examined in an earlier paper of the authors.