English
Related papers

Related papers: Random symmetric matrices are almost surely non-si…

200 papers

Starting from an n-by-n matrix of zeros, choose uniformly random zero entries and change them to ones, one-at-a-time, until the matrix becomes invertible. We show that with probability tending to one as n tends to infinity, this occurs at…

Probability · Mathematics 2018-08-09 Louigi Addario-Berry , Laura Eslava

An ensemble of random unistochastic (orthostochastic) matrices is defined by taking squared moduli of elements of random unitary (orthogonal) matrices distributed according to the Haar measure on U(N) (or O(N), respectively). An ensemble of…

Chaotic Dynamics · Physics 2009-11-07 K. Zyczkowski , W. Slomczynski , M. Kus , H. -J. Sommers

In Communication theory and Coding, it is expected that certain circulant matrices having $k$ ones and $k+1$ zeros in the first row are nonsingular. We prove that such matrices are always nonsingular when $2k+1$ is either a power of a…

Commutative Algebra · Mathematics 2020-12-21 Zhangchi Chen

A conference matrix of order $n$ is an $n\times n$ matrix $C$ with diagonal entries $0$ and off-diagonal entries $\pm 1$ satisfying $CC^\top=(n-1)I$. If $C$ is symmetric, then $C$ has a symmetric spectrum $\Sigma$ (that is,…

Combinatorics · Mathematics 2021-01-22 Willem H. Haemers , Leila Parsaei Majd

Let S_n=X_1+...+X_n be a sum of independent symmetric random variables such that |X_{i}|\leq 1. Denote by W_n=\epsilon_{1}+...+\epsilon_{n} a sum of independent random variables such that \prob{\eps_i = \pm 1} = 1/2. We prove that…

Probability · Mathematics 2019-11-13 Dainius Dzindzalieta , Matas Šileikis , Tomas Juškevičius

We explore the probability that a permutation sampled from the symmetric group of order n uniformly at random has cycles of lengths not exceeding r. Asymptotic formulas valid in specified regions for the ratio n/r are obtained using the…

Combinatorics · Mathematics 2015-01-05 Eugenijus Manstavičius , Robertas Petuchovas

We study the conjugation action of orthogonal matrices on symmetric random matrices. Given a fixed orthogonal matrix over an algebraic number field and a random matrix with entries sufficiently uniform in the ring of integers, we wonder…

Probability · Mathematics 2026-02-03 Alexander Van Werde

An elliptic random matrix $X$ is a square matrix whose $(i,j)$-entry $X_{ij}$ is independent of the rest of the entries except possibly $X_{ji}$. Elliptic random matrices generalize Wigner matrices and non-Hermitian random matrices with…

Probability · Mathematics 2022-02-03 Andrew Campbell , Sean O'Rourke

Let $M_n$ be a $n \times n$ Wigner or sample covariance random matrix, and let $\mu_1(M_n), \mu_2(M_n), ..., \mu_n(M_n)$ denote the unordered eigenvalues of $M_n$. We study the fluctuations of the partial linear eigenvalue statistics $$…

Probability · Mathematics 2015-08-06 Sean O'Rourke , Alexander Soshnikov

We study the gaps between consecutive singular values of random rectangular matrices. Specifically, if $M$ is an $n \times p$ random matrix with independent and identically distributed entries and $\Sigma$ is a $n \times n$ deterministic…

Probability · Mathematics 2025-10-07 Nicholas Christoffersen , Kyle Luh , Sean O'Rourke , Calum Shearer

In the context of the shuffle theorem, many classical integer sequences appear with a natural refinement by two statistics $q$ and $t$: for example the Catalan and Schr\"oder numbers. In particular, the bigraded Hilbert series of diagonal…

Combinatorics · Mathematics 2024-03-29 Sylvie Corteel , Matthieu Josuat-Vergès , Anna Vanden Wyngaerd

It is shown that the correlation functions of the random variables $\det(\lambda - X)$, in which $X$ is a real symmetric $ N\times N$ random matrix, exhibit universal local statistics in the large $N$ limit. The derivation relies on an…

Mathematical Physics · Physics 2009-11-07 E. Brezin , S. Hikami

Let ${\mathcal D}_{n,d}$ be the set of all $d$-regular directed graphs on $n$ vertices. Let $G$ be a graph chosen uniformly at random from ${\mathcal D}_{n,d}$ and $M$ be its adjacency matrix. We show that $M$ is invertible with probability…

We consider random polynomials whose coefficients are independent and uniform on {-1,1}. We prove that the probability that such a polynomial of degree n has a double root is o(n^{-2}) when n+1 is not divisible by 4 and asymptotic to…

Probability · Mathematics 2017-03-14 Ron Peled , Arnab Sen , Ofer Zeitouni

We prove a quantitative version of the bound on the smallest singular value of a Bernoulli covariance matrix (due to Bai and Yin). Then we use this bound, together with several recent developments, to show that the distance from a random…

Functional Analysis · Mathematics 2007-08-14 Shiri Artstein-Avidan , Omer Friedland , Vitali Milman , Sasha Sodin

We study the spectral norm of random lifts of matrices. Given an $n\times n$ symmetric matrix $A$, and a centered distribution $\pi$ on $k\times k\ (k\ge 2)$ symmetric matrices with spectral norm at most $1$, let the matrix random lift…

Probability · Mathematics 2021-06-03 Afonso S. Bandeira , Yunzi Ding

We consider uniformly random strictly upper-triangular matrices in $\operatorname{Mat}_n(\mathbb{F}_q)$. For such a matrix $A_n$, we show that $n-\operatorname{rank}(A_n) \approx \log_q n$ as $n \to \infty$, and find that the fluctuations…

Probability · Mathematics 2026-01-14 Roger Van Peski

We study the spectral properties of a class of random matrices of the form $S_n^{-} = n^{-1}(X_1 X_2^* - X_2 X_1^*)$ where $X_k = \Sigma_k^{1/2}Z_k$, $Z_k$'s are independent $p\times n$ complex-valued random matrices, and $\Sigma_k$ are…

Statistics Theory · Mathematics 2026-02-04 Javed Hazarika , Debashis Paul

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

We prove that a random automaton with $n$ states and any fixed non-singleton alphabet is synchronizing with high probability (modulo an unpublished result about unique highest trees of random graphs). Moreover, we also prove that the…

Formal Languages and Automata Theory · Computer Science 2024-07-10 Mikhail V. Berlinkov