Permutation Invariant Gaussian Matrix Models

Permutation invariant Gaussian matrix models were recently developed for applications in computational linguistics. A 5-parameter family of models was solved. In this paper, we use a representation theoretic approach to solve the general 13-parameter Gaussian model, which can be viewed as a zero-dimensional quantum field theory. We express the two linear and eleven quadratic terms in the action in terms of representation theoretic parameters. These parameters are coefficients of simple quadratic expressions in terms of appropriate linear combinations of the matrix variables transforming in specific irreducible representations of the symmetric group S_D where D is the size of the matrices. They allow the identification of constraints which ensure a convergent Gaussian measure and well-defined expectation values for polynomial functions of the random matrix at all orders. A graph-theoretic interpretation is known to allow the enumeration of permutation invariants of matrices at linear, quadratic and higher orders. We express the expectation values of all the quadratic graph-basis invariants and a selection of cubic and quartic invariants in terms of the representation theoretic parameters of the model.



There are no comments yet.


page 1

page 2

page 3

page 4


Gaussianity and typicality in matrix distributional semantics

Constructions in type-driven compositional distributional semantics asso...

Linguistic Matrix Theory

Recent research in computational linguistics has developed algorithms wh...

Model selection in the space of Gaussian models invariant by symmetry

We consider multivariate centred Gaussian models for the random variable...

Representation Learning with Multisets

We study the problem of learning permutation invariant representations t...

Generalizations of k-Weisfeiler-Leman partitions and related graph invariants

The family of Weisfeiler-Leman equivalences on graphs is a widely studie...

Everybody's Got To Be Somewhere

The key to any nameless representation of syntax is how it indicates the...

Computing with quasiseparable matrices

The class of quasiseparable matrices is defined by a pair of bounds, cal...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

1 Introduction

In the context of distributional semantics [1, 2]

, the meaning of words is represented by vectors which are constructed from the co-occurrences of a word of interest with a set of context words. In tensorial compositional distributional semantics

[3, 4, 5, 6, 7]

, different types of words, depending on their grammatical role, are associated with vectors, matrices or higher rank tensors. In

[8, 9]

we initiated a study of the statistics of these tensors in the framework of matrix/tensor models. We focused on matrices associated with adjectives or verbs, constructed by a linear regression method, from the vectors for nouns and for adjective-noun composites or verb-noun composites.

We developed a 5-parameter Gaussian model,


The parameters are coefficients of five linearly independent linear and quadratic functions of the random matrix variables which are permutation invariant, i.e. obey the equation


for , the symmetric group of all permutations of distinct objects. This invariance implements the notion that the meaning represented by the word-matrices is independent of the ordering of the context words. General observables of the model are polynomials obeying the condition (1.3). At quadratic order there are linearly independent polynomials, which are listed in Appendix B of [8]. A three dimensional subspace of quadratic invariants was used in the model above. The most general Gaussian matrix model compatible with symmetry considers all the eleven parameters and allow coefficients for each of them. What makes the 5-parameter model relatively easy to handle is that the diagonal variables are each decoupled from each other and from the off-diagonal elements, and there are pairs of off-diagonal elements. For each , and mix with each other so the solution of the model requires an inversion of a matrix.

Expectation values of are computed as


where EXP is the product of exponentials in (1.2).

Representation theory of offers the techniques to solve the general permutation invariant Gaussian model. The matrix elements transform as the tensor product of two copies of the natural representation . We first decompose into irreducible representations of the diagonal .


The trivial (one-dimensional) representation occurs with multiplicity . The -dimensional irreducible representation (irrep) occurs with multiplicity . is an irrep of dimension which occurs with multiplicity . Likewise, of dimension occurs with multiplicity . As a result of these multiplicities, the 11 parameters can be decomposed as


is the size of a symmetric matrix. is the size of a symmetric matrix. More precisely the parameters form


where is the set of real numbers greater or equal to zero, is the space of positive semi-definite matrices of size . Calculating the correlators of this Gaussian model amounts to inverting a symmetric matrix, inverting a symmetric matrix, and applying Wick contraction rules, as in quantum field theory, for calculating correlators. There is a Graph basis for permutation invariant functions of . This is explained in Appendix B of [8] which gives examples of graph basis invariants and representation theoretic counting formulae which make contact with the sequence A052171 - directed multi-graphs with loops on any number of nodes - of the Online Encyclopaedia of Integer Sequences (OEIS) [10].

In this paper we show how all the linear and quadratic moments of the graph-basis invariants are expressed in terms of the representation theoretic parameters of (

1.7). We also show how some cubic and quartic graph basis invariants are expressed in terms of these parameters. These results are analytic expressions valid for all .

The paper is organised as follows. Section 2 introduces the relevant facts from the representation theory of we need in a fairly self-contained way, which can be read with little prior familiarity of rep theory, but only knowledge of linear algebra. This is used to define the 13-parameter family of Gaussian models (equations (2.115) ,(2.116), (2.118)). Section 3 calculates the expectation values of linear and quadratic graph-basis invariants in the Gaussian model. Sections 4 and 5 describe calculations of expectation values of a selection of cubic and quartic graph-basis invariants in the model.

2 General permutation invariant Gaussian Matrix models

