English
Related papers

Related papers: The smallest singular value for rectangular random…

200 papers

Given low order moment information over the random variables $\mathbf{X} = (X_1,X_2,\ldots,X_p)$ and $Y$, what distribution minimizes the Hirschfeld-Gebelein-R\'{e}nyi (HGR) maximal correlation coefficient between $\mathbf{X}$ and $Y$,…

Information Theory · Computer Science 2015-04-24 Farzan Farnia , Meisam Razaviyayn , Sreeram Kannan , David Tse

For a $d$-dimensional random vector $X$, let $p_{n, X}(\theta)$ be the probability that the convex hull of $n$ independent copies of $X$ contains a given point $\theta$. We provide several sharp inequalities regarding $p_{n, X}(\theta)$ and…

Probability · Mathematics 2023-01-11 Satoshi Hayakawa , Terry Lyons , Harald Oberhauser

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 this paper, we investigate the invertibility of sparse symmetric matrices. We show that for an $n\times n$ sparse symmetric random matrix $A$ with $A_{ij} = \delta_{ij} \xi_{ij}$ is invertible with high probability. Here, $\delta_{ij}$s,…

Probability · Mathematics 2018-04-26 Feng Wei

This paper is essentially devoted to the study of the minimal eigenvalue $\lambda_{N,\alpha}$ of the Toepllitz matrice $T_N(\varphi_{\alpha})$ where $\varphi_{\alpha}(e^{i \theta})=|1- e^{i \theta} |^{2\alpha} c_{1}(e^{i \theta})$ with…

Spectral Theory · Mathematics 2013-05-28 Philippe Rambour

We study delocalization of null vectors and eigenvectors of random matrices with i.i.d entries. Let $A$ be an $n\times n$ random matrix with i.i.d real subgaussian entries of zero mean and unit variance. We show that with probability at…

Probability · Mathematics 2019-09-19 Anna Lytova , Konstantin Tikhomirov

The estimation of the diffusion matrix $\Sigma$ of a high-dimensional, possibly time-changed L\'evy process is studied, based on discrete observations of the process with a fixed distance. A low-rank condition is imposed on $\Sigma$.…

Statistics Theory · Mathematics 2018-11-05 Denis Belomestny , Mathias Trabs

Given a $k\times n$ integer primitive matrix $\bf{A}$ (i.e., a matrix can be extended to an $n\times n$ unimodular matrix over the integers) with the maximal absolute value of entries $\|\bf{A}\|$ bounded by {an integer} $\lambda$ from…

Symbolic Computation · Computer Science 2023-03-17 Jingwei Chen , Yong Feng , Yang Liu , Wenyuan Wu

We consider products of independent square random non-Hermitian matrices. More precisely, let $n\geq 2$ and let $X_1,\ldots,X_n$ be independent $N\times N$ random matrices with independent centered entries with variance $N^{-1}$. It was…

Probability · Mathematics 2015-12-15 Yuriy Nemish

Let $S=XX^T$ be the (unscaled) sample covariance matrix where $X$ is a real $p \times n$ matrix with independent entries. It is well known that if the entries of $X$ are independent and identically distributed (i.i.d.) with enough moments…

Probability · Mathematics 2022-05-24 Arup Bose , Priyanka Sen

We consider $n\times n$ real symmetric and hermitian random matrices $H_{n,m}$ equals the sum of a non-random matrix $H_{n}^{(0)}$ matrix and the sum of $m$ rank-one matrices determined by $m$ i.i.d. isotropic random vectors with…

Probability · Mathematics 2007-10-09 Alain Pajor , Leonid Pastur

Given an input matrix polynomial whose coefficients are floating point numbers, we consider the problem of finding the nearest matrix polynomial which has rank at most a specified value. This generalizes the problem of finding a nearest…

Symbolic Computation · Computer Science 2017-12-13 Mark Giesbrecht , Joseph Haraldson , George Labahn

In this paper, we obtain two new lower bounds for the smallest singular value of nonsingular matrices which is better than the bound presented by zou \cite{zou2012lower}, Lin, Minghua and Xie, Mengyan \cite{lin2021some} under certain…

Numerical Analysis · Mathematics 2021-08-05 Xu Shun

Let $X_1,X_2, \ldots $ be a sequence of $i.i.d$ real (complex) $d \times d $ invertible random matrices with common distribution $\mu$ and $\sigma_1(n), \sigma_2(n), \ldots , \sigma_d(n)$ be the singular values, $\lambda_1(n), \lambda_2(n),…

Probability · Mathematics 2016-06-27 Nanda Kishore Reddy

For a pair of coupled rectangular random matrices we consider the squared singular values of their product, which form a determinantal point process. We show that the limiting mean distribution of these squared singular values is described…

Mathematical Physics · Physics 2020-06-24 Guilherme L. F. Silva , Lun Zhang

Let $\Sigma_d^{++}$ be the set of positive definite matrices with determinant 1 in dimension $d\ge 2$. Identifying any two $SL_d(\mathbb{Z})$-congruent elements in $\Sigma_d^{++}$ gives rise to the space of reduced quadratic forms of…

Number Theory · Mathematics 2016-07-18 Faustin Adiceam , Evgeniy Zorin

We study the singular values (and Lyapunov exponents) for products of $N$ independent $n\times n$ random matrices with i.i.d. entries. Such matrix products have been extensively analyzed using free probability, which applies when $n\to…

Probability · Mathematics 2025-03-12 Boris Hanin , Tianze Jiang

Let $\mathbf{a}_{ij}$, $1\leq i\leq j\leq n$, be independent random variables and $\mathbf{a}_{ji}=\mathbf{a}_{ij}$, for all $i,j$. Suppose that every $\mathbf{a}_{ij}$ is bounded, has zero mean, and its variance is given by…

Probability · Mathematics 2017-05-09 Victor M. Preciado , M. Amin Rahimian

We study n by n symmetric random matrices H, possibly discrete, with iid above-diagonal entries. We show that H is singular with probability at most exp(-n^c), and the spectral norm of the inverse of H is O(sqrt{n}). Furthermore, the…

Probability · Mathematics 2014-03-05 Roman Vershynin

In a uniform random recursive k-dag, there is a root, 0, and each node in turn, from 1 to n, chooses k uniform random parents from among the nodes of smaller index. If S_n is the shortest path distance from node n to the root, then we…

Probability · Mathematics 2015-05-13 Luc Devroye , Svante Janson
‹ Prev 1 3 4 5 6 7 10 Next ›