A dynamical version of the SYK Model and the q-Brownian Motion
Miguel Pluma, Roland Speicher

TL;DR
This paper extends the SYK model to a multivariate, dynamical setting, connecting it with q-Brownian motion and analyzing fluctuations and higher correlations, revealing parallels with higher order freeness in random matrices.
Contribution
It introduces a multivariate dynamical SYK model and establishes its relation to q-Brownian motion, extending fluctuation and correlation results.
Findings
Eigenvalue distribution limits for multivariate SYK
Connection between dynamical SYK and q-Brownian motion
Higher order correlation function analysis
Abstract
We extend recent results on the asymptotic eigenvalue distribution of the SYK model to the multivariate case and relate the limit of a dynamical version of the SYK model with the q-Brownian motion, a non-commutative deformation of classical Brownian motion. Furthermore, we extend the results for fluctuations to the multivariate setting and treat also higher correlation functions. The structure of our results for the sparse SYK random matrices resembles the formulas for higher order freeness for ordinary GUE random matrices.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRandom Matrices and Applications · Advanced Algebra and Geometry · Advanced Combinatorial Mathematics
A dynamical version of the SYK Model and the -Brownian Motion
Miguel Pluma and Roland Speicher
Abstract
We extend recent results on the asymptotic eigenvalue distribution of the SYK model to the multivariate case and relate the limit of a dynamical version of the SYK model with the -Brownian motion, a non-commutative deformation of classical Brownian motion. Furthermore, we extend the results for fluctuations to the multivariate setting and treat also higher correlation functions. The structure of our results for the sparse SYK random matrices resembles the formulas for higher order freeness for ordinary GUE random matrices.
1 Introduction
The SYK model was introduced by Sachdev and Ye [21] in 1993 as a model for a quantum random spin system and has attracted a lot of interest in the last few years since it was promoted in 2015 by Kitaev [15, 16] to a simple model of quantum holography. The SYK model is a quantum mechanical model for interacting Majorana fermions with a random coupling for a -interaction. In the original model, was independent of and equal to 4, but it has turned out that there are interesting and treatable limits for if one also scales the number of Majoranas in the interaction term as .
The SYK model is a kind of sparse random matrix model. It was observed, on various levels of physical and mathematical rigor (see, e.g., [11, 7, 9]), that the asymptotic eigenvalue distribution of the SYK model, depending on the parameter , is given by a -deformation of the Gaussian distribution. Such deformations have been considered before in various contexts in physics and mathematics. Most importantly, from our perspective, this distribution appears as the fixed time distribution of a non-commutative Brownian motion, realized on a -deformed version of a Fock space, as considered in [4, 5]. In this context there is a multivariate extension of the distribution from the fixed time random variable to the whole process. We want to investigate here, in how far there are multivariate extensions of the SYK model which match the distribution of the -Brownian motion. It turns out that replacing the couplings in the SYK model by independent classical Brownian motions will do the job. This yields a dynamical SYK model which converges to the -Brownian motion.
Our calculations are essentially adaptations of the calculations in [9, 7] to the multivariate situation. In this context we also want to point out the appearance of the -Gaussian distribution as a limit distribution of random matrix models in the papers [23, 22, 19].
It is not clear to us whether this multivariate versions have any physical relevance; but we want to point out that recently Berkooz and collaborators computed in [2, 3] the 2-point and 4-point function of the large double-scaled SYK model, by using also the combinatorics of such multivariate extensions. The problems they encounter there are related to the lack of a good analytic description of the distribution of the multivariate -Gaussian distribution. We will say a few words on these problems in the final section of this paper.
We will also look on the multivariate extension for the calculation of fluctuations from [10], extending this also to higher correlation functions. It would be interesting to put these fluctuations into the setting of second and higher order freeness [6, 17]; however, as the random matrix models considered here are quite sparse they seem to be too far away from such a setting; in particular, the case , which gives asymptotically the semicircular distribution has quite different fluctuations from the GUE, which is the “canonical” random matrix model for the semicircle. On the other hand, the form of our results in Theorem 4.1 shows still some features of “partitioned permutations”, which are the main conceptual tools for dealing with higher order freeness in [6]. This points at the possibility that there might be a form of “higher order freeness” for sparse random matrices. This has to be investigated further.
What we are providing here is a dynamical version of the SYK model. For the relevance of embedding the SYK model into a process, let us emphasize that having process versions of random matrix models or non-commutative distributions might be an advantage, even if one is only interested in the marginal distribution at one fixed time. Much of recent progress of Erdös, Yau and coworkers on properties of eigenvalue distributions relies on such a dynamical approach to random matrices, see for example [8]. Also the recent breakthrough of Driver, Hall, and Kemp for the calculation of Brown measures depends crucially on the study of the time evolution of the involved processes; for this, see the recent survey [12]. We will be looking on our dynamical version of the SYK model from this point of view in forthcoming investigations.
2 Preliminaries
2.1 Set partitions
For any positive integers we define . The set for , will be also denoted by . Denote the set of partitions of by . This means that if , then is a non empty set of subsets of , any pair is disjoint as long as , and . Elements in will be called blocks. The set of partitions has an order structure given as follows: for we say if every block of is contained in a block of . With this order, is a lattice, i.e., for , there exists a uniquely determined maximum, , and a uniquely determined minimum, , in . It is common to denote by the partition in with one block.
The size of a set will be denoted by .
A basic ingredient in the construction of -Gaussian variables is played by pair partitions. The set of pair partitions on is defined as follows
[TABLE]
For a pair partition , we will say that two different blocks and are crossing, if or . If does not have a crossing we will say it is non-crossing. Furthermore for we will denote by the number of crossing blocks in , i.e.,
[TABLE]
2.2 Notation for products of non-commutative variables
Consider a family of non-commutative variables. Given we denote
[TABLE]
In case we have several families of non-commutative variables for we will also use similar notation. That is, given and we denote
[TABLE]
It will be useful to specify the functions via partitions. For this purpose we define for every function between discrete spaces
[TABLE]
Given , we will denote the common value of in by
[TABLE]
where .
2.3 The SYK model
The Sachdev–Ye–Kitaev (SYK) model was introduced in [21] and [15] as a model for a quantum magnet and quantum holography, respectively. Let be an even number and consider Majorana fermions, i.e. variables which fulfill the following relations
[TABLE]
These variables can be realized using Pauli matrices
[TABLE]
in the following fashion: for each Majorana fermion is constructed as an -fold tensor product
[TABLE]
where the in the tensor products represent the identity matrix. In particular, for the above expressions reduce to and . In this way the Majorana fermions are realized as square matrices of size .
The SYK model is a random linear combination of products of many (with ) Majorana fermions, and is defined as
[TABLE]
where the random coefficients are independent real random variables with moments of all orders and
[TABLE]
Note that the factor (where is here ) is needed to make selfadjoint.
In the main theorem about expectations in Section 3 we do not assume the variables to be identically distributed, but we do require uniformly bounded moments. For the result about fluctuations and higher correlations in Section 4 we do require identical distribution and, in order to keep things simple, we also assume a Gaussian distribution. It will be important to distinguish the parity of , see Theorem 3.1.
We are interested in the distribution of products of independent copies of the SYK-model. For this purpose it is convenient to have a compact notation for (5). This motivates the following notation: for consider the set of tuples
[TABLE]
and for each denote and consider the new variables
[TABLE]
Then for we rewrite the SYK-model as
[TABLE]
We collect some properties of the variables (6) in the following lemma. See Section 5 for the proof.
Lemma 2.1**.**
For every with we have the identities
[TABLE]
and
[TABLE]
where stands for the number of common indices in and .
So, for two different multi-indices and , the variables and commute or anti-commute depending on the parity of and on the size of the intersection of the multi-indices. The variables (6) also behave well with respect to the trace, see Lemma 3.3.
For square matrices we will denote
[TABLE]
where is the usual non-normalized trace.
2.4 -Gaussian distribution and -Brownian motion
The -Gaussian distribution, also known as -semicircular distribution, was introduced in [4, 5] in the context of non commutative probability. In this section we will review some basic definitions, for this purpose we will mainly follow [4]. In the following is fixed. Consider a Hilbert space . On the algebraic full Fock space
[TABLE]
– where with a norm one vector , called “vacuum” – we define a -deformed inner product as follows:
[TABLE]
where
[TABLE]
is the number of inversions of a permutation . In [4] it was shown that this inner product is positive definite, and has a kernel only for and .
The -Fock space is then defined as the completion of the algebraic full Fock space with respect to this inner product
[TABLE]
In the cases and we have to first divide out the kernel, thus leading to the symmetric and anti-symmetric Fock space, respectively.
Now for we define the -creation operator , given by
[TABLE]
Its adjoint (with respect to the -inner product), the -annihilation operator , is given by
[TABLE]
Those operators satisfy the -commutation relations
[TABLE]
For , , and this reduces to the CCR-relations, the Cuntz relations, and the CAR-relations, respectively. With the exception of the case , the operators are bounded.
Operators of the form
[TABLE]
for are called -Gaussian (or -semicircular) elements.
Finally, on we consider the vacuum expectation state
[TABLE]
The (multivariate) -Gaussian distribution is defined as the non commutative distribution of a collection of -Gaussians with respect to the vacuum expectation state. As was shown in [4], the joint distribution of for is given by the following -deformed version of the Wick/Isserlis formula: for any we have
[TABLE]
In the case of orthonormal this reduces to
[TABLE]
Of course, in the case , has to be understood as 1, i.e., in this case the factor is suppressing all crossing pairings and the sum is effectively just running over non-crossing pair-partitions.
For , the -Gaussian distribution is a probability measure on the interval , with analytic formulas for its density, see Theorem 1.10 in [5]. For the special cases , , and , this reduces to the classical Gaussian distribution, the semicircular distribution, and the symmetric Bernoulli distribution on , respectively.
The -Brownian motion is a special process version of the -Gaussian distribution. Namely, if we take as our underlying Hilbert space and as indexing vectors the family () of characteristic functions of intervals , then the process with
[TABLE]
is called -Brownian motion. In the case it is indeed classical Brownian motion (in the sense that it has the same expectation values as classical Brownian motion), and in the case it is free Brownian motion.
3 Expectations for the dynamical model
In this section we present a multi-variable as well as a dynamical version of a result from [9] and [7].
Theorem 3.1**.**
*Consider independent and identically distributed copies
of the SYK model , with uniformly bounded random coefficients (5). We assume the existence of the limit*
[TABLE]
and describe this in terms of a number in the following form:
- i)
If is a sequence of even positive integers, then .
- ii)
If is a sequence of odd positive integers, then .
Then converges in distribution to a tuple of -Gaussian variables for an orthonormal system . Concretely, this means that for every positive integer and for every , we have that
[TABLE]
Note that all three expression in (11) are zero when is odd.
Corollary 3.2**.**
Consider the following dynamical version of the SYK model:
[TABLE]
where the (with , ) are independent classical Brownian motions, and the and are as in Theorem 3.1. Then, the process converges, for , to the -Brownian motion as given in (10), in the sense that we have for all that
[TABLE]
Note that Corollary 3.2 follows from Theorem 3.1 by writing all the appearing as well as the corresponding as sums for orthogonal increments and then expand everything in a multilinear way.
Thus it suffices to prove Theorem 3.1. For the proof of this we will rely on the following two lemmas. The proof of those will be postponed to Section 5.
Lemma 3.3**.**
For every we have the following
- i)
If every block in has even size, then , where I is the identity matrix.
- ii)
For with we have the identity
[TABLE]
where the sum is taken over all pairs of crossing blocks in . We are using here notation (1) and (3). Also, for we denote by , the set of indices that and have in common.
Note that, contrary to first impression, the term (14) does not depend on , even in the case where is not a pairing itself; for this note that, for example, the contribution for a crossing of two blocks with the same value of is given by
[TABLE]
Lemma 3.4**.**
Let be a pairing and consider the following sum
[TABLE]
- i)
Then we have the following limit
[TABLE]
- ii)
Let be a block of . If we fix in (15) the value of corresponding to this block and sum only over the remaining ’s, then the result of this restricted sum
[TABLE]
is the same as in (15), independent of the chosen block and of the fixed value for .
Proof of Theorem 3.1.
Consider the following expansion for the left side of (11)
[TABLE]
The variables , for , were introduced in (6). We are also using the notation for products of non-commutative variables as introduced in (1) and (2). Thus , , and ; note that each is actually a for , i.e., a product of -many ’s.
We can split the sum in (18) as
[TABLE]
The last term does not contribute, because if then has a block of size one, and then .
By noticing that always , we get for the case the bound
[TABLE]
The constant comes from the uniform bound condition on the random coefficients in (5) and is the number of possible with . The estimate (19) shows that this term does also vanish in the limit .
So we are left with the sum over . Since we can assume , otherwise has a block of size one, then . Also the condition implies
[TABLE]
This together with Lemma 3.4 yields
[TABLE]
For each fixed with we can bound, similar as in (19), the corresponding correction term:
[TABLE]
The binomial factor comes here from the number of possibilities of joining two blocks of .
Hence the right hand side of (3) reduces to the first term, which is, by (9), the corresponding moment for a -Gaussian family. This concludes the proof of Theorem 3.1. ∎
4 Fluctuations and higher order correlations for the multivariate model
The classical cumulants are a family of multilinear functionals, given by
[TABLE]
where stands for
[TABLE]
and is the Möbius function. This family of functionals characterizes tensor independence. See for example [18] for more details on this.
In this section we will identify the convergence of , in a similar way as in Theorem 3.1. Theorem 4.1 is an extension of a result that originally appeared in [10]. We will restrict here to the multivariate version for independent copies. The extension of this to the dynamical version follows as before easily via multilinear extension; in order to keep the notation as simple as possible we refrain from giving this dynamical version explicitly.
Theorem 4.1**.**
Let be independent copies of the SYK model from Equation 5, with centered Gaussian random coefficients. For positive integers set and denote , where . Given a function , let us denote for each the functions . Under the same assumptions on and as in Theorem 3.1, we have
[TABLE]
where the parameter is determined in the same way as in Theorem 3.1.
Note in the above the distinction between and . The former is the restriction of the function to the set , whereas the latter is just the value of at the point 1. Accordingly, on the left hand side of the equation, denotes actually the product .
Proof.
By the multilinear property of the cumulant we have
[TABLE]
Using the formula for cumulants with products as entries and the Gaussianity of the random variables we get
[TABLE]
and the contribution is 1 if and , otherwise it is equal to zero. So we have
[TABLE]
In order to have non-vanishing contributions in this sum we need that the terms are different from zero. This will give in leading order additional constraints on the relevant . Since can only take on the values [math] or , we will take the absolute value of the above equation,
[TABLE]
and we are trying to identify the leading order contributions to this sum. Note that according to our normalization we expect this to be of order .
is a pairing on , but its restriction to the interval consists of pairs and singletons; some pairs of connect different intervals and thus those pairs decompose into two singletons under the restriction. In our sum over all we can sum over all which correspond to pairs of the ; the corresponding factors in appear then also in pairs and we will, by Lemma 3.3, not change the value of if we cancel the factors; on the other hand for each pair in we have many to sum over. Hence removing the pairs of all will change the problem to an equivalent one and it suffices to consider the situation where all restrictions consist just of singletons. Again, in this situation the most canonical way to achieve that is different from zero is if every factor of comes in pairs. However, there are now also contributions which are not of this form; however, we expect that they appear in smaller orders - that’s what we want to show in the following.
We have now the situation that all consist only of singletons. There will be some for which consists only of one element - however, then =0, since is then just one of the and its trace vanishes. So such a situation does not contribute. Next, there will be some for which consists of exactly two elements. Then is equal to a product , and the trace of this can only be different from zero if , i.e., we can restrict to summing over the situation that is a pair. As before we can remove this pair (and identify the two corresponding half-edges) and reduce the problem thus further. So, iterating all these reductions, in the end we are left with a situation where each contains at least three elements. Now we have to estimate more seriously. Let us check what happens when we remove again one the intervals together will all its . Note that the other ends of the removed singletons ly in some other intervals, thus the corresponding there can not be summed over in the following, but its value will be fixed. Hence, on such an interval we will have to control in the following an expression of the form , where can be any arbitrary product of ’s and we sum over . Let us now control the effect of removing such a . If contains elements, we are removing the sum over many ’s and we are reducing the number of intervals by 1. What is the contribution of the removed ’s in the original sum? Since only terms with are relevant, we cannot sum over all the ’s independently, but if we choose the values of the first ones, then the remaining is fixed (where it could be that this fixed value is not a valid product of -many different ’s), thus we have removed at most a contribution of . So this reduction is again consistent with our highest order conjecture. We just continue with all our reductions since nothing is left. Of course, this is not good as we have then just estimated everything just by the hightest order. If we want to get rid of some terms we have to improve our estimate somewhere. Actually we do this in our first estimate for the case where all have at least three elements. Above we said that in the reduction step we removed the contribution of at most -many ’s, because we have to make sure that is different from zero. In the first step we have, however, no extra there (as this is only arising in the removals of three or more elements), thus we have to estimate the numer of for which . This was done in [10], giving in this case as an improved (non-trivial) estimate the factor , for some absolute constant . (We expect that the same might be true if we consider instead of , but this is not needed for our arguments.) Thus, if we arrive in our reduction at a situation where we have three or more singletons in an interval, we get an extra factor , which will let this distribution disappear asymptotically. But this means that we can restrict in our summation over the ’s to a situation where we also have pairings in all - hence we have pairings such that for all . If we denote by the union over the blocks of all for all , then we have of course , hence our condition for the summation over is now . This gives for the summation over the order . Note that we have always the inequality , because with its blocks lives on different intervals , and those different intervals have, by the condition , to be connected by . For this we need at least pairs of to make those connections. This shows on one hand that the maximal order in the summation in (25) can not be bigger than , and on the other hand it implies that we need for the additional constraint that to achieve this leading order. Thus, going back to (24), we have seen that asymptotically in the leading order of is given by
[TABLE]
We have now to calculate the asymptotics of (26). One has to note that the restrictions to the intervals are not independent from each other because some of their values are coupled by the condition . Without this condition and without the power at , this sum would just decouple into a product of sums for each of the . Our goal is to see that this decoupling effectively still happens in leading order. For this it is important that, by the condition , we have as few as possible connections, under the connectedness condition, between the different . In order to understand what this implies, let us have a closer look on the appearing in (26) as follows. The restrictions to the consist of pairs and singletons. Let us denote the total number of singletons by and the total number of pairs by ; then we have . We claim now that we must find at least one which has only two singletons. Namely, assume to the contrary that each has at least four singletons, then we have that . But then
[TABLE]
On the other hand, each block of contains at least two elements, and if it contains a singleton then it contains at least four elements; hence there can be at most blocks of . This contradiction shows that we cannot start with all intervals having at least four singletons. Thus there must be at least one which has only two singletons. Similar as above, one also sees that those two singletons of must be connected by a block of and that for the other elements in the blocks of and the blocks of have to agree, in order to achieve the maximal value of . But then in our summation over we are in the situation of the restricted summation, Equation (17), of Lemma 3.4: we have one block of for which is determined by values from other intervals, but otherwise we sum just over . Since this summation is, by Lemma 3.4, independent of the fixed value of , we can decouple this value from the outside intervals and just sum over all possibilities for . This summation will then give an extra factor . We can iterate this now, by finding another of the remaining intervals, for which (after having removed ) has only two singletons and decouple the summation for this as before from the rest. In each of the decoupling steps we get an extra factor and in the end we have removed all the constraints and are left with just doing summations over the ’s separately according to the constraint ; i.e., (26) is the same as
[TABLE]
∎
Remark 4.2*.*
In the proof of Theorem 4.1 we have seen the nature of the pairs of pair-partitions which contribute to the fluctuations. Each block of lives on one of the , whereas has also some blocks which connect different intervals. In order to get the maximal number of blocks of we need that the blocks of which do not connect different intervals are also blocks of , The following picture shows a typical contribution for a order cumulant. It is natural to draw the intervals as circles, since each of them corresponds to a trace. The blocks of are drawn as dashed lines within the circles, the blocks of as solid lines outside of the the circles. One sees that the effect of those blocks of which connect different circles is to collect several blocks of together; thus one can also identify the pair with a partition of the blocks of . In this form our formula for the fluctuations of the sparse SYK random matrix looks quite similar to some of the terms showing up in the description of the fluctuations of a GUE random matrix in terms of partitioned permutations [6]. This suggests that there might be a more general theory of higher order freeness which addresses both the usual GUE as well as sparse random matrices. We will follow up on this connection in future investigations. 2. 2.
One should notice that in the contribution of a configuration to (22) only is involved, via its number of crossings. Those number of crossings is a well-defined quantity since its calculation factorizes into the number of crossings for each of the circles. For we do not have to care about its crossings - which is a good thing as the number of crossings of a multi-annular pairing is not really well defined. On the other hand, governs the constraint .
5 Proof of the lemmas
Proof of Lemma 2.1.
For , a direct computation yields
[TABLE]
where is the identity matrix. In the last equation we used that and have the same parity.
Now let and be in , observe that
[TABLE]
Then by iteration we get
[TABLE]
where stands for the number of common indices in and . ∎
Proof of Lemma 3.3.
For with , it follows from the anti-commutation relation (8) that
[TABLE]
The notation was introduced in (3).
- i)
It follows from (7) and (27) that, if the are all even, then .
- ii)
We now assume and we want to determine the sign in (27). If , then . This comes from the iterative characterization of elements in ; see, for example, [18, Remark: 9.2]. If , then we need to apply the relation (8) to each crossing in , and reduce to the identity. In this processes we obtain for each pair of crossing blocks in .
Note that for the above arguments it is not necessary that is itself a pairing.
∎
Proof of Lemma 3.4.
- i)
This is proved in [7, 9]. Note that the case , proved in [9], is more involved than the other cases, because then the possible intersections between and in are typically much larger than in the other cases, and thus harder to control.
- ii)
It suffices to show that for a block the restricted sum in (17) is independent of the choice of . For two possible choices we take a bijection which maps to for and is arbitrary otherwise. We extend this to a map by declaring for as the tuple in which we get by ordering the numbers . This maps then to and has the property that it preserves the size of intersections, i.e., for all and thus also in particular . If we apply this bijection to our restricted sum, then the restricted sum for is transformed into the restricted sum for :
[TABLE]
∎
6 On the analytic description of the multivariate -Gaussian distribution
We have established in Theorem 3.1 that one can describe the limit of independent SYK models by concrete operators on the -deformed Fock space. This allows to give operator realizations, via (11), for the limits of expectation values in the SYK model. Unfortunately, this does not imply that we have in the case a good analytic description of the limit object. The relevant analytic object in this context is the operator-valued Cauchy transform, which is defined as follows. Consider (), for some orthonormal . In order to deal with the distribution of the tuple we put those operators as diagonal elements into an matrix
[TABLE]
put , and then define the operator-valued Cauchy transform of this as the collection of all functions
[TABLE]
where denote the upper and lower, respectively, halfplane in the considered operator algebras (given by requiring that the imaginary part of the operators are strictly positive and negative, respectively). For more information and precise definitions of such non-commutative functions, we refer to [14, 13]. This Cauchy transform is a well defined analytic function which contains all information about the distribution of the tuple – in particular, the expectation values as in (11) can be recovered as the coefficients in the Taylor expansion of those functions about infinity. The problem is that we do not have any nice concrete analytic description of this function. In the case of just one operator (where we know quite a bit about the limit distribution) one has, for example, a good continued fraction expansion of the Cauchy transform (which in this case is just an ordinary analytic function from to ) in the form
[TABLE]
The naive guess that one might also have a corresponding operator-valued version of such a continued fraction expansion is unfortunately not true. Whereas in the scalar case any distribution has a continued fraction expansion for its Cauchy transform, this does not hold any more in the operator-valued setting (see [1]), and it is easy to check that the matrix in (28) for the -Gaussian distribution is one of the basic examples where this fails,
This absence of a nice analytic description of the multivariate -Gaussian distribution is the main reason that our progress on a deeper understanding of this distribution (e.g., for addressing free entropy or Brown measure questions in this context) is quite slow. Also the calculations of the 2- and 4-point functions of the SYK model in [2, 3] might benefit from such a better analytic understanding. It remains to be seen whether the link between our dynamical version of the SYK model and the -Brownian motion leads to progress on such questions.
Acknowledgements
R.S. thanks Li Han, Renjie Feng, and Micha Berkooz for discussions about the SYK model. We also thank the anonymous reviewers whose comments helped to improve the manuscript substantially.
This work has been supported by the ERC Advanced Grant NCDFP 339760 and by the SFB-TRR 195, Project I.11.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. Anshelevich and J. Williams: Operator-valued Jacobi parameters and examples of operator-valued distributions. Bulletin des Sciences Mathématiques, Vol 145 (2018), 1–37.
- 2[2] M. Berkooz, M. Isachenkov, V. Naravlansky, and T. Torrents: Towards a full solution of the large N double-scaled SYK model. Journal of High Energy Physics (2019) 2019: 79.
- 3[3] M. Berkooz, P. Narayan, and J. Simon: Chord diagrams, exact correlators in spin glasses and black hole bulk reconstruction. Journal of High Energy Physics (2018) 2018: 192.
- 4[4] M. Bozejko, R. Speicher: An example of a generalized brownian motion. Communications in Mathematical Physics, 137, (1991), 519–531.
- 5[5] M. Bozejko, B. Kümmerer, and R. Speicher: q-Gaussian Processes: Non-commutative and Classical Aspects. Communications in Mathematical Physics 185(1), (1997), 129–154.
- 6[6] B. Collins, J. Mingo, P. Sniady, and R. Speicher: Second order freeness and fluctuations of random matrices. III. Higher order freeness and free cumulants. Documenta Mathematica, 12, (2017), 1–70.
- 7[7] L. Erdös and D. Schröder: Phase transition in the density of states of quantum spin glasses. Mathematical Physics, Analysis and Geometry , 17:9164, (2014).
- 8[8] L. Erdös and HT Yau: Dynamical approach to random matrix theory. Vol. 28, Courant Lecture Notes in Mathematics , 2017.
