Row products of random matrices (Q1759375): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1102.1947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative estimates of the convergence of the empirical covariance matrix in log-concave ensembles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted isometry property of matrices with independent columns and neighborly polytopes by random sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Algorithms for Compressed Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A limit theorem for the norm of random matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3715582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4125357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of privately releasing contingency tables and the spectra of random matrices with correlated rows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2756809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest singular value of random matrices and geometry of random polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean embeddings in spaces of finite volume ratio via random matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower estimates for the singular values of random matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Littlewood-Offord problem and invertibility of random matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparse reconstruction from Fourier and Gaussian measurements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest singular value of a random rectangular matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3869815 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new look at independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Generic Chaining / rank
 
Normal rank
Property / cites work
 
Property / cites work: How close is the sample covariance matrix to the actual covariance matrix? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak convergence and empirical processes. With applications to statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic combinational networks / rank
 
Normal rank

Latest revision as of 22:25, 5 July 2024

scientific article
Language Label Description Also known as
English
Row products of random matrices
scientific article

    Statements

    Row products of random matrices (English)
    0 references
    20 November 2012
    0 references
    The spectral and geometric properties of a certain class of random matrices with dependent rows created from random matrices with independent entries are studied. For two matrices with the same number of rows the so-called row product is defined as a matrix whose rows consist of the entry-wise product of the rows of original matrices. Generally, the row product of several matrices \(\Delta_1, \dots, \Delta_K\) with dimensions \(d \times n\) is defined as a \(d^K \times n\) matrix with rows which are entry-wise products of rows of \(\Delta_1, \dots, \Delta_K\) matrices. Such constructions first appeared in computer science in the study of privacy protection. In the paper, it is proved that the extreme singular values of the row product of several random matrices behave like the singular values of the matrices \(d^K \times n\) with independent entries. Especially, it is shown that as \(n << d^K\) the largest and the smallest singular values are of the same order for these matrices. An estimation on the minimal amount of noise needed to avoid a privacy breach in privacy protection problem [\textit{S.~P. Kasiviswanathan, M. Rudelson, A. Smith} and \textit{J. Ullman}, STOC, 775--784 (2010)] is derived.
    0 references
    0 references
    0 references
    0 references
    0 references
    random matrices
    0 references
    extreme singular values
    0 references
    privacy protection
    0 references
    0 references
    0 references
    0 references