English
Related papers

Related papers: The smallest singular value for rectangular random…

200 papers

A random $n$-permutation may be generated by sequentially removing random cards $C_1,...,C_n$ from an $n$-card deck $D = \{1,...,n\}$. The permutation $\sigma$ is simply the sequence of cards in the order they are removed. This permutation…

Probability · Mathematics 2014-06-17 Nicholas F. Travers

A sorting network is a shortest path from 12...n to n...21 in the Cayley graph of S_n generated by nearest-neighbour swaps. We prove that for a uniform random sorting network, as n->infinity the space-time process of swaps converges to the…

Probability · Mathematics 2011-11-10 Omer Angel , Alexander E. Holroyd , Dan Romik , Balint Virag

Minimizing a convex, quadratic objective of the form $f_{\mathbf{A},\mathbf{b}}(x) := \frac{1}{2}x^\top \mathbf{A} x - \langle \mathbf{b}, x \rangle$ for $\mathbf{A} \succ 0 $ is a fundamental problem in machine learning and optimization.…

Machine Learning · Computer Science 2019-04-17 Max Simchowitz

Let $U$ and $V$ be two independent $N$ by $N$ random matrices that are distributed according to Haar measure on $U(N)$. Let $\Sigma$ be a non-negative deterministic $N$ by $N$ matrix. The single ring theorem [26] asserts that the empirical…

Probability · Mathematics 2019-03-04 Zhigang Bao , László Erdős , Kevin Schnelli

We analyze a distributed algorithm to compute a low-rank matrix factorization on $N$ clients, each holding a local dataset $\mathbf{S}^i \in \mathbb{R}^{n_i \times d}$, mathematically, we seek to solve $min_{\mathbf{U}^i \in…

Machine Learning · Computer Science 2025-07-22 Constantin Philippenko , Kevin Scaman , Laurent Massoulié

Given a definite nonnegative matrix $A \in M_n (C)$, we study the minimal index of A: $I(A) = \max \{\lambda \ge 0 : A\circ B \ge \lambda B$ for all $0\le B\}$, where $A\circ B$ denotes the Hadamard product $(A\circ B)_{ij} = A_{ij}…

Rings and Algebras · Mathematics 2007-05-23 G. Corach , D. Stojanoff

Let $\alpha'$ and $\mu_i$ denote the matching number of a non-empty simple graph $G$ with $n$ vertices and the $i$-th smallest eigenvalue of its Laplacian matrix, respectively. In this paper, we prove a tight lower bound $$\alpha' \ge…

Combinatorics · Mathematics 2021-11-16 Xiaofeng Gu , Muhuo Liu

Inspired by the idea of Bernoulli decomposition, we give a simple proof for a generalization of Hal\'asz anti--concentration result about random sum of vectores in $\mathbb{R}^d$. From our results, we can give one upper bound for the…

Probability · Mathematics 2018-11-12 Paulo C. Manrique Mirón

We prove estimates for $\mathbb{E} \| X: \ell_{p'}^n \to \ell_q^m\|$ for $p,q\ge 2$ and any random matrix $X$ having the entries of the form $a_{ij}Y_{ij}$, where $Y=(Y_{ij})_{1\le i\le m, 1\le j\le n}$ has i.i.d. isotropic log-concave…

Probability · Mathematics 2025-02-05 Marta Strzelecka

Let $\{X, X_n, n\geq 1\}$ be a sequence of independent identically distributed non-degenerate random variables. Put $S_0=0, S_n = \sum^n_{i=1} X_i$ and $V_n^2=\sum^n_{i=1} X_i^2, n\ge 1.$ A weak convergence theorem is established for the…

Probability · Mathematics 2013-06-21 Miklós Csörgő , Zhishui Hu

For any real number $p > 0$, we nearly completely characterize the space complexity of estimating $\|A\|_p^p = \sum_{i=1}^n \sigma_i^p$ for $n \times n$ matrices $A$ in which each row and each column has $O(1)$ non-zero entries and whose…

Data Structures and Algorithms · Computer Science 2017-03-21 Yi Li , David P. Woodruff

We consider the joint distribution of real and imaginary parts of eigenvalues of random matrices with independent entries with mean zero and unit variance. We prove the convergence of this distribution to the uniform distribution on the…

Probability · Mathematics 2010-10-19 Friedrich Götze , Alexander Tikhomirov

Let $\varepsilon_1,\ldots,\varepsilon_n$ be independent identically distributed Rademacher random variables, that is $\mathbb{P}\{\varepsilon_i=\pm1\}=1/2$. Let $S_n=a_1\varepsilon_1+\cdots+a_n\varepsilon_n$, where…

Probability · Mathematics 2015-06-02 Vidmantas Kastytis Bentkus , Dainius Dzindzalieta

The universality phenomenon asserts that the distribution of the eigenvalues of random matrix with i.i.d. zero mean, unit variance entries does not depend on the underlying structure of the random entries. For example, a plot of the…

Probability · Mathematics 2012-10-11 Philip Matchett Wood

Let $X$ be an $n$-dimensional random centered Gaussian vector with independent but not identically distributed coordinates and let $T$ be an orthogonal trasformation of $\mathbb R^n$. We show that the random vector $Y=T(X)$ satisfies…

Probability · Mathematics 2017-05-30 Alexander E. Litvak , Konstantin Tikhomirov

Let $\delta>0$ and $\sigma=\frac{1}{2}+\tfrac{\delta}{\log T}$. We prove that, for any $\alpha>0$ and $V\sim \alpha\log \log T$ as $T\to\infty$, $\frac{1}{T}\text{meas}\big\{t\in [T,2T]: \log|\zeta(\sigma+\rm{i} \tau)|>V\big\}\geq…

Number Theory · Mathematics 2024-10-30 Louis-Pierre Arguin , Emma Bailey

The large sieve inequality is equivalent to the bound $\lambda_1 \leqslant N + Q^2-1$ for the largest eigenvalue $\lambda_1$ of the $N$ by $N$ matrix $A^{\star} A$, naturally associated to the positive definite quadratic form arising in the…

Number Theory · Mathematics 2018-06-18 Florin P. Boca , Maksym Radziwiłł

We study the asymptotic behavior of the $\nu$-symmetric Riemman sums for functionals of a self-similar centered Gaussian process $X$ with increment exponent $0<\alpha<1$. We prove that, under mild assumptions on the covariance of $X$, the…

Probability · Mathematics 2017-06-14 Daniel Harnett , Arturo Jaramillo , David Nualart

The minimum skew rank $mr^{-}(\mathbb{F},G)$ of a graph $G$ over a field $\mathbb{F}$ is the smallest possible rank among all skew symmetric matrices over $\mathbb{F}$, whose ($i$,$j$)-entry (for $i\neq j$) is nonzero whenever $ij$ is an…

Combinatorics · Mathematics 2017-02-10 Yanna Wang , Bo Zhou

Let $X$ be an $n\times n$ matrix with independent and identically distributed entries $x_{ij} \stackrel{\text { d }}{=} n^{-1 / 2} x$ for some complex random variable $x$ of mean zero and variance one. Let $\{\sigma_i\}_{1\le i\le n}$ be…

Probability · Mathematics 2025-06-10 Xinchen Hu , Yutao Ma