Sciweavers

207 search results - page 1 / 42
» The Polynomial Method for Random Matrices
Sort
View
FOCM
2008
65views more  FOCM 2008»
13 years 4 months ago
The Polynomial Method for Random Matrices
N. Raj Rao, Alan Edelman
SIAMMAX
2010
111views more  SIAMMAX 2010»
12 years 11 months ago
Stochastic Galerkin Matrices
We investigate the structural, spectral, and sparsity properties of Stochastic Galerkin matrices as they arise in the discretization of linear differential equations with random co...
Oliver G. Ernst, Elisabeth Ullmann
ICASSP
2011
IEEE
12 years 8 months ago
Complex random matrices and multiple-antenna spectrum sensing
In this paper, we study the eigenvalue-based spectrum sensing techniques for multiple-antenna cognitive radio networks. First, we study the extreme eigenvalue distributions of a c...
Tharmalingam Ratnarajah, Caijun Zhong, Ayse Kortun...
SODA
2012
ACM
195views Algorithms» more  SODA 2012»
11 years 7 months ago
Concentration and moment inequalities for polynomials of independent random variables
In this work we design a general method for proving moment inequalities for polynomials of independent random variables. Our method works for a wide range of random variables incl...
Warren Schudy, Maxim Sviridenko
COMBINATORICS
2004
106views more  COMBINATORICS 2004»
13 years 4 months ago
Random Matrices, Magic Squares and Matching Polynomials
Characteristic polynomials of random unitary matrices have been intensively studied in recent years: by number theorists in connection with Riemann zetafunction, and by theoretica...
Persi Diaconis, Alexander Gamburd