Ranks, copulas, and permutons

We review a recent development at the interface between discrete mathematics on one hand and probability theory and statistics on the other, specifically the use of Markov chains and their boundary theory in connection with the asymptotics of randomly growing permutations. Permutations connect total orders on a finite set, which leads to the use of a pattern frequencies. This view is closely related to classical concepts of nonparametric statistics. We give several applications and discuss related topics and research areas, in particular the treatment of other combinatorial families, the cycle view of permutations, and an approach via exchangeability.


Introduction
Ranks are at the basis of nonparametric statistics, copulas are a standard tool for the description of dependencies, and permutons have recently been introduced as limit objects for large permutations.We survey some of the connections between these concepts, mainly from a probabilistic and statistical point of view.In particular, we explain the use of Markov chains and their boundary theory in the context of sequences of permutations.This approach has received some attention in connection with the asymptotics of other randomly growing discrete structures, such as graphs and trees.
The paper addresses a statistically educated audience.Consequently, we only mention Chapter 13 of van der Vaart (1998) in connection with ranks in statistics, and for copulas we refer to Nelson (2006).In Section 2 we recall some basic aspects of permutations; see Bona (2004) for a textbook reference.In Section 3 we introduce permutons, which are two-dimensional copulas.The basic reference here is the seminal paper Hoppen et al (2013).The construction of limits is discussed in some generality, again from a probabilistic point of view.
Permutons arise as limits if pattern frequencies are considered.In Section 4 we explain an approach to the augmentation of discrete spaces that is based on the construction of suitable Markov chains and the associated boundary theory.The latter can be seen as a discrete variant of classical potential theory, going back to Doob (1959); see Woess (2009) for a general textbook R. Grübel Institute of Actuarial and Financial Mathematics Leibniz Universität Hannover Postfach 6009 D-30060 Hannover, Germany E-mail: rgrubel@stochastik.uni-hannover.dereference and Grübel (2013) for an elementary introduction closer to the present context.We show that the pattern frequency topology arises naturally if a specific Markov chain (Π n ) n∈N is chosen.This approach also provides an almost sure construction, meaning that Π n → Π ∞ 'pathwise' with probability one.
Section 5 collects some applications.Finally, in the last section, we sketch some related problems and research areas, where we use the reviewish character of the present paper as a license for explaining connections that seem to be known to researchers in the field, but not necessarily to an interested newcomer (which the author was, some years ago).It should be clear that we will have to (and do) resist the temptation of always giving the most general results.
Throughout, a specific data set will be used to illustrate the various concepts, and we occasionally point out analogies to statistical concepts.

