English
Related papers

Related papers: Singularity of discrete random matrices

200 papers

A sequential importance sampling algorithm is developed for the distribution that results when a matrix of independent, but not identically distributed, Bernoulli random variables is conditioned on a given sequence of row and column sums.…

Computation · Statistics 2013-01-18 Matthew T. Harrison , Jeffrey W. Miller

Standard singularity theorems are proven in Lorentzian manifolds of arbitrary dimension n if they contain closed trapped submanifolds of arbitrary co-dimension. By using the mean curvature vector to characterize trapped submanifolds, a…

General Relativity and Quantum Cosmology · Physics 2014-11-21 Gregory J. Galloway , José M. M. Senovilla

Classical results of Bennett and Gill (1981) show that with probability 1, $P^A \neq NP^A$ relative to a random oracle $A$, and with probability 1, $P^\pi \neq NP^\pi \cap coNP^\pi$ relative to a random permutation $\pi$. Whether $P^A =…

Computational Complexity · Computer Science 2025-11-13 John M. Hitchcock , Adewale Sekoni , Hadi Shafei

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

A pair of probability distributions over $\{0,1\}^n$ is said to be $(k,\delta)$-wise indistinguishable if all of the size $k$ marginals are within statistical distance at most $\delta$. Previous works introduced this concept and study when…

Computational Complexity · Computer Science 2026-05-14 Christopher Williamson

Asymptotic freeness of independent Haar distributed unitary matrices was discovered by Voiculescu. Many refinements have been obtained, including strong asymptotic freeness of random unitaries and strong asymptotic freeness of random…

Probability · Mathematics 2024-07-16 Charles Bordenave , Benoit Collins

It is shown that, for any given $p\ge5$, $A>0$ and $B>0$, the exact upper bound on $\mathsf{E}|\sum X_i|^p$ over all independent zero-mean random variables (r.v.'s) $X_1,\ldots,X_n$ such that $\sum\mathsf{E}X_i^2=B$ and…

Probability · Mathematics 2015-10-30 Iosif Pinelis

We use classical results from harmonic analysis on matrix spaces to investigate the relation between the joint density of the singular values and of the eigenvalues of complex random matrices which are bi-unitarily invariant (also known as…

Classical Analysis and ODEs · Mathematics 2017-03-22 Mario Kieburg , Holger Kösters

Let $\lambda^{*}>0$ denote the largest possible value of $\lambda$ such that $$ \{{array}{lllllll} \Delta^{2}u=\lambda(1+u)^{p} & {in}\ \ \B, %0<u\leq 1 & {in}\ \ \B, u=\frac{\partial u}{\partial n} =0 & {on}\ \ \partial \B {array}. $$ has…

Analysis of PDEs · Mathematics 2011-07-22 Baishun Lai , Zhengxiang Yan , Yinghui Zhang

For fixed $m>1$, we consider $m$ independent $n \times n$ non-Hermitian random matrices $X_1, ..., X_m$ with i.i.d. centered entries with a finite $(2+\eta)$-th moment, $ \eta>0.$ As $n$ tends to infinity, we show that the empirical…

Probability · Mathematics 2014-08-18 Sean O'Rourke , Alexander Soshnikov

Let $A_n$ be an $n\times n$ random symmetric matrix with $(A_{ij})_{i< j}$ i.i.d. mean $0$, variance 1, following a subGaussian distribution and diagonal elements i.i.d. following a subGaussian distribution with a fixed variance. We…

Probability · Mathematics 2024-05-15 Yi Han

We consider two ensembles of nxn matrices. The first is the set of all nxn matrices with entries zeroes and ones such that all column sums and all row sums equal r, uniformly weighted. The second is the set of nxn matrices with zero and one…

Mathematical Physics · Physics 2023-05-17 Paul Federbush

We conjecture that the structure of Bernoulli numbers can be explicitly given in the closed form $$ B_n = (-1)^{\frac{n}{2}-1} \prod_{p-1 \nmid n} |n|_p^{-1} \prod\limits_{(p,l)\in\Psi^{\rm irr}_1 \atop n \equiv l \mods{p-1}} |p…

Number Theory · Mathematics 2007-05-23 Bernd C. Kellner

We apply the method of determinants to study the distribution of the largest singular values of large $ m \times n $ real rectangular random matrices with independent Cauchy entries. We show that statistical properties of the (rescaled by a…

Probability · Mathematics 2009-11-10 Alexander Soshnikov , Yan V. Fyodorov

The classical problem of maximizing the Shannon entropy of a sum of independent random variables supported on a finite alphabet is considered and settled in the ternary case. Namely, the following theorem is established: if…

Information Theory · Computer Science 2026-05-13 Mladen Kovačević

We derive bounds on the extremal singular values and the condition number of NxK, with N>=K, Vandermonde matrices with nodes in the unit disk. The mathematical techniques we develop to prove our main results are inspired by a link---first…

Information Theory · Computer Science 2017-08-07 Céline Aubel , Helmut Bölcskei

Given a real matrix A with n columns, the problem is to approximate the Gram product AA^T by c << n weighted outer products of columns of A. Necessary and sufficient conditions for the exact computation of AA^T (in exact arithmetic) from c…

Numerical Analysis · Mathematics 2014-05-16 John T. Holodnak , Ilse C. F. Ipsen

We prove decidability results on the existence of constant subsequences of uniformly recurrent morphic sequences along arithmetic progressions. We use spectral properties of the subshifts they generate to give a first algorithm deciding…

Dynamical Systems · Mathematics 2018-11-19 Fabien Durand , Valérie Goyheneche

We derive a lower bound on the smallest singular value of a random $d$-regular matrix, that is, the adjacency matrix of a random $d$-regular directed graph. More precisely, let $C_1<d< c_1 n/\log^2 n$ and let $\mathcal{M}_{n,d}$ be the set…

A well-known result in random matrix theory, proven by Kahn, Koml\'os and Szemer\'edi in 1995, states that a square random matrix with i.i.d. uniform $\{\pm 1\}$ entries is invertible with probability $1-\exp(-\Omega(n))$. As a natural…

Probability · Mathematics 2026-02-20 Yi Han
‹ Prev 1 8 9 10 Next ›