An explicit example for the high temperature convolution: crossover between the binomial law and the arcsine law
Abstract
In this note, we study the high-temperature convolution introduced in Ref. [1], between two symmetric Bernoulli distributions. We give an analytical expression for both the Stieltjes transform and the density. This result provides the first non-trivial expression for the high-temperature convolution of two distributions and gives a new family of densities, interpolating between the centered binomial distribution with number of trials and probability of success , and the centered and re-scaled arcsine law.
I Introduction
Understanding the spectrum of a large random matrix is of special interest in fields as diverse as high energy physics [2, 3], statistics [4], disordered systems [5, 6], finance [7], economy [8], ecology [9] and genetics [10, 11] to cite a few. A particular - yet fundamental - case of interest concerns the situation where one is dealing with the sum of random matrices.
Classical and free convolution - Important progress under this setting has been made in the 90s with the introduction of free probability [12, 13, 14]. To fix things, we consider such that as goes to infinity, and similarly , and a random rotation matrix , where is the group of orthogonal matrices. As goes to infinity, the spectrum of only depends on the limiting distributions and , and is known as the free convolution of the former distributions, denoted by . In practice, one can compute the distribution thanks to the so-called R-transform, and we refer to the textbook [15] for further details. The two symmetric matrices and are said to be (asymptotically) free or equivalently their eigenbasis are in “generic positions”. Another way to view free probability is to notice that and are “maximally non-commutative” self-adjoint objects, in the sense that if both and have zero mean and if we denote by , we have at large , with but . From a purely combinatorial point of view [16], this has a simple interpretation: the former corresponds to a non-crossing partition, while the latter corresponds to a crossing one. As , only non-crossing terms contribute to the computation of the moments of , in the free probability setting.
On the contrary, if now one is looking at the spectrum of where is a (uniform) random permutation matrix, one is summing diagonal matrices and the limiting spectral distribution for the sum is now simply given by the classical convolution . Thus, classical convolution naturally appears in Random Matrix Theory (RMT) when the eigenbasis of both symmetric matrices are perfectly aligned, or said differently when one is looking at the spectrum of large commutative self-adjoint objects. In particular, if now and and have zero mean, we have and more generally crossing and non-crossing partitions contribute equally in this setting.
The high-temperature convolution - A natural problem is to give a meaning for “intermediate cases”, that is to describe the spectrum of the sum of two large self-adjoint objects for cases where those objects are not commutative nor maximally non-commutative. Recently [1], promising progress has been made in this direction with the introduction of the so-called high-temperature convolution (or “-convolution”), which we briefly describe in this paragraph, see also [17]. The high-temperature convolution has been constructed by looking at spherical integrals [18, 19, 20, 21, 22, 23] in a double scaling regime where but now the usual inverse temperature parameter of RMT scales as , hence the name for the convolution.
The precise description of this convolution will be given later on, but for now one can think of it as an operation taking a parameter and two distributions and as inputs and giving a distribution denoted by as output. This high temperature convolution admits the usual and free convolution as limiting cases, since and . As a consequence, it forms a continuous family of convolutions interpolating between the two aforementioned ones as one varies the parameter .
Let us mention that this convolution is done directly at the level of the limiting distributions and finding the corresponding ’linear algebra operation’ - such that the eigenvalues of the sum of two symmetric matrices and with proper conditions between the two - is an open problem. Nevertheless, one can still develop a combinatorial formula where now the weight of a crossing partition depend on the parameter , see [17]. If one thinks of two abstract self-adjoint objects which are ’-free’, by which we mean that we think of as the limiting spectral distribution of their sum, we have in particular (again for and with zero mean):
(1) |
Thus, the high-temperature convolution corresponds in spirit to the spectrum of the sum of two large self-adjoint objects with degree of non-commutativity indexed by the parameter .
This high-temperature convolution admits an intriguing duality with the so-called finite free convolution [24, 25]. The latter can be understood [26] as the spectrum of the sum of two -ensembles in the low-temperature limit , where the number of particles is fixed. This duality translates into a correspondence between the respective parameter of the two convolutions and can be seen as an extension for the sum of the high-low temperature duality developed in Refs. [27, 28, 29, 30].
In practice, the combinatorial formula developed in Ref. [17] is too cumbersome to compute the distribution , and a simpler way is to follow the road developed in Ref. [1] which rely on the Markov-Krein relation [31, 32]:
(2) |
valid for any in the complex plane outside the supports of the two distributions. The distribution is known as the Markov-Krein transform with index (MKTc) of the distribution and conversely is the inverse Markov-Krein transform (IMKT) of . The main reason to introduce the Markov-Krein relation is that the high-temperature convolution corresponds to the classical convolution of the MKTc of and . After a few simplifications developed in Ref. [1], this means that one can decompose the computation of the high-temperature convolutions into the following steps:
-
1.
Compute the moment generating functions (MGF) of the MKTc the two distributions and . The MKTc and can be computed thanks to sophisticated integral representation developed in Ref. [1].
-
2.
Compute the function
(3) for high enough, that is higher than the and then extend analytically this function to all .
-
3.
Compute the Stieltjes transform , thanks to the formula:
(4) -
4.
Compute the distribution thanks to the Sokochi-Plemelj formula:
(5)
Each step can be easily approximated numerically such that one can really think of the entire process as an algorithm for computing the high temperature convolution of two distributions.
However, for a given choice of and and the parameter , finding an explicit expression for the density of their high-temperature convolution is a daunting task. In fact, the only known cases where one has an explicit expression for the high temperature convolution correspond to trivial fixed points (or infinitely divisible distributions) which, up to rescaling, are left unchanged by the high-temperature convolution. Note that even for the free convolution, one has an analytical expression for the density only for specific choices of the distribution and such that one should not expect to have a simple expression for the high-temperature convolution.
II Main result
The present note aims to answer this issue by providing a complete description of for a specific choice of and and any value of the parameter . We consider the case where , with,
(6) |
since this is a famous case where the density of its free convolution with itself is known analytically and given by the (shifted and re-scaled) arscine law: for , . For the classical convolution, we have , which is the re-centered binomial distribution with number of trials and probability of success .
Expression for the Stieltjes transform - Our first result writes as follows: for any , the Stieltjes transform of is given by:
(7) |
where is the Gauss hypergeometric function and . The derivation of Eq. (7) is postponed to the next section, where we also discuss how one can recover the Stietljes transform of the classical convolution and the free convolution, corresponding respectively to and . Using the power series of the hypergeometric functions, one gets the large behavior of the Stieltjes transform:
(8) |
from which we deduce that the first even moments of the symmetric distribution are given by , and , in accordance with the first moments one can obtain with the combinatorial formula developed in Ref. [17].
If one introduces a new distribution defined for any , then its Stieltjes transform is related to the one of by , that is:
(9) |
Note that the change of variable going from to admits a natural interpretation in RMT: if one think of as the limiting spectrum of some matrix then is the symmetrized singular value distribution of the square matrix , see Ref. [33]. Eq. (9) expressed as a product of the inverse function by the ratio of two different hypergeometric functions, both evaluated at . Such general form has already appeared before in RMT in the study of the high-temperature Jacobi ensemble, see Ref. [29]. Yet, the parameters of the hypergeometric functions here are different such that - to the best knowledge of the author - the family of distributions (and ) is a new one in RMT.
Expression for the density - Our second result is written as follows: if we define and , then for any such that , the density is given for any by:
(10) | |||
Furthermore, one can obtain the cases where is a positive even integer by carefully taking the limit, such that one can understand Eq. (10) as being valid for any , after proper regularization. The distribution diverges at the points and is otherwise absolutely continuous with no singular parts in . The derivation of Eq. (10) is given in the next section. A plot of the density of is given in FIG. 1.