We solved a permutation invariant Gaussian Matrix model with linear and quadratic parameters [8]. The linear parameters are coefficients of linear permutation invariant functions of and the quadratic parameters (denoted ) are coefficients of quadratic functions. We explained the existence of a parameter family of models, based on the fact that there are linearly independent quadratic permutation invariant functions of a matrix. The general -parameter family of models can be solved by using techniques from the representation theory of . Useful background references on representation theory are [11, 12, 13]. We begin by collecting the relevant facts which will allow a useful parametrisation of the quadratic invariants of a matrix . An important step is to form linear combinations of the labelled by irreducible representations of . The results of this step are in (2.68)-(2.77). The quadratic terms in the action of the Gaussian model are close to diagonal in these -variables.

The matrix elements , where run over span a vector space of dimension . It is isomorphic to the tensor product , where is a -dimensional space. Consider as a span of basis vectors . This is a representation of . For every permutation , there is a linear operator defined by


on the basis vectors and extended by linearity. With this definition, is a homomorphism from to linear operators acting on .


We can take the basis vectors to be orthonormal.


We can form the following linear combinations


is invariant under the action of


The one-dimensional vector space spanned by is an invariant vector subspace of . We can call this vector space . The vector space spanned by , where , which we call , is also an -invariant subspace.


We have some matrices such that


These matrices are obtained by using the action on the and the change of basis coefficients. The vectors for are orthonormal.


All the above facts are summarised by saying that the natural representation of decomposes as an orthogonal direct sum of irreducible representations of as


By reading off the coefficients in the expansion of the in , we can define the coefficients


They are


The orthonormality means that


The last equation implies that




we deduce


As we will see, this function will play an important role in calculations of correlators in the Gaussian model. It is the projector in for the subspace , obeying


Now we will use these coefficient to build linear combinations of the matrix elements which have well-defined transformation properties under . Define


The indices range over . These variables are irreducible under , transforming as . Under the diagonal , the first three transform as while form a reducible representation.

Conversely, we can write these variables in terms of the variables, using the orthogonality properties of the .


The next step is to consider quadratic products of these -variables, and identify the products which are invariant. In order to do this we need to understand the transformation properties of the above variables in terms of the diagonal action of . It is easy to see that is invariant. and both have a single index running over , and they transform in the same way as . The vector space spanned by form a space of dimension which is


Permutations act on this as


2.1 Useful facts from representation theory

  • The representation space can be decomposed into irreducible representations (irreps) of the diagonal action as


    In Young diagram notation for irreps of

  • These irreps are known to have dimensions . They add up to which is the dimension of .

  • The vector is invariant under diagonal action of the . The action of on is given by


    These can be verified to satisfy the homomorphism property


    We also have . Using these properties, we can show that is invariant under the diagonal action. The vector

  • The vector in coming from is simply


    The vector in inside (2.38) is some linear combination


    The coefficients are some representation theoretic numbers ( called Clebsch-Gordan coefficients ) which satisfy the orthonormality condition


    As shown in Appendix B, these Clebsch-Gordan coefficients are proportional to


    It is a useful fact that the Clebsch-Gordan coefficients for can be usefully written in terms of the describing as a subspace of the natural representation. This has recently played a role in the explicit description of a ring structure on primary fields of free scalar conformal field theory [14]. It would be interesting to explore the more general construction of explicit Clebsch-Gordan coefficients and projectors in the representation theory of in terms of the .

  • Similarly for we have corresponding vectors and clebsch-Gordan coefficients


    where ranges from to . We have the orthogonality property


    And for


    Here the runs over to .

  • The projector for the subspace of transforming as under the diagonal is

  • The projector for in is


    is just the anti-symmetric of . It is the orthogonal complement to inside the symmetric subspace of which is invariant under the swop of the two factors (often denoted )


    The quadratic invariant corresponding to is


    The quadratic invariant corresponding to is similar. We just have to calculate

  • The inner product


    is invariant under the action .

  • The following is an important fact about invariants. Every irreducible representation of , let us denote it by has the property that


    contains the trivial irrep once. This invariant is formed by taking the sum over an orthonormal basis .

  • To summarize the matrix variables

    can be linearly transformed to the following variables, organised according to representations of the diagonal


    Trivial rep: (2.68)
    Hook rep: (2.69)
    The rep : (2.70)
    The rep : (2.71)
  • For convenience, we will also use simpler names


    where we introduced labels to distinguish two occurrences of the trivial irrep in the space spanned by the . We will also use


    where we introduced labels to distinguish the three occurrences of the space spanned by . For the multiplicity-free cases, we introduce


    The variables can be written as linear combinations of the variables. Rep-basis expansion of


    In going from first to second line, we have used the fact that the transition from the natural representation to the trivial is given by simple constant coefficients. In the third line, we have used the Clebsch-Gordan coefficients for , obeying the orthogonality


    For , which is one dimensional, we just have


    It is now useful to collect together the terms corresponding to each irrep


    Using the notation of (2.72), (2.74), (2.77) , we write this as

  • The discussion so far has included explicit bases for inside which are easy to write down. A key object in the above discussion is the projector defined in (2.27). For the irreps which appear in , we will not need to write down explicit bases. Although Clebsch-Gordan coefficients for and appear in some of the above formulae, we will only need some of their orthogonality properties rather than their explicit forms. The projectors for in can be written in terms of the , and it is these projectors which play a role in the correlators we will be calculating.

2.2 Representation theoretic description of quadratic invariants

With the above background of facts from representation theory at hand, we can give a useful description of quadratic invariants. Quadratic invariant functions of form the invariant subspace of since transform as .


So there are two copies of , namely . contains three invariants.


These are all easy to write in terms of the original matrix variables (using the formulae for -variables in terms of