English
Related papers

Related papers: Revisiting Horn's Problem

200 papers

We calculate the probability to find exactly $n$ eigenvalues in a spectral interval of a large random $N \times N$ matrix when this interval contains $s \ll N$ eigenvalues on average. The calculations exploit an analogy to the problem of…

Condensed Matter · Physics 2009-10-22 M. M. Fogler , B. I. Shklovskii

A. Horn's problem concerns find two self adjoint matrices A, B, so that A, B, and A+B have prescribed spectrum. In this paper, we show how it connects to an interpolation problem for two variable real zero polynomials and a tracial moment…

Spectral Theory · Mathematics 2017-12-11 Lei Cao , Hugo J. Woerdeman

We study the hermitian one matrix model with semi-classical potential. This is a general unitary invariant random matrix ensemble in which the potential has a derivative that is a rational function and the measure is supported on some…

Mathematical Physics · Physics 2015-04-20 Max R. Atkin

We review the state of the art of the theory of Euclidean random matrices, focusing on the density of their eigenvalues. Both Hermitian and non-Hermitian matrices are considered and links with simpler, standard random matrix ensembles are…

Mathematical Physics · Physics 2013-03-13 A. Goetschy , S. E. Skipetrov

The Schur-Horn theorem is a classical result in matrix analysis which characterizes the existence of positive semidefinite matrices with a given diagonal and spectrum. In recent years, this theorem has been used to characterize the…

Functional Analysis · Mathematics 2015-04-03 Matthew Fickus , Justin Marks , Miriam J. Poteet

Our goal is to show that the one-interval gap probability for the q-Hahn orthogonal polynomial ensemble can be expressed through a solution of the asymmetric q-Painleve V equation. The case of the q-Hahn ensemble we consider is the most…

Mathematical Physics · Physics 2015-07-21 Alisa Knizel

This is a survey of recent progress in several areas of combinatorial algebra. We consider combinatorial problems about free groups, polynomial algebras, free associative and Lie algebras. Our main idea is to study automorphisms and, more…

Group Theory · Mathematics 2016-09-07 Alexander A. Mikhalev , Vladimir Shpilrain , Jie-Tai Yu

We study random graphs with arbitrary distributions of expected degree and derive expressions for the spectra of their adjacency and modularity matrices. We give a complete prescription for calculating the spectra that is exact in the limit…

Social and Information Networks · Computer Science 2013-02-04 Raj Rao Nadakuditi , M. E. J. Newman

The unitary group U(N) acts by conjugations on the space H(N) of NxN Hermitian matrices, and every orbit of this action carries a unique invariant probability measure called an orbital measure. Consider the projection of the space H(N) onto…

Representation Theory · Mathematics 2013-03-04 Grigori Olshanski

Kernel methods are successful approaches for different machine learning problems. This success is mainly rooted in using feature maps and kernel matrices. Some methods rely on the eigenvalues/eigenvectors of the kernel matrix, while for…

Machine Learning · Computer Science 2012-02-20 Nima Reyhani , Hideitsu Hino , Ricardo Vigario

We study the probability measure on the space of density matrices induced by the metric defined by using superfidelity. We give the formula for the probability density of eigenvalues. We also study some statistical properties of the set of…

Mathematical Physics · Physics 2011-09-14 Zbigniew Puchała , Jarosław Adam Miszczak

The Macdonald symmetric functions are used to define measures on the set of all partitions of all integers. Probabilistic algorithms are given for growing partitions according to these measures. The case of Hall-Littlewood polynomials is…

Combinatorics · Mathematics 2007-05-23 Jason Fulman

We consider the problem of finding the global optimum of a real-valued complex polynomial on a compact set defined by real-valued complex polynomial inequalities. It reduces to solving a sequence of complex semidefinite programming…

Optimization and Control · Mathematics 2016-10-03 Cédric Josz , Daniel K. Molzahn

We consider $n\times n$ real symmetric and hermitian random matrices $H_{n,m}$ equals the sum of a non-random matrix $H_{n}^{(0)}$ matrix and the sum of $m$ rank-one matrices determined by $m$ i.i.d. isotropic random vectors with…

Probability · Mathematics 2007-10-09 Alain Pajor , Leonid Pastur

In this paper, we study a matricial version of the Byrnes-Georgiou-Lindquist generalized moment problem with complexity constraint. We introduce a new metric on multivariable spectral densities induced by the family of their spectral…

Optimization and Control · Mathematics 2007-05-23 A. Ferrante , M. Pavon , F. Ramponi

We consider real symmetric or complex hermitian random matrices with correlated entries. We prove local laws for the resolvent and universality of the local eigenvalue statistics in the bulk of the spectrum. The correlations have fast decay…

Probability · Mathematics 2018-03-01 Oskari Ajanki , Laszlo Erdos , Torben Krüger

In this short note, we collect some results regarding the Remmert reduction of holomorphically convex space and its application to a variation of the usual union problem. Classically, the union problem asks the following question: is a…

Complex Variables · Mathematics 2019-03-20 Samuele Mongodi

In this paper a new approach is derived in the context of shape theory. The implemented methodology is motivated in an open problem proposed in \citet{GM93} about the construction of certain shape density involving Euler hypergeometric…

Statistics Theory · Mathematics 2015-02-04 Francisco J. Caro-Lopera , José A. Díaz-García

Moduli spaces of algebraic curves and closely related to them Hurwitz spaces, that is, spaces of meromorphic functions on the curves, arise naturally in numerous problems of algebraic geometry and mathematical physics, especially in…

Algebraic Geometry · Mathematics 2015-06-26 M. E. Kazaryan , S. K. Lando

In many areas of machine learning, it becomes necessary to find the eigenvector decompositions of large matrices. We discuss two methods for reducing the computational burden of spectral decompositions: the more venerable Nystom extension…

Machine Learning · Statistics 2011-07-22 Darren Homrighausen , Daniel J. McDonald