English
Related papers

Related papers: Testing of random matrices

200 papers

Given $n$ real numbers $0\leq x_1,...,x_n<1$ and a permutation~$\sigma$ of $\{1,...,n\}$, we can always find $\xbar_1,...,\xbar_n\in\{0,1\}$ so that the partial sums $\xbar_1+... +\xbar_k$ and $\xbar_{\sigma 1}+... +\xbar_{\sigma k}$ differ…

Optimization and Control · Mathematics 2008-02-03 Donald E. Knuth

Many applications, including rank aggregation, crowd-labeling, and graphon estimation, can be modeled in terms of a bivariate isotonic matrix with unknown permutations acting on its rows and/or columns. We consider the problem of estimating…

Machine Learning · Statistics 2019-10-29 Cheng Mao , Ashwin Pananjady , Martin J. Wainwright

Let $M$ be a matroid on a finite ground set $E$, and suppose that the automorphism group of $M$ acts transitively on $E$. We show the following: if $X_1,\ldots,X_K$ are sampled independently from a distribution $p$ on $E$, then the…

Combinatorics · Mathematics 2026-05-25 Mladen Kovačević

Matrix completion aims to reconstruct a data matrix based on observations of a small number of its entries. Usually in matrix completion a single matrix is considered, which can be, for example, a rating matrix in recommendation system.…

Machine Learning · Statistics 2019-10-22 Mokhtar Z. Alaya , Olga Klopp

A real symmetric n times n matrix is called copositive if the corresponding quadratic form is non-negative on the closed first orthant. If the matrix fails to be copositive there exists some non-negative certificate for which the quadratic…

Optimization and Control · Mathematics 2013-06-18 Timo Hirscher

Large H-selfadjoint random matrices are considered. The matrix $H$ is assumed to have one negative eigenvalue, hence the matrix in question has precisely one eigenvalue of nonpositive type. It is showed that this eigenvalue converges in…

Functional Analysis · Mathematics 2012-06-29 Michal Wojtylak

A $2n\times 2n$ real matrix $A$ is said to be a Hamiltonian matrix if $A^{T}J+JA=0$, where $J=\left( \begin{array}{cc} 0 & I_{n} \\ -I_{n} & 0\\ \end{array} \right)$. Hamiltonian matrices appear in many areas of applications, such as linear…

Spectral Theory · Mathematics 2019-03-26 C. B. Manzaneda , R. L. Soto

This paper is about the rate of convergence of the Markov chain $X_{n+1}=AX_{n}+B_{n}$ (mod $p$), where $A$ is an integer matrix with nonzero eigenvalues and ${B_{n}}_{n}$ is a sequence of independent and identically distributed integer…

Probability · Mathematics 2008-05-20 Claudio Asci

In this paper we consider the decomposition of positive semidefinite matrices as a sum of rank one matrices. We introduce and investigate the properties of various measures of optimality of such decompositions. For some classes of positive…

Functional Analysis · Mathematics 2022-02-03 Radu Balan , Kasso A. Okoudjou , Michael Rawson , Yang Wang , Rui Zhang

Let $X_1,..., X_N\in\R^n$ be independent centered random vectors with log-concave distribution and with the identity as covariance matrix. We show that with overwhelming probability at least $1 - 3 \exp(-c\sqrt{n}\r)$ one has $ \sup_{x\in…

Probability · Mathematics 2012-11-01 Radosław Adamczak , Alexander E. Litvak , Alain Pajor , Nicole Tomczak-Jaegermann

Motivated by complexity questions in integer programming, this paper aims to contribute to the understanding of combinatorial properties of integer matrices of row rank $r$ and with bounded subdeterminants. In particular, we study the…

Combinatorics · Mathematics 2023-09-08 Björn Kriepke , Gohar M. Kyureghyan , Matthias Schymura

We present simple, self-contained proofs of correctness for algorithms for linearity testing and program checking of linear functions on finite subsets of integers represented as n-bit numbers. In addition we explore a generalization of…

Computational Complexity · Computer Science 2015-06-24 Sheela Devadas , Ronitt Rubinfeld

We consider the best-choice problem for independent (not necessarily iid) observations $X_1, \cdots, X_n$ with the aim of selecting the sample minimum. We show that in this full generality the monotone case of optimal stopping holds and the…

Probability · Mathematics 2021-10-13 Alexander Gnedin , Patryk Kozieł , Małgorzata Sulkowska

Consider two random variables contaminated by two unknown transformations. The aim of this paper is to test the equality of those transformations. Two cases are distinguished: first, the two random variables have known distributions.…

Methodology · Statistics 2011-11-01 Mohamed Boutahar , Denys Pommeret

We study the eigenvalues of the covariance matrix $\frac{1}{n}M^*M$ of a large rectangular matrix $M=M_{n,p}=(\zeta_{ij})_{1\leq i\leq p;1\leq j\leq n}$ whose entries are i.i.d. random variables of mean zero, variance one, and having finite…

Spectral Theory · Mathematics 2012-05-28 Terence Tao , Van Vu

Consider a central problem in randomized approximation schemes that use a Monte Carlo approach. Given a sequence of independent, identically distributed random variables $X_1,X_2,\ldots$ with mean $\mu$ and standard deviation at most $c…

Statistics Theory · Mathematics 2014-11-18 Mark Huber

For each $n$, let $A_n=(\sigma_{ij})$ be an $n\times n$ deterministic matrix and let $X_n=(X_{ij})$ be an $n\times n$ random matrix with i.i.d. centered entries of unit variance. In the companion article Cook et al., we considered the…

Probability · Mathematics 2020-07-31 Nicholas A. Cook , Walid Hachem , Jamal Najim , David Renfrew

Let $\mathbf X$ be a random matrix whose pairs of entries $X_{jk}$ and $X_{kj}$ are correlated and vectors $ (X_{jk},X_{kj})$, for $1\le j<k\le n$, are mutually independent. Assume that the diagonal entries are independent from off-diagonal…

Probability · Mathematics 2013-09-24 Friedrich Götze , Alexey Naumov , Alexander Tikhomirov

Let (R,m) be an n-dimensional regular local ring, essentially of finite type over a field of characteristic zero. In this paper we study the relationship between the singularities of the scheme defined by an m-primary ideal I of R and the…

Algebraic Geometry · Mathematics 2007-05-23 Tommaso de Fernex

We consider $n\times n$ random matrices $M_{n}=\sum_{\alpha =1}^{m}{\tau _{\alpha }}\mathbf{y}_{\alpha }\otimes \mathbf{y}_{\alpha }$, where $\tau _{\alpha }\in \mathbb{R}$, $\{\mathbf{y}_{\alpha }\}_{\alpha =1}^{m}$ are i.i.d. isotropic…

Probability · Mathematics 2013-12-02 O. Guédon , A. Lytova , A. Pajor , L. Pastur