Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThe expected characteristic and permanental polynomials of the random Gram matrix
168
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
A t by n random matrix A is formed by sampling n independent random column vectors, each containing t components. The random Gram matrix of size n, G_n, contains the dot products between all pairs of column vectors in the randomly generated matrix A; that is, G_n = transpose(A) A. The matrix G_n has characteristic roots coinciding with the singular values of A. Furthermore, the sequences det(G_i) and per(G_i) (for i = 0, 1, ..., n) are factors that comprise the expected coefficients of the characteristic and permanental polynomials of G_n. We prove theorems that relate the generating functions and recursions for the traces of matrix powers, expected characteristic coefficients, expected determinants E(det(G_n)), and expected permanents E(per(G_n)) in terms of each other. Using the derived recursions, we exhibit the efficient computation of the expected determinant and expected permanent of a random Gram matrix G_n, formed according to any underlying distribution. These theoretical results may be used both to speed up numerical algorithms and to investigate the numerical properties of the expected characteristic and permanental coefficients of any matrix comprised of independently sampled columns.
rate research
Read More
We define a correlated random walk (CRW) induced from the time evolution matrix (the Grover matrix) of the Grover walk on a graph $G$, and present a formula for the characteristic polynomial of the transition probability matrix of this CRW by using a determinant expression for the generalized weighted zeta function of $G$. As applications, we give the spectrum of the transition probability matrices for the CRWs induced from the Grover matrices of regular graphs and semiregular bipartite graphs. Furthermore, we consider another type of the CRW on a graph.
We calculate the expectation value of an arbitrary product of characteristic polynomials of complex random matrices and their hermitian conjugates. Using the technique of orthogonal polynomials in the complex plane our result can be written in terms of a determinant containing these polynomials and their kernel. It generalizes the known expression for hermitian matrices and it also provides a generalization of the Christoffel formula to the complex plane. The derivation we present holds for complex matrix models with a general weight function at finite-N, where N is the size of the matrix. We give some explicit examples at finite-N for specific weight functions. The characteristic polynomials in the large-N limit at weak and strong non-hermiticity follow easily and they are universal in the weak limit. We also comment on the issue of the BMN large-N limit.
We consider random polynomials whose coefficients are independent and uniform on {-1,1}. We prove that the probability that such a polynomial of degree n has a double root is o(n^{-2}) when n+1 is not divisible by 4 and asymptotic to $frac{8sqrt{3}}{pi n^2}$ otherwise. This result is a corollary of a more general theorem that we prove concerning random polynomials with independent, identically distributed coefficients having a distribution which is supported on { -1, 0, 1} and whose largest atom is strictly less than 1/sqrt{3}. In this general case, we prove that the probability of having a double root equals the probability that either -1, 0 or 1 are double roots up to an o(n^{-2}) factor and we find the asymptotics of the latter probability.
There is a digraph corresponding to every square matrix over $mathbb{C}$. We generate a recurrence relation using the Laplace expansion to calculate the characteristic, and permanent polynomials of a square matrix. Solving this recurrence relation, we found that the characteristic, and permanent polynomials can be calculated in terms of characteristic, and permanent polynomials of some specific induced subdigraphs of blocks in the digraph, respectively. Interestingly, these induced subdigraphs are vertex-disjoint and they partition the digraph. Similar to the characteristic, and permanent polynomials; the determinant, and permanent can also be calculated. Therefore, this article provides a combinatorial meaning of these useful quantities of the matrix theory. We conclude this article with a number of open problems which may be attempted for further research in this direction.
We calculate joint moments of the characteristic polynomial of a random unitary matrix from the circular unitary ensemble and its derivative in the case that the power in the moments is an odd positive integer. The calculations are carried out for finite matrix size and in the limit as the size of the matrices goes to infinity. The latter asymptotic calculation allows us to prove a long-standing conjecture from random matrix theory.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
