English
Related papers

Related papers: The smallest singular value of signed random combi…

200 papers

The auto-cross covariance matrix is defined as \[\mathbf{M}_n=\frac{1} {2T}\sum_{j=1}^T\bigl(\mathbf{e}_j\mathbf{e}_{j+\tau}^*+\mathbf{e}_{j+ \tau}\mathbf{e}_j^*\bigr),\] where $\mathbf{e}_j$'s are $n$-dimensional vectors of independent…

Statistics Theory · Mathematics 2015-10-30 Chen Wang , Baisuo Jin , Z. D. Bai , K. Krishnan Nair , Matthew Harding

Two landmark results in combinatorial random matrix theory, due to Koml\'os and Costello-Tao-Vu, show that discrete random matrices and symmetric discrete random matrices are typically nonsingular. In particular, in the language of graph…

Combinatorics · Mathematics 2023-03-10 Margalit Glasgow , Matthew Kwan , Ashwin Sah , Mehtaab Sawhney

The forbidden number $\mathrm{forb}(m,F)$, which denotes the maximum number of unique columns in an $m$-rowed $(0,1)$-matrix with no submatrix that is a row and column permutation of $F$, has been widely studied in extremal set theory.…

Combinatorics · Mathematics 2023-06-22 Travis Dillon , Attila Sali

We prove that there is a universal constant $C>0$ with the following property. Suppose that $n\in \mathbb{N}$ and that $\mathsf{A}=(a_{ij})\in M_n(\mathbb{R})$ is a symmetric stochastic matrix. Denote the second-largest eigenvalue of…

Metric Geometry · Mathematics 2016-11-29 Assaf Naor

Let A be an n x n symmetric random matrix whose upper-triangular entries are independent and follow possibly non-identical subgaussian distributions. This paper investigates the spectral properties of A, including its eigenvalues and…

Probability · Mathematics 2026-04-14 Zeyan Song , Hanchao Wang

A matrix is homogeneous if all of its entries are equal. Let $P$ be a $2\times 2$ zero-one matrix that is not homogeneous. We prove that if an $n\times n$ zero-one matrix $A$ does not contain $P$ as a submatrix, then $A$ has an $cn\times…

Combinatorics · Mathematics 2020-10-13 Dániel Korándi , János Pach , István Tomon

The random matrix uniformly distributed over the set of all m-by-n matrices over a finite field plays an important role in many branches of information theory. In this paper a generalization of this random matrix, called k-good random…

Information Theory · Computer Science 2012-05-03 Shengtian Yang , Thomas Honold

The Boolean rank of a $0,1$-matrix $A$, denoted $R_\mathbb{B}(A)$, is the smallest number of monochromatic combinatorial rectangles needed to cover the $1$-entries of $A$. In 1988, de Caen, Gregory, and Pullman asked if the Boolean rank of…

Combinatorics · Mathematics 2022-03-08 Ishay Haviv , Michal Parnas

Let $M_n = (\xi_{ij})_{1 \leq i,j \leq n}$ be a real symmetric random matrix in which the upper-triangular entries $\xi_{ij}, i<j$ and diagonal entries $\xi_{ii}$ are independent. We show that with probability tending to 1, $M_n$ has no…

Probability · Mathematics 2014-12-04 Terence Tao , Van Vu

Unlike classical and free independence, the boolean and monotone notions of independence lack of the property of independent constants. In the scalar case, this leads to restrictions for the central limit theorems, as observed by F.…

Probability · Mathematics 2021-09-14 Carlos Dias-Aguilera , Tulio Gaxiola , Jorge Santos , Carlos Vargas

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

Proving a 2009 conjecture of Itai Benjamini, we show: For any C there is an $\varepsilon>0$ such that for any simple graph $G$ on $V$ of size $n$, and $X_0,\ldots$ an ordinary random walk on $G$, $P(\{X_0,\dots, X_{Cn}\}= V) <…

Probability · Mathematics 2021-11-23 Quentin Dubroff , Jeff Kahn

We derive estimates for the largest and smallest singular values of sparse rectangular $N\times n$ random matrices, assuming $\lim_{N,n\to\infty}\frac nN=y\in(0,1)$. We consider a model with sparsity parameter $p_N$ such that $Np_N\sim…

Probability · Mathematics 2022-11-29 F. Götze , A. Tikhomirov

Symmetric matrices with zero row sums occur in many theoretical settings and in real-life applications. When the offdiagonal elements of such matrices are i.i.d. random variables and the matrices are large, the eigenvalue distributions…

Disordered Systems and Neural Networks · Physics 2023-06-27 Pawat Akara-pipattana , Oleg Evnin

Given a positive integer $ r $, the $ r $-color size-Ramsey number of a graph $ H $, denoted by $ \hat{R}(H, r) $, is the smallest integer $ m $ for which there exists a graph $ G $ with $ m $ edges such that, in any edge coloring of $ G $…

Combinatorics · Mathematics 2021-07-01 Ramin Javadi , Meysam Miralaei

Suppose $X$ and $Y$ are $p\times n$ matrices each with mean $0$, variance $1$ and where all moments of any order are uniformly bounded as $p,n \to \infty$. Moreover, the entries $(X_{ij}, Y_{ij})$ are independent across $i,j$ with a common…

Probability · Mathematics 2021-03-23 Monika Bhattacharjee , Arup Bose , Apratim Dey

We show that there is a constant c>0 so that for any fixed r which is at least 3 a.a.s. an r-regular graph on n vertices contains a complete graph on c n^{1/2} vertices as a minor. This confirms a conjecture of Markstrom. Since any minor of…

Combinatorics · Mathematics 2008-03-21 N. Fountoulakis , D. Kühn , D. Osthus

We show that a uniformly Euclidean metric with isolated singularity on $M^n = T^n \# M_0$, where $4\leq n\leq 7$ or $n\geq 4$, $M_0$ spin, and nonnegative scalar curvature on the smooth part is Ricci flat and extends smoothly over the…

Differential Geometry · Mathematics 2025-02-03 Xianzhe Dai , Changliang Wang , Lihe Wang , Guofang Wei

We consider a class of sparse random matrices of the form $A_n =(\xi_{i,j}\delta_{i,j})_{i,j=1}^n$, where $\{\xi_{i,j}\}$ are i.i.d.~centered random variables, and $\{\delta_{i,j}\}$ are i.i.d.~Bernoulli random variables taking value $1$…

Probability · Mathematics 2017-02-06 Anirban Basak , Mark Rudelson

Consider the (almost surely) unique Radon partition of a set of $n$ random Gaussian vectors in $\mathbb R^{n-2}$; choose one of the two parts of this partition uniformly at random, and for $0 \le k \le n$, let $p_k$ denote the probability…

Combinatorics · Mathematics 2025-07-03 Swee Hong Chan , Gil Kalai , Bhargav Narayanan , Natalya Ter-Saakov , Moshe White