Now, for special values of the parameter , this expression greatly simplifies. For example for , corresponding in a sense to the mid-point between the classical and the free convolution (see Eq. (1)), we have:
(11) |
where is the complete elliptic integral of the first kind, . The expression for is even simpler since we have:
(12) |
In practice when is an even positive integer it is easier to evaluate the Stieltjes transform thanks to Eq. (7) and then use the Sokochi-Plemelj formula of Eq. (5) rather than taking the limit in the generic expression of Eq. (10).
III Derivation of the result
In this section we follow the steps enumerated in the previous section in order to prove Eq. (7) and Eq. (10) giving the expression for the Stieltjes transform and the density, respectively.
Computing the MGF of the MKTc - For the symmetric Bernoulli distribution, it has been previously shown, see Refs. [1, 34, 35], that the corresponding MKTc is the density of the random variable . The distribution is the symmetric Bernoulli distribution, shifted by . From the Markov-Krein relation of Eq. (2), one sees immediately that a shift in the distribution introduces the same shift in the MKTc. Thus, the MKTc of is simply the law of . From well-known properties of the Beta distribution, this means that the MGF of the MKTc of , , is given by:
(13) |
where is the confluent hypergeometric function. Using identities [36] for the confluent hypergeometric, this can also be expressed in terms of the modified Bessel function of the kind :
(14) |
where .
Computing the function - Injecting Eq. (14) into the definition of given by Eq. (3), one obtains the integral representation:
(15) |
where is a constant that will not contribute to the expression of the Stietljes transform (and hence the density). The square of the Bessel function can be expressed as an integrated Bessel function thanks to the formula [36]:
(16) |
If we do the change of variable in Eq. (15) and then we have:
(17) |
with . The integral with respect to the variable is the integral representation [36] of the Bessel function of the second kind , such that we have:
(18) |
By identities for the integral of the product of two Bessel functions of different kinds, see [36], one can finally express in terms of a hypergeometric function:
(19) |
Computing the Stieltjes transform - In order to compute given by Eq. (4), we first need to compute the derivative of . Using the differentiation formula [36] for the hypergeometric function, , we get:
(20) | ||||
Next, using identities [36] between contiguous hypergeometric functions, the sum inside the brackets simplifies such that the derivative of writes:
(21) |
Injecting the expression of and its derivative, given respectively by Eq. (19) and Eq. (21), in Eq. (4) gives the desired expression for the Stieltjes transform, see Eq. (7).
The limiting case given by the classical convolution can be recovered by using an expansion for small in the hypergeometric functions entering the expression of . For the numerator, we get:
(22) |
that is:
(23) |
Similarly, the hypergeometric function in the denominator is equal to . Combining these two asymptotic behaviors, we get for the Stietljes:
(24) |
which decomposes into simple elements as:
(25) |
as expected for the Stieltjes transform of the centered binomial distribution, .
The limiting case corresponding to the free convolution requires more work, and we only sketch the main ingredients to recover the Stieltjes transform of the arcsine law. The idea is to use the integral representation [36] of the hypergeometric function:
(26) | ||||
with and . If we denote by with for the hypergeometric function in the numerator of Eq. (7) and for the denominator, this means that we can write as:
(27) |
with and . As , Eq. (27) can be approximated by Laplace method and the results writes:
(28) |
where is a function independent of the parameter . Thus, if we inject this asymptotic behavior in Eq. (7) we get:
(29) |
which is indeed the Stietljes transform of , see [15].
Computing the density - The explicit expression for the density is obtained thanks to the Sokochi-Plemelj formula of Eq. (5) and the expression of Eq. (7) for the Stietljes transform, by looking carefully at the behavior of the hypergeometric functions near their branch cuts. As the situation is very similar for both the numerator and denominator, we only detail the complete computation for the latter case. The idea is to use both the integral representation of Eq. (26) for and and the behavior of the power function near its branch cut. For , we have but otherwise:
(30) |
As with , we have
(31) |
such that we need to differentiate the cases and in Eq. (26). Since the distribution is symmetric, we also fix . Thus, if we introduce the two functions corresponding respectively to the split of the integral of Eq. (26) for and , into the segment and :
(32) |
and
(33) |
then the real and imaginary parts of the hypergeometric function in the denominator of Eq. (7) are given by:
(34) |
and
(35) |
If we now perform the change of variable in Eq. (32), we can rewrite as:
(36) |
By Eq. (26) and up to a multiplicative constant we recognize the integral in Eq. (36) as the hypergeometric function . The multiplicative constant can be simplified thanks to the complement formula of the Gamma function for , and we finally obtain:
(37) |
Note that the integral representation of Eq. (36) is actually only valid for but by analytic continuation of the hypergeometric function, the result holds for any such that , due to the presence of the inverse of the sinus function in Eq. (37).
Similarly, by the change of variable in Eq. (33), can be expressed as:
(38) |
Thanks to Eq. (34) and Eq. (35), one has the complete behavior near the branch cut for the denominator of Eq. (7).
We then sketch the remaining steps to get the analytical expression for density: one can then repeat the exact same previous computation for the numerator of Eq. (7), where instead of the function , the function will appear (with a different multiplicative constant) when splitting the integral into the segments and . All in all, one gets the density by taking the imaginary part of the entire expression, divided by . After simplification with the trigonometric identity , appearing when one multiplies the denominator of Eq. (7) by its conjugate, one gets the desired expression of Eq. (10) for the density.
IV Conclusion
In this note, we studied the high-temperature convolution introduced in Ref [1], between two symmetric Bernoulli distributions. Our result provides a new family of distribution, indexed by the parameter of the high-temperature convolution, interpolating between the (shifted) binomial distribution with parameter and the (shifted and re-scaled) arcsine law. This family of distribution constitutes the first non-trivial case for the analytical expression of the high-temperature, and we believe that the ideas developed in this note can be used to obtain the density of the high-temperature convolution in other cases. The obtained distribution is absolutely continuous between each singular points (here being given by ) of the classical convolution , and we conjectured this phenomenon to be a specific feature of the high-temperature convolution. Our result paves the way for a better understanding of this new convolution and can serve as a benchmark for future construction of the underlying linear algebra operation.
V Acknowledgments
The author would like to warmly thank M. Potters and J-P. Bouchaud for fruitful discussions concerning the high-temperature convolution and precious comments regarding this note.
References
- Mergny and Potters [2022] P. Mergny and M. Potters, SciPost Phys. 12, 22 (2022).
- Wigner [1951] E. P. Wigner, Mathematical Proceedings of the Cambridge Philosophical Society 47, 790–798 (1951).
- Szabo and Tierz [2010] R. J. Szabo and M. Tierz, Journal of Physics A: Mathematical and Theoretical 43, 265401 (2010).
- Wishart [1928] J. Wishart, Biometrika 20A, 32 (1928).
- Edwards and Anderson [1975] S. F. Edwards and P. W. Anderson, Journal of Physics F: Metal Physics 5, 965 (1975).
- Sherrington and Kirkpatrick [1975] D. Sherrington and S. Kirkpatrick, Physical review letters 35, 1792 (1975).
- Bouchaud and Potters [2000] J.-P. Bouchaud and M. Potters, Theory of financial risks, Vol. 4 (Cambridge University Press, Cambridge From Statistical Physics to Risk …, 2000).
- Moran and Bouchaud [2019] J. Moran and J.-P. Bouchaud, Physical Review E 100, 032307 (2019).
- May [1972] R. M. May, Nature 238, 413 (1972).
- Amir et al. [2016] A. Amir, N. Hatano, and D. R. Nelson, Physical review. E 93, 042310 (2016).
- Guo and Amir [2020] Y. Guo and A. Amir, “Stability of gene regulatory networks,” (2020), arXiv preprint arXiv:2006.00018, arXiv:2006.00018 [physics.bio-ph] .
- Voiculescu [1991] D. Voiculescu, Inventiones mathematicae 104, 201 (1991).
- Voiculescu [1997] D. V. Voiculescu, Free probability theory, Vol. 12 (American Mathematical Soc., 1997).
- Mingo and Speicher [2017] J. A. Mingo and R. Speicher, Free probability and random matrices, Vol. 35 (Springer, 2017).
- Potters and Bouchaud [2020] M. Potters and J.-P. Bouchaud, A first course in random matrix theory (Cambridge University Press, 2020).
- Nica and Speicher [2006] A. Nica and R. Speicher, Lectures on the Combinatorics of Free Probability (Cambridge University Press, 2006).
- Benaych-Georges et al. [2021] F. Benaych-Georges, C. Cuenca, and V. Gorin, arXiv preprint arXiv:2105.03795 (2021).
- Harish-Chandra [1956] Harish-Chandra, Proc. Natl. Acad. Sci. USA 42, 252 (1956).
- Itzykson and Zuber [1980] C. Itzykson and J.-B. Zuber, Journal of Mathematical Physics 21, 411 (1980).
- Marinari et al. [1994] E. Marinari, G. Parisi, and F. Ritort, Journal of Physics A: Mathematical and General 27, 7647 (1994).
- Guionnet [2005] A. Guionnet, Journal of Functional Analysis - J FUNCT ANAL 222, 435 (2005).
- Mergny and Potters [2020] P. Mergny and M. Potters, preprint arXiv:2007.09421 (2020).
- Benaych-Georges [2011] F. Benaych-Georges, Journal of Theoretical Probability 24, 969 (2011).
- Marcus [2021] A. W. Marcus, arXiv preprint arXiv:2108.07054 (2021).
- Marcus et al. [2022] A. W. Marcus, D. A. Spielman, and N. Srivastava, Probability Theory and Related Fields , 1 (2022).
- Gorin and Marcus [2020] V. Gorin and A. W. Marcus, International Mathematics Research Notices 2020, 883 (2020).
- Trinh and Shirai [2015] K. D. Trinh and T. Shirai, Electronic Communications in Probability 20 (2015), 10.1214/ECP.v20-4252.
- Trinh and Trinh [2021a] H. D. Trinh and K. D. Trinh, Osaka J. Math. 58, 435 (2021a).
- Trinh and Trinh [2021b] H. D. Trinh and K. D. Trinh, Journal of Statistical Physics 185, 1 (2021b).
- Forrester [2022] P. J. Forrester, Random Matrices: Theory and Applications , 2250035 (2022).
- Kerov [1998] S. Kerov, Amer. Math. Soc. Transl. 181, 35 (1998).
- Faraut and Fourati [2016] J. Faraut and F. Fourati, Colloquium Mathematicum 144, 137 (2016).
- Benaych-Georges [2008] F. Benaych-Georges, Probability Theory and Related Fields 144, 471 (2008).
- Hjort and Ongaro [2005] N. L. Hjort and A. Ongaro, Statistical Inference for Stochastic Processes 8, 227 (2005).
- Cifarelli and Regazzini [1990] D. M. Cifarelli and E. Regazzini, The Annals of Statistics , 429 (1990).
- [36] DLMF, “NIST Digital Library of Mathematical Functions,” http://dlmf.nist.gov/, Release 1.1.5 of 2022-03-15, f. W. J. Olver, A. B. Olde Daalhuis, D. W. Lozier, B. I. Schneider, R. F. Boisvert, C. W. Clark, B. R. Miller, B. V. Saunders, H. S. Cohl, and M. A. McClain, eds.