Permutations
For a finite set A we write S(A) for the set of bijections π : A → A and abbreviate this to S n if A = [n] := {1, . . ., n}.An element π of S n can be represented in one-line notation or in standard cycle notation.For the first π = (π(1), π(2), . . ., π(n)) (or π(1)π(2) • • • π(n) if no ambiguities can arise) is simply the tuple of its values, and we note at this early stage that this notation presupposes a total (or linear) order on the base set A. The second one is somewhat closer to the notion of a bijection: Each element a of A will run through a finite cycle if π ∈ S(A) is applied repeatedly.In the special case A = [n] this leads to a tuple of cycles, and standard notation means that these are individually ordered by putting the respective largest element first and then listing the cycles increasingly according to their first elements.The transition lemma, also known as Foata's correspondence, provides a bijection between the two representations by erasing the brackets in the step from cycle to one-line notation, and, roughly, by inserting brackets in front of every increasing record in the one-line notation, such as in 5 87324916 −→ (5)(87324)(916). (1) Much of the classical material connecting permutations and probabilities refers to the cycle structure, typically under the assumption that the random permutation Π n is chosen uniformly from S n , which we abbreviate to Π n ∼ unif(S n ).A standard problem, often discussed in elementary probability courses, concerns the probability p n that Π n has at least one fixed point, i.e. a cycle of length 1, which can be evaluated with the inclusion-exclusion formula to p n = ∑ n k=1 (−1) k+1 /k!.Further, the correspondence in (1) relates the number of cycles on the right to the number of increasing records on the left hand side.As a final example we mention that the distribution of the cycle type C n = (C n (1),C n (2), . ..) of Π n , where C n (i) denotes the number of cycles of length i in Π n , is given by where the values c i , i ∈ N, have to satisfy the obvious constraint that ∑ i∈N ic i = n.In particular, C n (i) = 0 for i > n.Multiplication by n! leads to a formula for the number of permutations of a given cycle type.From a probabilistic point of view, rewriting (2) as with Z 1 , . . ., Z n independent, Z i Poisson distributed with parameter 1/i, and T n := ∑ n i=1 i Z i , seems more instructive; for example, it provides access to the distributional asymptotics.We refer to Arratia et al (2003) for this and related material.Our later aim, however, is to deal with limits for the permutations themselves, but we will return to the cycle view in Sections 6.2.
A one-line notation such as 587324916 in (1) defines a total order on the set of numerals, with 5 the smallest and 6 the largest element.With '<' the canonical order on [n] (or R) the permutation π ∈ S n then provides an order isomorphism between ([n], <) and ([n], < π ), with '< π ' given by the one-line notation for π.
Suppose now that we have data x 1 , . . ., and these can be combined into a permutation π x := (rk(1), . . ., rk(n)) ∈ S n .For two-dimensional data (x 1 , y 1 ), . . ., (x n , y n ) with no ties in the two sets of component values we then obtain two permutations π x , π y that define two total orders on [n].These are, in the above sense, connected by the permutation In this situation, the permutation plot for π is known as the rank plot for the data.The orderrelating permutation does not depend on the order in which the observation vectors are numbered.Formally, it is invariant under permutations σ of [n] in the sense that the permuted pairs (x σ (1) , y σ (1) ), . . ., (x σ (n) , y σ (n) ) lead to the same π.Hence, in statistical terms, π depends on the data only through their empirical distribution.
For example, Berlin is fairly far in the east and fairly far up north within this group.The permutation relating these as total orders is given by 9,7,5,10,11,12,4,15,2,13,16,3,1,8,14,6).( 6) Figure 1 shows the true locations (in longitude and latitude degrees) on the left and the rank plot on the right hand side, with the four largest cities in red.The observant reader will have noticed that the rank plot is, essentially, the associated permutation matrix.In fact, the plot of a permutation also leads to an interpretation (or coding) of permutations that will be central for the permuton aspect: Writing δ x for the one-point measure at x we can associate a distribution µ(π) on the unit square with π ∈ S n via Clearly, π can be recovered from µ(π).Also, for all π ∈ S n , the marginals of µ(π) are the discrete uniform distributions on the set {1/n, 2/n, . . ., 1}.
In view of later developments we note that in the passage from rank plot to permutation plot the relative positions of the points in xand y-direction do not change.In our data example, a city that is north (up) or east (right) of some other city will stay so if we move from the left to the right part of Figure 1, 3 Patterns, subsampling and convergence Our aim in this section is to obtain a formal framework for the informal (and ubiquitous) question, 'what happens as n → ∞?'.We may, for example, start with a sequence (π n ) n∈N of permutations with π n ∈ S n for all n ∈ N and regard these as elements of the set S := ∞ n=1 S n , which we then need to augment in order to obtain a limit.A standard procedure begins with a set F of functions f : S → [0, 1] that separates the points in the sense that, for each pair π, σ ∈ S with π ̸ = σ , there is a function f ∈ F such that f (π) ̸ = f (σ ).We then identify π ∈ S with the function f → f (π), which is an element of the space [0, 1] F which, endowed with the product topology, is compact by Tychonov's theorem.The closure of the embedded S provides a compactification S of S, where convergence of a sequence (π n ) n∈N is equivalent to the convergence of all real sequences ( f (π n )) n∈N , f ∈ F .Moreover, each function f ∈ F has a continuous extension to S. In the present situation F will always be countable, and we start with the discrete topology on S. Then S is a separable compact topological space, and the boundary ∂ S is a compact subset.
We discuss three function classes and the resulting topologies.First, let F be the set of indicator functions ∈ S k for all n ≥ n 0 , we always get the function which is equal to 0 as the pointwise limit, hence the boundary consists of a single point.This topology is known as the one-point compactification.
For the second example we note first that order relations transfer to subsets by restriction.For A = [n], π ∈ S n , and B = [k] with k ≤ n, restricting < π from A to B amounts to deleting all entries greater than k in the one-line notation of π, which gives the one-line notation for a permutation σ ∈ S k .We generally write σ  .152 .125 .193 .134 .286 .110Table 1 Patterns in the city data permutation a condition that will appear repeatedly below.We now define and f σ (π) = 0 otherwise.As in the previous case the functions take only the values 0 and 1, so that convergence means that f σ (π n ) remains constant from some n 0 = n 0 (σ ) onwards.In view of ∑ σ ∈S k f σ (π) = 1 for all π ∈ S n , n ≥ k, any such sequence leads to a sequence (σ k ) k∈N , σ k ∈ S k , that has the property that f σ k (π n ) = 1 for all n ≥ n 0 (k).Clearly, this sequence must be projective in the sense that the restriction of σ k to [l] with l ≤ k is equal to σ l .This implies that there is a total order < π ∞ on N which reduces to < σ k on [k] for all k ∈ N. The result is known as the projective topology, and the set of limits is the set of total orders on N.
The third topology will lead to permutons.It arises if we use pattern counting, another aspect that is closely related to the interpretation of permutations as connecting total orders.Let M(k, n) be the set of strictly increasing functions f : [k] → [n], n ≥ k.We define the relative frequency of the pattern σ in the permutation π as Of course, #M(k, n) = n k .We augment this by putting t(σ , π) = 0 if k > n.Using the notation from the previous paragraph and identifying f ∈ M(n, k) with its range A we see that the numerator is the number of size k subsets A of [n] with π[A] = σ .Table 3 contains the absolute and relative frequencies for the six patterns of length three in the city data introduced at the end of Section 1.The four largest cities generate the pattern σ = 2413 ∈ S 4 .
From a probabilistic or, in fact, statistical point of view, we may regard the relative frequencies as probabilities in a sampling experiment.With ξ = ξ n,k uniformly distributed on the set of all subsets A of [n] with size k, the function σ → t(σ , π) is the probability mass function of the random element π[ξ ] of S k .In particular, whenever k ≤ n, Building on an earlier approach in graph theory, Hoppen et al (2013) introduced a notion of convergence based on such pattern frequencies.We identify a permutation π with its function σ → t(σ , π) on the set S and with values in the unit interval; it is easy to see that different permutations lead to different functions.The general approach outlined above then leads us to define convergence of the sequence (π n ) n∈N as convergence of t(σ , π n ) for all σ ∈ S. Below we will refer to this as the pattern frequency topology, For the construction to be of use we need a description of the boundary ∂ S = S \ S. In the general setup the limit of a convergent sequence but obviously, not all functions from S to [0, 1] appear in that manner.For example, (8) implies that ∑ σ ∈S k π ∞ (σ ) = 1 for any fixed k ∈ N, and a conditioning argument leads to the inequality In fact, we even have, for all k, l, m ∈ N with k < l < m and all σ ∈ S k , ρ ∈ S m , t(σ , ρ) = ∑ τ∈S l t(σ , τ)t(τ, ρ). (9) This follows from viewing the sampling procedure as removing single elements repeatedly, and then decomposing with respect to the permutation obtained at the intermediate level.The decomposition (9) will play an important role later in the context of the dynamics of permutation sequences; see Section 4. Now copulas enter the stage: A (two-dimensional) copula C : [0, 1] × [0, 1] → [0, 1] is the distribution function of a probability measure on the unit square that has uniform marginals, meaning that C(u, 1) = u for all u ∈ [0, 1] and C(1, v) = v for all v ∈ [0, 1].We define the associated pattern frequency function t(•,C) by sampling: For σ ∈ S k let t(σ ,C) be the probability that a sample (X 1 ,Y 1 ), . . ., (X k ,Y k ) from C leads to the permutation σ in the sense that see also (5).As the joint distribution of the sample is invariant under permutations it follows that, for all k ∈ N and σ ∈ S k , We observe (but do not prove) that C is determined by the function σ → t(σ ,C) on S, and that for copulas, weak convergence is equivalent to the pointwise convergence on S of these functions.Note the analogy to the moment problem in the first and to the moment method in the second statement.
We can now collect and rephrase some of the main results in Hoppen et al (2013).For the definition of the random permutations in part (c) we refer to (5) again, and to the description given there of a suitable algorithm for obtaining the permutation from the data.Ties in the Xresp.Y -values may be ignored as these are, individually, a sample from the uniform distribution on the unit interval.
Theorem 1 (a) A sequence (π n ) n∈N of permutations in S with |π n | → ∞ converges in the pattern frequency topology if and only if there is a copula C such that Moreover, the copula C is unique.
(b) In the pattern frequency topology, the boundary ∂ S is homeomorphic to the space of copulas, endowed with weak convergence.
(c) Let C be a copula and suppose that (X i ,Y i ), i ∈ N, are independent random vectors with distribution function C. For each n ∈ N let Π n be the random permutation associated with the first n pairs (X 1 ,Y 1 ), . . ., (X n ,Y n ).Then, in the pattern frequency topology, Π n converges to C almost surely as n → ∞.
Below we will refer the stochastic process (Π n ) n∈N in part (c) of Theorem 1 as the permutation sequence generated (or parametrized) by the copula C.
From a probabilistic point of view it is not too difficult to understand this result: )) be the space of probability measures on the Borel subsets of the unit square, endowed with the topology of weak convergence, and consider the embedding π → µ(π) of S into M 1 given by ( 7).Suppose now that (π n ) n∈N is a sequence of permutations where we assume for simplicity that π n ∈ S n for all n ∈ N. As M 1 is compact with respect to weak convergence this sequence has a limit point µ ∞ , and convergence would follow from the uniqueness of µ ∞ .For this we first note that the marginals of any such limit point are the uniform distributions on the unit interval, as weak convergence implies the convergence of the marginal distributions.Hence any limit point µ ∞ has as its distribution function a copula C. Next we argue that (10) holds: Let σ ∈ S k be given and let the function h σ on ([0, 1] × [0, 1]) k indicate whether or not the order-relating permutation for the marginal rank vectors of ((x 1 , y 1 ), . . ., Uniform marginals implies that the set of discontinuities of h σ is a µ ∞ -null set, and the weak convergence of µ(π n ) to µ ∞ implies the weak convergence of the respective kth measuretheoretic powers.Taken together this shows (10).The desired uniqueness now follows from the fact that a copula C is determined by its function σ → t(σ ,C).For (b) we use that weak convergence of copulas is equivalent to pointwise convergence of the associated functions on S.
Finally, part (c) is immediate from the representation (11) of pattern frequencies as U-statistics, and the classical consistency result for the latter.

Dynamics
Generating random permutations is an important applied task.In line with the history of probability we recall a standard gaming example: Card mixing requires Π n ∼ unif(S n ) for some fixed n.Many shuffling algorithms may be modeled as random walks on S n and can then be analyzed using the representation theory for this group; see also Section 6.2 below.
Here we are interested in sequences (Π n ) n∈N with Π n ∈ S n for all n ∈ N, and a Markovian dynamic.A classical example is the Markov chain In words: We insert the new value n + 1 at a position in a gap chosen uniformly at random.This appears, for example, on p.132 in Feller (1968).A second possibility, which we will relate to Hoppen et al (2013), and which we denote by Π H = (Π H n ) n∈N , uses 'double insertion' instead.This means that the step from n to n + 1 is based on two independent random variables I = I n and J = J n , both uniformly distributed on [n + 1], and In words: We insert J at position I and increase the appropriate values by 1. Obviously, this process is a Markov chain, again with start at the single element σ = (1) of S 1 .We collect some properties of this process.The notion of a permutation sequence generated by a copula is explained in Theorem 1 (c).
Lemma 1 Let Π H be as defined above.
(a) Π H is equal in distribution to the permutation sequence generated by the independence copula C(x, y) = x • y.
(b) The transition probabilities of Π H are given by p H (σ , τ) for all k, n ∈ N with k ≤ n, and all σ ∈ S k and τ ∈ S n .Proof: (a) Let Π = (Π n ) n∈N be generated by the independence copula.Then the step from Π n to Π n+1 is based on the component ranks I and J of the next pair It is well known that I and J are both uniformly distributed on Here they are also independent, hence Π n+1 arises from Π n as in ( 13).
(b) The transition from σ ∈ S n to τ ∈ S n+1 is based on independent random variables I and J, both uniformly distributed on The number of such i's is (n + 1)t(σ , τ), and in each case we additionally need J = τ(I).This proves the one-step version of (14).
To obtain the general case we now use induction, the Markov property, and ( 9).
Hence both Π F and Π H consist of uniformly distributed variables.A trivial third possibility to achieve this is to use independent Π n 's with Π n ∼ unif(S n ).The transition graph for these chains has S as its set of nodes and an edge {σ , τ} for each pair σ ∈ S n , τ ∈ S n+1 , n ∈ N, with the property that P(Π n+1 = τ|Π n = σ ) > 0. Figure 2 shows the first four levels of the transition graphs for Π F and Π H .These graphs are the Hasse diagrams associated with two specific partial orders on S. In the first, σ < F ρ for σ ∈ S k and ρ ∈ S n with k < n means that the one-line notation for σ arises from the one-line notation for ρ by simply deleting all values greater than k in the latter, whereas in connection with Π H we have σ < H ρ if and only if σ appears as a pattern in ρ.Clearly, the graph for Π F is a tree: All previous states are deterministic functions of the current state.Informally speaking, all three chains eventually leave the state space S, and this is what provides the connection to the previous section.
We need an excursion.The Markov property is often stated informally as 'the future development depends on the history of the process only via its present state'.It may be instructive to carry out a simple calculation: If X 1 , X 2 , . . ., X n are random variables on some probability space with values in some countable set, then their joint distribution can always be evaluated step by step via whenever the probability on the left hand side is positive.If the tuple has the Markov property then elementary manipulations of conditional probabilities lead to Hence the Markov property then also holds 'in the other direction'.Moreover, the converse statement follows on reading the above from bottom to top.For a sequence (X n ) n∈N , and with G n , H n the σ -fields generated by the variables X 1 , . . ., X n and X n , X n+1 , . . .respectively, the Markov property can formally be written as a procedure that may be interpreted as time reversal.In fact, a somewhat neutral statement would be that, for a Markov process, past and future are conditionally independent, given the present.
The distribution of a Markov chain is specified by the distribution of the first variable and the (forward) transition probabilities; for the reverse chain we speak of the cotransition probabilities.The tree structure of its transition graph implies that for Π F the cotransitions are degenerate in the sense only the values 0 and 1 occur.For Π H we use Lemma 1 to obtain for all n ∈ N, σ ∈ S n and τ ∈ S n+1 .The decomposition ( 9) can now be interpreted as describing the backwards movement of Π H : Pattern frequencies arise as cotransitions for this chain.
Next we sketch Markov chain boundary theory, which grew out of the historically very important probabilistic approach to classical potential theory.For the highly transient chains considered here, where no state can be visited twice and where the time parameter is a function of the state and thus time homogeneity is implicit, this takes on a particularly simple form.Suppose that X = (X n ) n∈N is a Markov chain with graded state space S = S n , that X is adapted to the grading in the sense that X n ∈ S n for all n ∈ N, and that S is minimal in the sense that P(X n = x) > 0 for all x ∈ S n , n ∈ N. The Martin kernel K : S × S → R + for X is then given by if n ≥ m, and K(x, y) = 0 otherwise.For each x ∈ S m let f x : S → [0, 1] be defined by and let F := { f x : x ∈ S}.The Doob-Martin compactification S and the Martin boundary ∂ S of the state space are the results of the procedure outlined at the beginning of Section 3, with this choice of F as space of separating functions.We give two central results.
Theorem 2 In the Doob-Martin compactification, X n converges almost surely to a random variable X ∞ with values in the Martin boundary.
Proof: Let f = f x ∈ F with some x ∈ S k .In view of the above remarks on the Markov property and time reversal, This shows that f (X n ), H n n≥k is a reverse martingale, hence f (X n ) converges almost surely.As x ∈ S was arbitrary, the first statement follows by construction of the compactification.
The general compactification procedure implies that the Martin kernel can be extended continuously from S × S to S × S via K(x, α) = lim n∈N K(x, y n ) where (y n ) n∈N is such that y n → α ∈ ∂ S in the Doob-Martin topology.The following is a special case of Doob's htransform.
Theorem 3 Let X, S, S, ∂ S be as above and let p(x, y) = P(X n+1 = y|X n = x), x ∈ S n , y ∈ S n+1 , be the transition function of the Markov chain X.For α ∈ ∂ S let p α be defined by Then p α is the transition function for a Markov chain X α = (X α n ) n∈N , and X α n converges almost surely to α in the Doob-Martin topology.
The picture that emerges from these results is that of an exit boundary and, with K(•, α) as basis for an h-transform, of the resulting transformed chain as the process conditioned on the value α ∈ ∂ S for the limit X ∞ .Further, the relation to time reversal and the two-sidedness of the Markov property outlined above shows that convergence y n → α ∈ ∂ S in the Doob-Martin topology is equivalent to the convergence in distribution of the initial segments of the conditioned chain, Finally, we note that the topological construction depends on the chain via the associated cotransitions only.In the familiar forward case, the distribution of X is specified by the distribution of the first variable X 1 and the transition function p.Here we may consider the distribution of X ∞ as given, and then use the cotransitions to obtain the distribution of X as a mixture of the distributions L [X|X ∞ = α], α ∈ ∂ S.
We now return to processes (Π n ) n∈N of permutations.This is a special case of the above framework, with S = S and S n = S n .First, for Π F it is clear from the transition mechanism that, for σ ∈ S k and π ∈ S n , the conditional probability P(Π F k = σ |Π F n = π) has value 1 if the (order) restriction of π to [k] is equal to σ , and that it is 0 otherwise.As functions on S these are the same as the functions that generate the projective topology, see Section 3. Of course, convergence in the projective topology also follows directly from the fact that Π F is consistent in the sense that, for all n ∈ N, the restriction of At the other end of the spectrum, with the chain consisting of independent random variables, we obtain the onepoint compactification, where each sequence of permutations that does not have a limit point in S itself converges to the single point ∞.An intermediate case is Π H or, more generally, the copula-based process introduced in part (c) of Theorem 1. Recall that Π H appears with the independence copula C(x, y) = x • y.
Theorem 4 The process Π = (Π n ) n∈N generated by a copula C is a Markov chain with transition probabilities and the associated Doob-Martin topology is the same as the pattern frequency topology.Further, Π is an h-transform of Π H .
For an arbitrary copula C the permutations are generated by a sequence of independent random vectors (X i ,Y i ), i ∈ N, with distribution function C, and Π n is a deterministic function of the first n pairs.The conditional distribution of Π n given all Π k , k > n, thus depends only on Π n+1 and the pair (i, j) in the permutation plot of Π n+1 that has been generated by (X n+1 ,Y n+1 ).
As the initial segments are invariant in distribution under permutations, each i ∈ [n+1] is equally likely.Taken together this shows that (Π n ) n∈N is a Markov chain with cotransitions that do not depend on C.This completes the proof of the topological assertion.
In order to obtain the expression for the one-step transition probabilities we note that, by definition of t(•,C), Using this together with ( 14), ( 15) and some elementary manipulations leads to (18).
For the proof of the last assertion we need the extended Martin kernel K(•, •) associated with Π H . First, by the familiar arguments, where we have used Theorem 1 (a) in the last step.Using this (18) can be written as for all n ∈ N, σ ∈ S n and τ ∈ S n+1 .
We presented a purely topological approach to state space augmentation that is based on an embedding of S into [0, 1] F with a suitable family F of functions f : S → [0, 1] and the subsequent use of Tychonov's theorem.This is a variant of the famous Stone-Čech compactification; see e.g.(Kelley 1955, p.152).Alternatively, we could endow S with a metric d and then pass to the completion of (S, d).A suitable choice of d, based on the Martin kernel, leads to a totally bounded metric space that is topologically homeomorphic to the compactification discussed above.

Applications
We give a range of examples where permutations and their limits are important, from classical statistics to stochastic modeling to theoretical computer science.

Tests for independence
If the Xand Y -variables are independent then we obtain the copula C(x, y) = x • y, 0 ≤ x, y ≤ 1.For the asymptotic frequencies this means that, for all k ∈ N and σ ∈ S k , as a permutation of the Y -variables alone does not change the joint distribution of the pairs (X 1 ,Y 1 ), . . ., (X n ,Y n ).In particular, all patterns of the same length have the same asymptotic frequencies, so that t(σ ,C) = 1/k!for all σ ∈ S k .This may be used for testing independence.A famous classical procedure is based on Kendall's τ-statistic which, in the notation introduced in Section 3, may be written as τ = t(12, Π n ) − t(21, Π n ) / n 2 and thus makes use of the two complementary patterns of length two.A central limit theorem for U-statistics leads to a test for independence with asymptotically correct level, see e.g.Example 12.5 in van der Vaart (1998).In our running data example a total of 61 of the 120 pairs are concurrent: Clearly, the test based on Kendall's τ would not reject the hypothesis of independence for these data.
An analogous procedure based on longer patterns requires a multivariate central limit theorem for vectors of U-statistics.We consider patterns of length three, with a view towards the values given in Table 3.For the asymptotic covariances we use Theorem 12.3 in van der Vaart (1998) and thus have to compute 2 , Z ′ 3 are independent and uniformly distributed on the unit square.For this we first determine the conditional distribution the assumption of independence of horizontal and vertical positions.If π = 123, for example, we either have is 'in the middle' of the rank plot, and similar conditions apply in the other two cases.With φ σ (x, y) := P(Π 3 = σ |X 1 = x,Y 1 = y) elementary calculations along these lines lead to Note that φ σ (x, y) = φ σ −1 (y, x) for all σ ∈ S, 0 < x, y < 1.With these conditional probabilities we get The observed value 0.228 for σ = 312 deviates notably from the theoretical 1/6.For this permutation the asymptotic variance is ζ = 9(19/600−1/36) = 7/200.The corresponding asymptotic p-value for the observation would be the probability that a standard normal variable exceeds the value which is about 0.094 and thus significant at the level 0.1.This, of course, is an act of 'data snooping', but it should be clear from the above how to obtain the 6 × 6 asymptotic covariance matrix for the vector (t(σ , Π n )) σ ∈S 3 of pattern frequencies under the hypothesis of independence, and how then to apply an appropriate test with the full data set in Table 3.The use of ever longer patterns is a straightforward if computationally demanding generalization.In this context another interesting connection between discrete mathematics and statistics appears: A (deterministic) sequence (π n ) n∈N of permutations with |π n | → ∞ is said to be quasirandom if t(σ , π n ) converges to 1/|σ |! for all σ ∈ S. The (random) sequence (Π n ) n∈N generated by the independence copula has this property with probability one, so such sequences exist (there is an obvious parallel with normal numbers).Is it enough for quasirandomness if the limit statement holds for all permutations of some fixed length k?It follows from (9) that this 'forcing property' would then automatically hold for all j ≥ k and, clearly, k = 2 is too small.This question has been answered in Král and Pikhurko (2013), who showed that quasiramdomness follows with k = 4, but not with k = 3.Their proof of the sufficiency part is based on the permuton approach discussed in Section 3. In fact, as every limit point C must satisfy t(σ ,C) = 1/4!for all σ ∈ S 4 , the statement boils down to a characterization property of the independence copula.Remarkably, in a statistical context, such a characterization had been obtained much earlier in Yanagimoto (1970), and it leads to an extension of Kendall's τ that is consistent against all alternatives.In both areas, related questions are active fields of research.In connection with quasirandomness we refer to Crudele et al ( 2023), for the statistical side see e.g.Shi et al (2022).

Delay models
Objects arrive at a system at times U 1 ,U 2 , . . .and leave at times U 1 + X 1 ,U 2 + X 2 , . .., where we assume that the arrivals are independent and uniformly distributed on the unit interval, that the delay times are independent with distribution function G, and that arrival and delay times are independent.Let Π n be the random permutation that connects the orders of the first n arrivals and departures.For example, in a queuing context, arriving customers might receive consecutively numbered tickets which they return on departure, and the tickets are put on a stack.
In Baringhaus and Grübel (2022) the resulting permutons, the delay copulas, are discussed.From a probabilistic and statistical point of view the information about the delay distribution contained in the permutations is of interest, together with the question of how to estimate (aspects of) the delay distribution.Another point of interest are second order approximations or, in general terms, the transitions from a strong law of large number to a central limit theorem.For the set of patterns of a fixed size this has already been important in Section 5.1.In Baringhaus and Grübel (2022) this is taken further by considering √ n(Π n (σ ) − t(σ ,C)) σ ∈S as a stochastic process with σ ∈ S as 'time parameter' and then establishing a functional central limit theorem.

Sparseness
The delay models considered in Section 5.2 can be related to the M/G/∞ queue where customers arrive at the times of a Poisson process with intensity λ .There are infinitely many servers so, strictly speaking, there is no queuing.The limits refer to an increasing arrival rate and thus generate a 'dense' sequence of permutations as the service time distribution is kept fixed.Here we regard the standard M/G/1 model with only one server and fixed arrival rate; for convenience we start with an empty queue at time 0. From the first n ∈ N arrivals and departures we still obtain a sequence (Π n ) n∈N of random permutations, with Π n ∈ S n for all n ∈ N. We argue that this sequence is 'sparse', and that the pattern frequency topology does not provide much insight.
We assume that the service time distribution has finite first moment µ and that ρ < 1, where ρ := λ µ is known as the traffic intensity.The queue is then stable and the queue length process Q = (Q t ) t≥0 , with Q t the number of customers in the system at time t, can be decomposed into alternating busy and idle periods.These are independent, and the individual sequences of busy and idle pieces of Q are identically distributed.Obviously, arrival and departure times of any particular customer belong to the same busy period.Let K i be the number of customers in the ith period.We recall the definition of the direct sum of finite permutations: For σ ∈ S k , τ ∈ S l , we obtain the sum σ ⊕ τ ∈ S l+k in one-line notation as Iterating this argument we see that, as n → ∞, Π n decomposes into subpermutations related to the sequence of busy cycles.Also, for any given i, Π n (i) remains constant as soon as n exceeds the number of the first customer no longer in the same busy period as customer i.Taken together this leads to the following result.
Proposition 1 Let (Π n ) n∈N be the sequence of permutations generated by an M/G/1 queue with traffic intensity ρ < 1.Then Π n → Π ∞ almost surely in the projective topology, with Π ∞ = distr ∞ i=1 Ψ i , where Ψ i ∈ S, i ∈ N, are independent and identically distributed and The distribution L (Π ∞ ) of the limit Π ∞ is fully characterized by L (Ψ 1 ), which may in turn be specified by L (K 1 ) and the conditional distribution L (Ψ 1 |K 1 ).Nothing is known (to me) about the latter, apart from the obvious fact that it is concentrated on the subset of S K 1 of permutations that cannot be written as a direct sum.
The sequence (Π n ) n∈N in Proposition 1 is contained in the compactification of S that we used in the 'dense' situation.Under a mild moment condition we obtain the corresponding set of limit points.
Proposition 2 Suppose that, in addition to the assumptions in Proposition 1, the service time distribution has finite third moment.Then, in the pattern frequency topology, Π n → C ∞ almost surely, where the permuton C ∞ is given by C ∞ (u, v) = min{u, v} for all u, v ∈ [0, 1].

Proof:
The path-wise argument used for Proposition 1 shows that for any pair (i, j) with i < j and Π n (i) > Π n ( j) customers i and j must belong to the same busy period.In particular, so that the relative frequency of the inversion τ = 21 satisfies t(τ, Π n ) ≤ 2 M n /(n − 1).It follows from Section 5.6, p158 in Cox and Smith (1961) that EK 3 1 < ∞ under the above moment assumption.By a standard argument this implies M n /n → 0 almost surely.Now let σ be a permutation that contains an inversion.The relative frequency t(σ , π) of σ in π ∈ S n , n ≥ k := |σ |, can be interpreted as the probability that π is chosen uniformly at random; see also the remarks at the beginning of Section 3. Further, choosing {i, j} ⊂ [k] leads to an inversion with probability p > 0, where p does not depend on n.In the two-stage experiment, with independent steps, we would thus find an inversion in Π n with probability p • t(σ , Π n ).This is bounded from above by t(σ , Π n ), and the first step of the proof therefore implies that t(σ ,C) = lim n→∞ t(σ , Π n ) = 0 for all permutations that contain an inversion.As the subsampling must lead to some element of S k we see that any limit permuton C must assign the value 1 to each identity permutation.This holds for the copula in the assertion of the theorem, and an appeal to uniqueness of the limit completes the proof.Thus, from the pattern frequency point of view, there is asymptotically no difference between M/G/1 and the queue where customers depart in order of their arrival, such as in a system with immediate service and constant service times.

Pattern avoiding and stack sorting
In Bassino et al (2018) the authors deal with separable permutations, which are those that avoid the two patterns 2413 and 3142.This class is of interest as it appears in connection with stack sorting, for example.(The permutation in our data example is not separable; see the red dots in Figure 1.) Starting with the sets AV n := {π ∈ S n : t(2413, π) = 0, t(3142, π) = 0} the main question is the limit distribution (in the weak topology related to the pattern frequency topology) of Π n ∼ unif(AV n ) as n → ∞.Whereas we often obtain a limit that is concentrated at one point, such as the independence copula in connection with the unrestricted case where Π n = unif(S n ) in Section 5.1, or in the delay context in Section 5.2, it turns out that the limit distribution for uniformly distributed separable permutations is 'truly random'; in fact, this distribution is an interesting object on its own.The analysis in Bassino et al (2018) is based on the fact that separable permutations may be coded by a specific set of trees, where the operation ⊕ mentioned in Section 5.3 together with its 'skew' variant ⊖ plays a key role.I do not know at present if this fits into the Markovian framework.Is there a Markov chain adapted to S with marginal distributions uniform on AV n and such that the Doob-Martin approach leads to the pattern frequency topology?
Again, this is an active area of research.We refer the reader to Janson (2020) for a recent contribution, which is of particular interest in the context of the present paper because of its use of a variety of probabilistic techniques.

Complements
We sketch some related developments, restricting references essentially to those that can serve as entry points for a more detailed study.

Other combinatorial families
As pointed out in Hoppen et al (2013) the construction of permutons as limits of permutations via pattern frequencies has been influenced by the earlier construction of graphons as limits of graphs via subgraph frequencies; see Lovasz ( 2012) for a definite account and, in addition, Diaconis and Janson (1988) for a probabilistic view.It was observed in Grübel (2015) that, with a suitable Markov chain, the topology based on subgraph frequencies is the same as the Doob-Martin topology arising from the associated boundary, in analogy to Theorem 4 above.A notable difference between the permutation and the graph situation is that graphs are considered modulo isomorphisms.In Grübel (2015) a randomization step was used to take care of this, Hagemann (2016) showed that one can work directly with the equivalence classes.
Markov chain boundary theory has been used in connection with limits of random discrete structures in a variety of combinatorial families other than S; see Grübel (2013) for an elementary introduction and references.We single out the case of binary trees, where B n is the set of binary trees with n (internal) nodes and B = ∞ n=1 B n is the graded state space.Processes X = (X n ) n∈N with values in B arise naturally in two different situations.First, if we apply the BST (binary search tree) algorithm sequentially to a sequence of independent and identically distributed real random variables with continuous distribution function, and secondly, in the context of Rémy's algorithm, where X n is uniformly distributed on B n .Both processes are Markov chains adapted to B, but the associated transition graphs and, consequently, the cotransitions and the Doob-Martin compactifications of B, are quite different.For search trees the role of pattern or subgraph frequencies is taken over by relative subtree sizes, and the permuton or graphon analogues are the probability distributions on the set of infinite 0-1 sequences; see Evans al (2012).In the Rémy case a class of real trees appears, together with a specific sampling mechanism; see Evans et al (2017).
Another combinatorial family that is related in several ways to the topics discussed in the present paper is the family Y = n∈N Y n of (number) partitions.Here λ We abbreviate this to λ ⊢ n.Each σ ∈ S n defines a partition λ ⊢ n via the length of its cycles, in decreasing order.The right hand side of (1), for example, leads to λ = (5, 3, 1).On Y a partial order can be defined as follows: 3 shows the first five levels of the associated Hasse diagram.We obtain weights for the edges of the graph by 'atom removal': For example, to go from (3, 2) to the two predecessors (3, 1) and (2, 2) respectively there are two possibilities to decrease 2 to 1 in the first and three to decrease 3 to 2 in the second case.Normalizing these values so that they sum to 1 we obtain the cotransitions for a family of Markov chains adapted to Y. Fig. 3 The transition graph for integer partitions Suppose now that (λ (n)) n∈N is a sequence in Y where we again assume for simplicity that λ (n) ∈ Y n for all n ∈ N. It turns out that the Doob-Martin topology associated with these cotransitions is equivalent to the convergence of the normalized partition parts λ (n) i /n as n → ∞, for all i ∈ N, and that ∂ Y =: ∂ Y c is homeomorphic to the space of weakly decreasing sequences (α i ) i∈N with ∑ ∞ i=1 α i ≤ 1, endowed with the trace of the product topology on [0, 1] ∞ .

The cycle view
Above we worked with the order isomorphism aspect of permutations and the associated partial order on S given by pattern containment.Using cycles instead leads to another partial order on S where, for σ ∈ S m and τ ∈ S n with m ≤ n, the relation σ ≤ τ means that in the cycle notation, σ arises from τ by deleting all numbers greater than m (some rearrangement may be necessary to obtain the standard notation).As an example we consider the two sides of (1) again: The order restriction to the set [4] in the one-line notation on the left leads to 3241 ∈ S 4 , which is (134)(2) in standard cycle notation.The cycle restriction to [4] of the permutation on the right hand side is (1)(432) in standard notation, which is 1423 in one-line notation.In particular, Foata's correspondence is not consistent with the two notions of restriction.Nevertheless, the correspondence, together with the construction of Π F on the left hand side, can be used to motivate a Markov chain Π c = (Π c n ) n∈N that is adapted to S and compatible with this order, and has Π c n ∼ unif(S n ) for all n ∈ N. In this construction, known as the Chinese restaurant process, cycles are interpreted as circular tables and customer n + 1 selects one of the n already seated customers as right neighbor (successor in the cycle notation), or starts a new table, where the n + 1 possibilities are chosen with the same probability.Note that Π c is projective in the sense that previous values are functions of the present state.
The cycle view is closely related to number partitions: Mapping a permutation to its ordered cycle lengths leads to a function Ψ : S → Y that preserves the grading and the respective partial orders.Let Then Λ c is again a Markov chain, and it has the cotransitions introduced in Section 6.1 for the family Y.Hence, almost surely as n → ∞, Λ c n converges to an element The distribution of the limit, which is not concentrated at one point of the boundary, can be obtained by stick breaking: Starting with independent and unif(0, 1)-distributed random variables Putting these in decreasing order provides a random element of ∂ Y c that has the same distribution as Λ c ∞ .Note that this approach refers to the big cycles.Locally, at the small end, the limit can be obtained from (3): For i ∈ N fixed, the counts of cycles of length k, 1 ≤ k ≤ i, are asymptotically independent and Poisson distributed with parameters 1/k.
The cycle notation displays a permutation as a product of cyclic permutations that act on disjoint parts of the base set.In contrast to the general case such products are commutative.The cycle view is closely connected to the group aspects of permutations, in particular to the representation theory of finite groups.Many probabilists and statisticians became aware of this connection and the resulting 'non-commutative Fourier analysis' through Diaconis (1988); more recent and extensive presentations are Ceccherini-Silberstein et al (2008) and Méliot (2017).We briefly summarize some aspects that are relevant to the asymptotics of large permutations.All representations below refer to base field C, GL(V ) denotes the general linear (or automorphism) group of the complex vector space V , and U(n) is the group of unitary n × n-matrices.
As with compactifications, we begin with an embedding: We regard the elements g of a finite group G as elements of the vector space C G of functions f : G → C via σ → δ σ , where δ σ (σ ) = 1 and δ σ (τ) = 0 if τ ̸ = σ .With the composition of σ , τ ∈ G written as σ τ we then define convolution on C G by Seen as multiplication, convolution makes C G an algebra, the group algebra C[G] associated with G. Also, (σ , f ) → σ .f := δ σ ⋆ f defines an action of G on V , and the function ρ : G → GL(V ), ρ(σ )( f ) := σ .f , is a group homomorphism.With respect to the canonical basis {δ σ : σ ∈ G} the values ρ(σ ) are all represented by unitary matrices.Thus, somewhat reminiscent of the fact that every finite group G with n elements is a subgroup of S n , every such G is a subgroup of U(n), both up to group isomorphism.This is known as the (left) regular representation of G.More generally, a representation (ρ,W ) of G consists of a vector space W and a homomorphism ρ from G to GL(W ).For example, representing permutations by their permutation matrices as in (4), we obtain the permutation representation of G = S n .
In a representation (ρ,W ) of G a subspace U of W is invariant if ρ(σ )(U) = U for all σ ∈ G, and the representation is irreducible if only U = {0} and U = W are invariant.Necessarily, the range of ρ is then the full group GL(U).It is a crucial fact that the regular representation (ρ, C[G]) can be decomposed into the direct sum ( i∈I ρ i , i∈I W i ) of irreducible representations (ρ i ,W i ).Let d i := dimW i .For later use we note that, with n the size of G, counting dimensions leads to ∑ i∈I d 2 i = n.The character χ : G → C of a representation ρ is given by χ(σ ) := Tr(ρ(σ )), where Tr denotes the trace (which does not depend on the basis chosen to represent ρ(σ ) by a matrix).For the permutation representation χ(σ ) is easily seen to be the number of fixed points of σ .
We recall that general groups can be decomposed into conjugacy classes, which are the equivalence classes obtained when σ , τ are equivalent if σ π = πτ for some π ∈ G.A function f ∈ C[G] is a class function or central if it is constant on conjugacy classes.The characters of representations are such class functions, and it turns out that the characters of the irreducible representations constitute a basis for the space (in fact, a convolution algebra) of class functions.Moreover, different irreducible representations lead to different characters.For G = S n the conjugacy classes correspond to cycle structures and may thus be represented by partitions of n, i.e. elements of Y n .Remarkably, the characters of irreducible representations can also be parametrized by such partitions.This finishes our excursion, and we return to permutation asymptotics.The algebraic point of view mainly refers to characters and thus to partitions, where it leads to a close relative of the Markov chain Λ c = (Λ c n ) n∈N discussed above.For this, our main source is the book Kerov (2003); see also the references given there.
It is convenient to augment the permutations of [n] by fixed points so that a bijection of N is obtained that leaves all k > n invariant.We continue to write S n for these 'padded' versions, and regard them as an increasing sequence of subgroups of the group S ∞ that consists of all finite bijections σ : N → N, meaning that #{k ∈ N : σ (k) ̸ = k} < ∞.A representation ρ n+1 of S n+1 then leads to a representation ρ n of S n by restriction.This will in general destroy irreducibility, but the character of ρ n is a class function and may thus be written as a linear combination of the irreducible characters on level n.It turns out that the non-zero coefficients are all equal to one.Consider now the graph on Y with edges connecting the character of an irreducible representations on level n + 1 to the contributing characters of the irreducible representations on level n.This is the same graph as the transition graph obtained above for number partitions, see Figure 3, but the edge weights are now all equal to 1.The resulting cotransitions then amount to the rule that, from a current state η ∈ Y n , a state λ ∈ Y n−1 is chosen uniformly at random from its predecessors.The dimension numbers d λ , λ ∈ Y, turn out to be equal to the number of paths in the diagram that lead from its root to λ .As a consequence the cotransition associated with an edge {λ , η}, λ < η, of the transition graph is given by d λ /d η .
When does a sequence of characters (χ n ) n∈N of irreducible representations or, equivalently, a sequence of partitions (λ (n)) n∈N , converge in the Doob-Martin topology associated with these cotransitions?Or, in other words, what is the cycle view analog of the pattern frequency topology?The answer requires one more definition: The conjugate (or transpose) of a partition λ = (λ 1 , . . ., λ k ) is given by λ ⋆ = (λ ⋆ 1 , . . ., λ ⋆ j ) with j = λ 1 and λ ⋆ l = #{m ∈ [k] : λ m ≥ l}.Convergence then means that the normalized partition components of λ (n) ∈ Y n and λ ⋆ (n) converge as elements of the unit interval: The boundary is known as the Thoma simplex, together with the topology of pointwise convergence.The boundary ∂ Y c for the partition chain obtained above in connection with the Chinese restaurant process can be identified with the compact subset of ∂ Y T that arises if all β -values are equal to zero.
A specific combinatorial Markov chain adapted to Y is given by the Plancherel growth process Λ P = (Λ P n ) n∈N , with transition probabilities and marginal distributions P(Λ It follows from the above dimension counting that the latter are indeed probability mass functions on Y n , and the calculation between Lemma 1 and Theorem 2 confirms that Λ P has the cotransitions associated with character restrictions.In contrast to the partition chain (Λ c n ) n∈N arising in the cycle length context, the limit distribution for the Plancherel chain (Λ P n ) n∈N is concentrated at the one point of the boundary ∂ Y T given by α i = β i = 0 for all i ∈ N. The analysis of this chain leads to some quite spectacular results, such as the arcsine law for the limit shape of Young diagrams, and the solution of Ulam's problem on the longest increasing subsequences in Π n ∼ unif(S n ).We refer to Kerov (2003) again, for Ulam's problem see also Romik (2015).
In connection with trees we had two different graph structures on B.Here the graphs on Y are the same, but the weights are different.A generalization that includes both the cycle model and the Plancherel process is given in Kerov et al (1998).There, an important aspect is the appearance of classical families of symmetric polynomials in the context of the respective extended Martin kernel.

Exchangeability
In Section 4 we worked with a general Markov chain X = (X n ) n∈N that is adapted to a graded state space S = n∈N S n and we used the cotransitions of X to obtain a compactification S = S⊔∂ S of the state space, together with a limit variable X ∞ for the X n 's as n → ∞.Each boundary value α ∈ ∂ S induces a probability measure P α , which is the model for X conditioned on X ∞ = α.Further, an arbitrary distribution µ on the Borel subsets of ∂ S may be used to construct a Markov chain that has the same cotransitions as X and limit distribution L (X ∞ ) = P α µ(dα), the µ-mixture of the P α 's.We note that this is the time reversal version of the familiar 'forward' situation where the distribution of a Markov chain is specified by the distribution of the first variable and the (forward) transition probabilities.Here, however, the distribution of X ∞ is usually defined on a non-discrete space, and there is of course no step from ∞ to '∞ − 1'.
The above shows some similarities to the archetypical exchangeability result, de Finetti's theorem: We start with a sequence X = (X n ) n∈N of real random variables that is exchangeable in the sense that the distribution L (X) of X is invariant under all σ ∈ S ∞ , the set of finite permutations of N introduced in Section 6.2.We then obtain a limit M ∞ for the empirical distributions M n := 1 n ∑ n i=1 δ X i and it holds that L (X|M ∞ = µ) = L ( X) where X = ( Xi ) i∈N with Xi , i ∈ N, independent random variables with distribution µ.This area has developed into a major branch of modern probability, dealing with structural results for distribution families with certain invariance properties.Kallenberg (2005) is a standard reference, but see also Aldous (1985) and Austin (2008).An excellent introduction is also given in the first part of the lecture notes Austin (2013).
Exchangeability may provide an approach to the asymptotics of random discrete structures; see e.g.Section 11.3.3 in Lovasz (2012) for graphs and Evans et al (2017) for Rémy trees.(In the other direction, a proof for the classical de Finetti theorem can be given using Markov chain boundary theory; see Gerstenberg et al (2016).)In their treatment of random permutations and permutons Hoppen et al (2013) emphasize the connection to random graphs and graphons.Our aim here is to extend this to the exchangeability aspect.
In the subgraph frequency topology for sequences of (random) graphs the limits are described by a (possibly random) graphon, a measurable and symmetric function W : Given W , we use a sequence U = (U i ) i∈N of independent uniforms to construct a random binary N × N-matrix Z by choosing Z i j = Z i j = 1 with probability W (U i ,U j ), 1 ≤ i < j < ∞, independently for different pairs, and Z ii = 0 for all i ∈ N.This matrix is jointly exchangeable in the sense that, for all σ ∈ S ∞ , Z σ := (Z σ (i),σ ( j) ) i, j∈N has the same distribution as Z.The upper n × n-corner of Z is the incidence matrix of a random graph G n .As n → ∞, these converge in the subgraph frequency topology, and the limit is represented by W .The graphon may be regarded as an analogue of the measure M ∞ in the classical case of exchangeable sequences, and the second step as an analogue of sampling from M ∞ .
Is there a similar representation for random permutations, specifically for the copula-based models in part (c) of Theorem 1? We need an infinite matrix that represents the complete sequence, with the upper left n × n-corner for the result of the first n steps.Starting with independent random vectors (X i ,Y i ), i ∈ N, with distribution function C, we define an infinite random binary array Z = (Z i j ) i, j∈N by For example, if the cities in our data set arrive in order of decreasing population size (Berlin, Hamburg, Munich, Cologne . ..) then the upper left 4 × 4-corner of Z is Within this group, there is one city with more citizens than Munich that is further to the east, and none of them is further to the south.The permutation Π n can be obtained from (Z i j ) 1≤i, j≤n as follows: With we get the absolute ranks of the variables X i , 1 ≤ i ≤ n, within {X 1 , . . ., X n }, and a similar formula holds for the Y -components.Then Π n can be determined from the two rank vectors as in ( 6).Equivalently, we may work with an array Z indexed by subsets {i, j} of N of size two, i < j, by using the values 0, 1, 2, 3 for indicating the relative position of (X j ,Y j ) with respect to (X i ,Y i ) through the four quadrants North-East (NE), SE, SW, and NW.If σ : N → N is strictly increasing, then the matrix Z σ with entries Z σ (i),σ ( j) depends on (X σ (i) ,Y σ (i) ), i ∈ N, in the same (deterministic) way as Z depends on (X i ,Y i ), i ∈ N. As the subsequence (X σ ,Y σ ) is equal in distribution to the original sequence (X,Y ), the arrays Z σ and Z are then equal in distribution, which shows that Z is contractable.An analogous statement holds for the corresponding array Z indexed by size two subsets of N. It follows from the general Aldous-Hoover-Kallenberg representation theorem that a contractable array can be extended to an exchangeable array; see Corollary 7.16 in Kallenberg (2005).
In order to construct a suitable graphon analogue W we note that the copula C represents a distribution on the unit square and thus may be written as a composition of the distribution function of the first variable and the conditional distribution function G(x, •) of the second variable, given the value x for the first.Let W (x, y) := inf{z ∈ [0, 1] : G(x, z) ≥ y}, 0 ≤ y ≤ 1, be the corresponding quantile function.Further, let (U i ) i∈N and (V i ) i∈N be two independent sequences of independent unif(0, 1)-distributed random variables.By construction, (X i ,Y i ) = distr (U i ,W (U i ,V i )) for all i ∈ N, and by independence, this even holds for the two sequences.Thus the random binary matrix Z = ( Zi j ) i, j∈N given by Zi j =      1, if i < j and W (U i ,V i ) < W (U j ,V j ), 1, if i > j and U i < U j , 0, else, has the same distribution as Z.Of course, the conditional construction could have been done in the other direction.It is indeed quite common in these constructions that uniqueness of the representation only holds up to some equivalence, which may be difficult to describe.
It is of interest to know whether an exchangeable array is ergodic.For exchangeable sequences (X i ) i∈N this means that M ∞ ≡ µ for some fixed distribution µ, so that the X i 's are independent.In the permuton situation such extreme points correspond to a fixed copula, and this is always the case for the models in Theorem 1 (c).One of the interesting aspects of the results in Bassino et al (2018) is the fact that, for separable permutations, the limit object is not degenerate.
Above we have used random matrices in order to point out the similarity to random graphs and graphons.A more abstract and more general approach has been developed in Gerstenberg (2018), where cartesian products of total orders on N are considered and ergodicity is discussed in some detail.

Some connections to statistical concepts
Markov chain boundaries and exchangeable sequences both lead to parametrized families of probability distributions, where the parameter is the value of X ∞ in the first case and the value of M ∞ in the second.A relationship between the Martin boundary of Markov chains and parametric families has been pointed out early by Abrahamse (1970), together with a connection to exponential families which, roughly, appear as h-transforms in certain situations.Section 18 in Aldous (1985) deals with sufficiency and mixtures in the context of exchangeable random structures.In the framework of combinatorial Markov chains (X n ) n∈N discussed above, where we regard the value of X ∞ in the Doob-Martin compactification as a parameter θ and the values of the first n variables X 1 , . . ., X n as data, it is clear that X n is a sufficient statistic for θ as the conditional law of the data given X n can be reconstructed from the cotransitions, and these do not depend on θ .Lauritzen (1974) used this as a basis for his concept of total sufficiency; the paper also discusses a variety of related aspects.Lauritzen (1988) emphasizes the role of the Martin boundary as a basic concept.
Further, both the set of distributions on the boundary and the set of directing measures are convex, and 'pure parameters' or 'extreme models' correspond to the ergodic case, which are extremal elements of the respective convex set.This aspect has appeared repeatedly in the above examples.Dynkin (1978) introduced H-sufficiency, dealing with the question of whether the convex set is a simplex (in a barycentric sense).The latter points to a connection with geometry; see Baringhaus and Grübel (2021) for a recent contribution.
Two final comments may be in order, both are somewhat loose.First, as seen above, large random discrete structures can be investigated through the Doob-Martin boundary of Markov chains, or through the representation of exchangeable distributions.The first is based on the topological approach of constructing a limit for a sequence of growing objects, the second is based on the construction of an 'asymptotic template' from which the sequence can be obtained by sampling, and is of a more measure-theoretical nature.(Poisson boundaries, which we did not discuss, may be seen as a measure-theoretical variant of the former.)A similar distinction appears in connection with convex sets, with Choquet's theorem for topological vector spaces, and the barycenter approach motivated by potential theory.As a second comment, we note that permutations appear naturally in classical nonparametric statistics, where ranks are a basic tool, but that other combinatorial families may similarly be analyzed with a view towards statistical applications.Often the results on the discrete structures themselves can serve as a basis for obtaining asymptotics for a variety of specific aspects, in some resemblance to using functional limit theorems to obtain distributional limit theorems for a variety of specific statistics.