相关论文: Autocorrelation of Random Matrix Polynomials

We give a self-contained randomized algorithm based on shifted inverse iteration which provably computes the eigenvalues of an arbitrary matrix $M\in\mathbb{C}^{n\times n}$ up to backward error $\delta\|M\|$ in…

This is an attempt at a practical and essentially self-contained theory of automorphic representations in the framework $$\hbox{$L^2(\varGamma\backslash\r{G})$ with $\r{G}=\r{PSL}(2,\B{R})$ and $\varGamma=\r{PSL}(2,\B{Z})$.}$$

Gaussian graphical models have become a well-recognized tool for the analysis of conditional independencies within a set of continuous random variables. From an inferential point of view, it is important to realize that they are composite…

Given a symmetrizable generalized Cartan matrix $A$, for any index $k$, one can define an automorphism associated with $A,$ of the field $\mathbf{Q}(u_1, >..., u_n)$ of rational functions of $n$ independent indeterminates $u_1,..., u_n.$ It…

We distinguish a class of random point processes which we call Giambelli compatible point processes. Our definition was partly inspired by determinantal identities for averages of products and ratios of characteristic polynomials for random…

We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.

Exact evaluation of $<{\rm Tr} S^p>$ is here performed for real symmetric matrices $S$ of arbitrary order $n$, up to some integer $p$, where the matrix entries are independent identically distributed random variables, with an arbitrary…

It is well known that the graph isomorphism problem is polynomial-time reducible to the graph automorphism problem (in fact these two problems are polynomial-time equivalent). We show that, analogously, the group isomorphism problem is…

We study skew-orthogonal polynomials with respect to the weight function $\exp[-2V(x)]$, with $V(x)=\sum_{K=1}^{2d}(u_{K}/{K})x^{K}$, $u_{2d} > 0$, $d > 0$. A finite subsequence of such skew-orthogonal polynomials arising in the study of…

We show the convergence of the characteristic polynomial for random permutation matrices sampled from the generalized Ewens distribution. Under this distribution, the measure of a given permutation depends only on its cycle structure,…

We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…

We study uniform and non-uniform model sets in arbitrary locally compact second countable (lcsc) groups, which provide a natural generalization of uniform model sets in locally compact abelian groups as defined by Meyer and used as…

In Part 1 we study the spherical functions on compact symmetric pairs of arbitrary rank under a suitable multiplicity freeness assumption and additional conditions on the branching rules. The spherical functions are taking values in the…

We study the plane automorphisms given by polynomials with certain degree decompositions.

A new method to represent and approximate rotation matrices is introduced. The method represents approximations of a rotation matrix $Q$ with linearithmic complexity, i.e. with $\frac{1}{2}n\lg(n)$ rotations over pairs of coordinates,…

In this paper, we show that the largest and smallest eigenvalues of a sample correlation matrix stemming from $n$ independent observations of a $p$-dimensional time series with iid components converge almost surely to $(1+\sqrt{\gamma})^2$…

Spatial autocorrelation coefficients such as Moran's index proved to be an eigenvalue of the spatial correlation matrixes. An eigenvalue represents a kind of characteristic length for quantitative analysis. However, if a spatial correlation…

We obtain general, exact formulas for the overlaps between the eigenvectors of large correlated random matrices, with additive or multiplicative noise. These results have potential applications in many different contexts, from quantum…

In this article we continue the study of automorphism groups of constant length substitution shifts and also their topological factors. We show that up to conjugacy, all roots of the identity map are letter exchanging maps, and all other…

Polynomial ensembles are a sub-class of probability measures within determinantal point processes. Examples include products of independent random matrices, with applications to Lyapunov exponents, and random matrices with an external…