English
Related papers

Related papers: Complex Random Matrices have no Real Eigenvalues

200 papers

This work examines various statistical distributions in connection with random Vandermonde matrices and their extension to $d$--dimensional phase distributions. Upper and lower bound asymptotics for the maximum singular value are found to…

Probability · Mathematics 2012-11-19 Gabriel H. Tucci , Philip A. Whiting

This work introduces the minimax Laplace transform method, a modification of the cumulant-based matrix Laplace transform method developed in "User-friendly tail bounds for sums of random matrices" (arXiv:1004.4389v6) that yields both upper…

Probability · Mathematics 2011-07-22 Alex Gittens , Joel A. Tropp

Although there is an extensive literature on the maxima of Gaussian processes, there are relatively few non-asymptotic bounds on their lower-tail probabilities. The aim of this paper is to develop such a bound, while also allowing for many…

Probability · Mathematics 2021-12-02 Miles E. Lopes , Junwen Yao

We prove an estimate on the smallest singular value of a multiplicatively and additively deformed random rectangular matrix. Suppose $n\le N \le M \le \Lambda N$ for some constant $\Lambda \ge 1$. Let $X$ be an $M\times n$ random matrix…

Probability · Mathematics 2018-10-17 Fan Yang

Let $\xi$ be a real random variable with mean zero and variance one and $A={a_1,...,a_n}$ be a multi-set in $\R^d$. The random sum $$S_A := a_1 \xi_1 + ... + a_n \xi_n $$ where $\xi_i$ are iid copies of $\xi$ is of fundamental importance in…

Combinatorics · Mathematics 2013-01-03 Hoi H. Nguyen , Van H. Vu

Chebyshev's inequality provides an upper bound on the tail probability of a random variable based on its mean and variance. While tight, the inequality has been criticized for only being attained by pathological distributions that abuse the…

Optimization and Control · Mathematics 2020-10-16 Ernst Roos , Ruud Brekelmans , Wouter van Eekelen , Dick den Hertog , Johan van Leeuwaarden

In this manuscript we give an extension of the classic Salem--Zygmund inequality for locally sub-Gaussian random variables. As an application, the concentration of the roots of a Kac polynomial is studied, which is the main contribution of…

Probability · Mathematics 2023-05-05 Gerardo Barrera , Paulo Manrique

For a fixed $n\ge2$, consider an $n\times n$ matrix $M$ whose entries are random integers bounded by $k$ in absolute value. In this paper, we examine the probability that $M$ is singular (hence has eigenvalue 0), and the probability that…

Number Theory · Mathematics 2007-12-20 Greg Martin , Erick B. Wong

Let $A$ be a $n \times n$ symmetric matrix with $(A_{i,j})_{i\leq j} $, independent and identically distributed according to a subgaussian distribution. We show that $$\mathbb{P}(\sigma_{\min}(A) \leq \varepsilon/\sqrt{n}) \leq C…

Probability · Mathematics 2023-10-24 Marcelo Campos , Matthew Jenssen , Marcus Michelen , Julian Sahasrabudhe

In this paper, I present a completely new type of upper and lower bounds on the right-tail probabilities of continuous random variables with unbounded support and with semi-bounded support from the left. The presented upper and lower…

Probability · Mathematics 2023-11-28 Nikola Zlatanov

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

Let $\a$ be a complex random variable with mean zero and bounded variance. Let $N_{n}$ be the random matrix of size $n$ whose entries are iid copies of $\a$ and $M$ be a fixed matrix of the same size. The goal of this paper is to give a…

Probability · Mathematics 2017-05-23 Terence Tao , Van Vu

Consider the normalized adjacency matrices of random $d$-regular graphs on $N$ vertices with fixed degree $d\geq 3$, and denote the eigenvalues as $\lambda_1=d/\sqrt{d-1}\geq \lambda_2\geq\lambda_3\cdots\geq \lambda_N$. We prove that the…

Probability · Mathematics 2024-05-21 Jiaoyang Huang , Theo McKenzie , Horng-Tzer Yau

Let $X_1,\ldots,X_n$ be independent identically distributed random vectors in $\mathbb{R}^d$. We consider upper bounds on $\max_x \mathbb{P}(a_1X_1+\cdots+a_nX_n=x)$ under various restrictions on $X_i$ and the weights $a_i$. When…

Probability · Mathematics 2020-08-04 Tomas Juškevičius , Valentas Kurauskas

Consider nonzero vectors $a_{1},\dots,a_{n}\in\mathbb{C}^{k}$, independent Rademacher random variables $\xi_{1},\dots,\xi_{n}$, and a set $S\subseteq\mathbb{C}^{k}$. What upper bounds can we prove on the probability that the random sum…

Combinatorics · Mathematics 2025-06-02 Alexandr Grebennikov , Matthew Kwan

Let $Q_n$ denote a random symmetric $n$ by $n$ matrix, whose upper diagonal entries are i.i.d. Bernoulli random variables (which take values 0 and 1 with probability 1/2). We prove that $Q_n$ is non-singular with probability…

Probability · Mathematics 2007-05-23 Kevin Costello , Terence Tao , Van Vu

Fix a sequence c=(c_1,...,c_n) of non-negative integers with sum n-1. We say a rooted tree T has child sequence c if it is possible to order the nodes of T as v_1,...,v_n so that for each 1 <= i <= n, v_i has exactly c_i children. Let T be…

Probability · Mathematics 2011-09-22 Louigi Addario-Berry

We prove an optimal estimate on the smallest singular value of a random subgaussian matrix, valid for all fixed dimensions. For an N by n matrix A with independent and identically distributed subgaussian entries, the smallest singular value…

Probability · Mathematics 2016-12-23 Mark Rudelson , Roman Vershynin

These expository notes are centered around the circular law theorem, which states that the empirical spectral distribution of a nxn random matrix with i.i.d. entries of variance 1/n tends to the uniform law on the unit disc of the complex…

Probability · Mathematics 2012-03-14 Charles Bordenave , Djalil Chafai

We take a first small step to extend the validity of Rudelson-Vershynin type estimates to some sparse random matrices, here random permutation matrices. We give lower (and upper) bounds on the smallest singular value of a large random…

Probability · Mathematics 2014-04-16 Gérard Ben Arous , Kim Dang