Related papers: Exchangeable arrays and integrable systems for cha…
Moments of the characteristic polynomial of a random matrix taken from any of the three ensembles, orthogonal, unitary or symplectic, are given either as a determinant or a pfaffian or as a sum of determinants. For gaussian ensembles…
A feature of certain ensembles of random matrices is that the corresponding measure is invariant under conjugation by unitary matrices. Study of such ensembles realised by matrices with Gaussian entries leads to statistical quantities…
We derive a moment formula for generalized fractional polynomial processes, i.e., for polynomial-preserving Markov processes time-changed by an inverse L\'evy-subordinator. If the time change is inverse $\alpha$-stable, the time-derivative…
We give asymptotic formulae for random matrix averages of derivatives of characteristic polynomials over the groups USp(2N), SO(2N) and O^-(2N). These averages are used to predict the asymptotic formulae for moments of derivatives of…
We obtain large n asymptotics for products of powers of the absolute values of the characteristic polynomials in the Gaussian Unitary Ensemble of n\times n matrices. Our results can also be interpreted as asymptotics of the determinant of a…
We study the moments of the absolute characteristic polynomial of the real elliptic ensemble, including the case of the real Ginibre ensemble. We obtain asymptotics for all integral moments inside the real bulk to order 1 + o(1). In…
We compute the leading order asymptotic of the maximum of the characteristic polynomial for i.i.d. matrices with real or complex entries. In particular, this result is new even for real Ginibre matrices, which was left as an open problem in…
Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be expressed as high-dimensional complex integrals. Motivated by the need for a systematic study of the asymptotic…
The paper addresses the calculation of correlation functions of permanental polynomials of matrices with random entries. By exploiting a convenient contour integral representation of the matrix permanent some explicit results are provided…
Representation theory and the theory of symmetric functions have played a central role in Random Matrix Theory in the computation of quantities such as joint moments of traces and joint moments of characteristic polynomials of matrices…
We give an asymptotic formula for the $2k$th moment of a sum of multiplicative Steinhaus variables. This was recently computed independently by Harper, Nikeghbali and Radziwi\l\l. We also compute the $2k$th moment of a truncated…
A new family of polynomials, called cumulant polynomial sequence, and its extensions to the multivariate case is introduced relied on a purely symbolic combinatorial method. The coefficients of these polynomials are cumulants, but depending…
We provide two applications of an elementary (yet seemingly unknown) probabilistic representation of matrix ordered exponentials, which generalizes the Feynman-Kac formula in finite dimensions and the change of measure formula between two…
Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$-matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main…
Duality identities in random matrix theory for products and powers of characteristic polynomials, and for moments, are reviewed. The structure of a typical duality identity for the average of a positive integer power $k$ of the…
Despite the relevance of the binomial distribution for probability theory and applied statistical inference, its higher-order moments are poorly understood. The existing formulas are either not general enough, or not structured and…
We study three instances of log-correlated processes on the interval: the logarithm of the Gaussian unitary ensemble (GUE) characteristic polynomial, the Gaussian log-correlated potential in presence of edge charges, and the Fractional…
We exhibit explicit expressions, in terms of components, of discriminants, determinants, characteristic polynomials and polynomial identities for matrices of higher rank. We define permutation tensors and in term of them we construct…
We show in this paper that after proper scalings, the characteristic polynomial of a random unitary matrix converges almost surely to a random analytic function whose zeros, which are on the real line, form a determinantal point process…
We develop a method to approximate the moments of a discrete-time stochastic polynomial system. Our method is built upon Carleman linearization with truncation. Specifically, we take a stochastic polynomial system with finitely many states…