English
Related papers

Related papers: Concentration of permanent estimators for certain …

200 papers

We show that the absolute value of the determinant of a matrix with random independent (but not necessarily iid) entries is strongly concentrated around its mean. As an application, we show that the Godsil-Gutman and Barvinok estimators for…

Probability · Mathematics 2015-07-16 Kevin P. Costello , Van Vu

Let $A\in\mathbb{R}^{n\times n}$ be a random matrix with independent entries, and suppose that the entries are "uniformly anticoncentrated" in the sense that there is a constant $\varepsilon>0$ such that each entry $a_{ij}$ satisfies…

Probability · Mathematics 2025-09-29 Zach Hunter , Matthew Kwan , Lisa Sauermann

Permanents of random matrices with independent and identically distributed (i.i.d.) entries have extensively studied in literature and convergence and concentration properties are known under varying assumptions on the distributions. In…

Probability · Mathematics 2021-12-13 Ghurumuruhan Ganesan

We present a deterministic algorithm, which, for any given 0< epsilon < 1 and an nxn real or complex matrix A=(a_{ij}) such that | a_{ij}-1| < 0.19 for all i, j computes the permanent of A within relative error epsilon in n^{O(ln n -ln…

Combinatorics · Mathematics 2014-06-25 Alexander Barvinok

Let $A_n$ be an $n$ by $n$ random matrix whose entries are independent real random variables with mean zero, variance one and with subexponential tail. We show that the logarithm of $|\det A_n|$ satisfies a central limit theorem. More…

Probability · Mathematics 2014-01-14 Hoi H. Nguyen , Van Vu

We study the asymptotic behavior of permanents of $n \times n$ random matrices $A$ with positive entries. We assume that $A$ has either i.i.d. entries or is a symmetric matrix with the i.i.d. upper triangle. Under the assumption that…

Probability · Mathematics 2014-10-31 Tonći Antunović

We prove that for any $\lambda > 1$, fixed in advance, the permanent of an $n \times n$ complex matrix, where the absolute value of each diagonal entry is at least $\lambda$ times bigger than the sum of the absolute values of all other…

Combinatorics · Mathematics 2018-09-13 Alexander Barvinok

We investigate concentration properties of spectral measures of Hermitian random matrices with partially dependent entries. More precisely, let $X_n$ be a Hermitian random matrix of size $n\times n$ that can be split into independent blocks…

Probability · Mathematics 2020-07-31 Bartłomiej Polaczyk

Let $n>m$, and let $A$ be an $(m\times n)$-matrix of full rank. Then obviously the estimate $\|Ax\|\leq\|A\|\|x\|$ holds for the euclidean norm of $x$ and $Ax$ and the spectral norm as the assigned matrix norm. We study the sets of all $x$…

Rings and Algebras · Mathematics 2022-03-16 Harry Yserentant

Let $T$ be an $n\times n$ random matrix, such that each diagonal entry $T_{i,i}$ is a continuous random variable, independent from all the other entries of $T$. Then for every $n\times n$ matrix $A$ and every $t\ge0$ $$…

Probability · Mathematics 2013-02-21 Omer Friedland , Ohad Giladi

This article studies the \emph{robust covariance matrix estimation} of a data collection $X = (x_1,\ldots,x_n)$ with $x_i = \sqrt \tau_i z_i + m$, where $z_i \in \mathbb R^p$ is a \textit{concentrated vector} (e.g., an elliptical random…

Probability · Mathematics 2022-04-12 Cosme Louart , Romain Couillet

Computing $\log\det(A)$ for large symmetric positive definite matrices arises in Gaussian process inference and Bayesian model comparison. Standard methods combine matrix-vector products with polynomial approximations. We study a different…

Machine Learning · Computer Science 2026-01-21 Piyush Sao

Consider the square random matrix $A_n=(a_{ij})_{n,n}$, where $\{a_{ij}:=a_{ij}^{(n)},i,j=1,\ldots,n\}$ is a collection of independent real random variables with means zero and variances one. Under the additional moment condition…

Probability · Mathematics 2015-07-29 Zhigang Bao , Guangming Pan , Wang Zhou

We show how to extend several basic concentration inequalities for simple random tensors $X = x_1 \otimes \cdots \otimes x_d$ where all $x_k$ are independent random vectors in $\mathbb{R}^n$ with independent coefficients. The new results…

Probability · Mathematics 2025-10-07 Roman Vershynin

Let $W_n= \frac{1}{\sqrt n} M_n$ be a Wigner matrix whose entries have vanishing third moment, normalized so that the spectrum is concentrated in the interval $[-2,2]$. We prove a concentration bound for $N_I = N_I(W_n)$, the number of…

Probability · Mathematics 2013-08-13 Terence Tao , Van Vu

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

We construct a deterministic approximation algorithm for computing a permanent of a $0,1$ $n$ by $n$ matrix to within a multiplicative factor $(1+\epsilon)^n$, for arbitrary $\epsilon>0$. When the graph underlying the matrix is a constant…

Combinatorics · Mathematics 2007-05-23 David Gamarnik , Dmitriy Katz

Fix a finite field $\mathbb F_q$ and let $A\in \mathbb F_q^{n\times n}$ be a uniformly random $n\times n$ matrix over $\mathbb F_q$. The asymptotic distribution of the determinant $\det(A)$ is well-understood, but the asymptotic…

Combinatorics · Mathematics 2026-03-18 Zach Hunter , Matthew Kwan , Lisa Sauermann

We show that the permanent of an $n \times n$ matrix with iid Bernoulli entries $\pm 1$ is of magnitude $n^{({1/2}+o(1))n}$ with probability $1-o(1)$. In particular, it is almost surely non-zero.

Combinatorics · Mathematics 2008-04-18 T. Tao , V. Vu

We analyze the asymptotic behavior of random variables $x(n,x\_0)$ defined by $x(0,x\_0)=x\_0$ and $x(n+1,x\_0)=A(n)x(n,x\_0)$, where $\sAn$ is a stationary and ergodic sequence of random matrices with entries in the semi-ring…

Probability · Mathematics 2007-05-23 Glenn Merlet
‹ Prev 1 2 3 10 Next ›