English
Related papers

Related papers: On the Discrepancy of Random Matrices with Many Co…

200 papers

Low-rank matrix completion concerns the problem of estimating unobserved entries in a matrix using a sparse set of observed entries. We consider the non-uniform setting where the observed entries are sampled with highly varying…

Machine Learning · Statistics 2024-03-04 Xumei Xi , Christina Lee Yu , Yudong Chen

We consider nonnegative integer matrices with specified row and column sums and upper bounds on the entries. We show that the logarithm of the number of such matrices is approximated by a concave function of the row and column sums. We give…

Combinatorics · Mathematics 2011-02-15 Austin Shapiro

Let $M_n$ denote a random symmetric $n$ by $n$ matrix, whose upper diagonal entries are iid Bernoulli random variables (which take value -1 and 1 with probability 1/2). Improving the earlier result by Costello, Tao and Vu, we show that…

Combinatorics · Mathematics 2019-12-19 Hoi H. Nguyen

We consider the set Sigma(R,C) of all mxn matrices having 0-1 entries and prescribed row sums R=(r_1, ..., r_m) and column sums C=(c_1, ..., c_n). We prove an asymptotic estimate for the cardinality |Sigma(R, C)| via the solution to a…

Combinatorics · Mathematics 2009-11-25 Alexander Barvinok

We study the standard-form ILP problem $\max\{ c^\top x \colon A x = b,\; x \in Z_{\geq 0}^n \}$, where $A\in Z^{k\times n}$ has full row rank. We obtain refined FPT algorithms parameterized by $k$ and $\Delta$, the maximum absolute value…

Data Structures and Algorithms · Computer Science 2026-04-16 Dmitry Gribanov , Tagir Khayaleyev , Mikhail Cherniavskii , Maxim Klimenko , Dmitry Malyshev , Stanislav Moiseev

Let $A$ be drawn uniformly at random from the set of all $n\times n$ symmetric matrices with entries in $\{-1,1\}$. We show that \[ \mathbb{P}( \det(A) = 0 ) \leq e^{-cn},\] where $c>0$ is an absolute constant, thereby resolving a…

Probability · Mathematics 2021-06-09 Marcelo Campos , Matthew Jenssen , Marcus Michelen , Julian Sahasrabudhe

Every sufficiently big matrix with small spectral norm has a nearby low-rank matrix if the distance is measured in the maximum norm (Udell & Townsend, SIAM J Math Data Sci, 2019). We use the Hanson--Wright inequality to improve the estimate…

Numerical Analysis · Mathematics 2025-04-09 Stanislav Budzinskiy

An exchangeable random matrix is a random matrix with distribution invariant under any permutation of the entries. For such random matrices, we show, as the dimension tends to infinity, that the empirical spectral distribution tends to the…

Probability · Mathematics 2016-03-25 Radosław Adamczak , Djalil Chafaï , Paweł Wolff

The issue addressed in this paper is that of testing for common breaks across or within equations of a multivariate system. Our framework is very general and allows integrated regressors and trends as well as stationary regressors. The null…

Statistics Theory · Mathematics 2018-01-12 Tatsushi Oka , Pierre Perron

A novel matrix approximation problem is considered herein: observations based on a few fully sampled columns and quasi-polynomial structural side information are exploited. The framework is motivated by quantum chemistry problems wherein…

Signal Processing · Electrical Eng. & Systems 2023-05-23 Jeongmin Chae , Praneeth Narayanamurthy , Selin Bac , Shaama Mallikarjun Sharada , Urbashi Mitra

Let $n \in \mathbb{Z}_{\geq 3}.$ Given any Borel subset $A$ of $\mathbb{R}^n$ with finite and nonzero measure, we prove that the probability that the set of primitive points of a random full-rank unimodular lattice in $\mathbb{R}^n$ does…

Classical Analysis and ODEs · Mathematics 2021-08-24 Mishel Skenderi

This paper studies the open problem of conformalized entry prediction in a row/column-exchangeable matrix. The matrix setting presents novel and unique challenges, but there exists little work on this interesting topic. We meticulously…

Machine Learning · Computer Science 2023-06-07 Meijia Shao , Yuan Zhang

Let $M_n$ be the number of steps of the loop-erasure of a simple random walk on $\mathbb{Z}^2$ from the origin to the circle of radius $n$. We relate the moments of $M_n$ to $Es(n)$, the probability that a random walk and an independent…

Probability · Mathematics 2010-12-14 Martin T. Barlow , Robert Masson

We equip the polytope of $n\times n$ Markov matrices with the normalized trace of the Lebesgue measure of $\mathbb{R}^{n^2}$. This probability space provides random Markov matrices, with i.i.d. rows following the Dirichlet distribution of…

Probability · Mathematics 2010-06-16 Djalil Chafai

We present a simple proof to a fact recently established in [5]: let $\xi$ be a symmetric random variable that has variance $1$, let $\Gamma=(\xi_{ij})$ be an $N \times n$ random matrix whose entries are independent copies of $\xi$, and set…

Functional Analysis · Mathematics 2019-02-06 Shahar Mendelson

Let $\{a_{ij}\}$ $(1\le i,j<\infty)$ be i.i.d. real valued random variables with zero mean and unit variance and let an integer sequence $(N_m)_{m=1}^\infty$ satisfy $m/N_m\longrightarrow z$ for some $z\in(0,1)$. For each $m\in{\mathbb N}$…

Probability · Mathematics 2014-10-24 Konstantin Tikhomirov

We prove new bounds on the additive gap between the value of a random integer program $\max c^Tx,\ Ax\leq b,\ x\in\{0,1\}^n$ with $m$ constraints and that of its linear programming relaxation for a wide range of distributions on $(A,b,c)$ .…

Optimization and Control · Mathematics 2024-03-22 Sander Borst , Daniel Dadush , Dan Mikulincer

We study the distribution of the minimum spacing between eigenvalues of a random n by n unitary matrix. The minimum spacing scales as $n^{-4/3}$, not $n^{-2}$ as would be the case for n independent points on the unit circle, illustrating…

Spectral Theory · Mathematics 2011-11-14 Jade P. Vinson

Given a set C in R^d, let p(C) be the probability that a random d-dimensional unimodular lattice, chosen according to Haar measure on SL(d,Z)\SL(d,R), is disjoint from C\{0}. For special convex sets C we prove bounds on p(C) which are sharp…

Number Theory · Mathematics 2014-02-26 Andreas Strömbergsson

Let $O(2n+\ell)$ be the group of orthogonal matrices of size $\left(2n+\ell\right)\times \left(2n+\ell\right)$ equipped with the probability distribution given by normalized Haar measure. We study the probability \begin{equation*}…

Probability · Mathematics 2019-05-09 Martin Gebert , Mihail Poplavskyi