Related papers: The condition number of a randomly perturbed matri…

This article is dedicated to the following class of problems. Start with an $N\times N$ Hermitian matrix randomly picked from a matrix ensemble - the reference matrix. Applying a rank-$t$ perturbation to it, with $t$ taking the values $1\le…

We consider random systems of equations over the reals, with $m$ equations and $m$ unknowns $P_i(t)+X_i(t)=0$, $t\in\mathbb{R}^m$, $i=1,...,m$, where the $P_i$'s are non-random polynomials having degrees $d_i$'s (the "signal") and the…

The condition number of the $n\ x\ n$ matrix $P$ is examined, where $P$ solves %the discete Lyapunov equation, $P - A P A^* = BB^*$, and $B$ is a $n\ x\ d$ matrix. Lower bounds on the condition number, $\kappa$, of $P$ are given when $A$ is…

We prove large and moderate deviation principles for the distribution of an empirical mean conditioned by the value of the sum of discrete i.i.d. random variables. Some applications for combinatoric problems are discussed.

This paper considers random (non-Hermitian) circulant matrices, and proves several results analogous to recent theorems on non-Hermitian random matrices with independent entries. In particular, the limiting spectral distribution of a random…

Analysis of three-way data is becoming ever more prevalent in the literature, especially in the area of clustering and classification. Real data, including real three-way data, are often contaminated by potential outlying observations.…

Consider the nonlinear matrix equation X-sum_{i=1}^{m}A_{i}^{*}X^{p_{i}}A_{i}=Q with p_{i}>0. Sufficient and necessary conditions for the existence of positive definite solutions to the equation with p_{i}>0 are derived. Two perturbation…

In this text, based on elementary computations, we provide a perturbative expansion of the coordinates of the eigenvectors of a Hermitian matrix of large size perturbed by a random matrix with small operator norm whose entries in the…

We perform a smoothed analysis of the condition number of rectangular matrices. We prove that, asymptotically, the expected value of this condition number depends only of the elongation of the matrix, and not on the center and variance of…

We determine the probability that a random n x n symmetric matrix over {1, 2, ... , m} has determinant divisible by m.

Let $G_n$ be an $n \times n$ matrix with real i.i.d. $N(0,1/n)$ entries, let $A$ be a real $n \times n$ matrix with $\Vert A \Vert \le 1$, and let $\gamma \in (0,1)$. We show that with probability $0.99$, $A + \gamma G_n$ has all of its…

We are concerned with the general problem of proving the existence of joint distributions of two discrete random variables $M$ and $N$ subject to infinitely many constraints of the form $\mathbb{P}\left(M=i,N=j\right)=0$. In particular, the…

Let $M_n$ be drawn uniformly from all $\pm 1$ symmetric $n \times n$ matrices. We show that the probability that $M_n$ is singular is at most $\exp(-c(n\log n)^{1/2})$, which represents a natural barrier in recent approaches to this…

One tuple of probability vectors is more informative than another tuple when there exists a single stochastic matrix transforming the probability vectors of the first tuple into the probability vectors of the other. This is called matrix…

The definition of conditional probability in case of continuous distributions was an important step in the development of mathematical theory of probabilities. How can we define this notion in algorithmic probability theory? In this survey…

We study transformations of conventional (`classical') probabilities induced by context transitions. It is demonstrated that the transition from one complex of conditions to another induces a perturbation of the classical rule for the…

Polynomial minimal bases of rational vector subspaces are a classical concept that plays an important role in control theory, linear systems theory, and coding theory. It is a common practice to arrange the vectors of any minimal basis as…

We give the distribution of $M_n$, the maximum of a sequence of $n$ observations from a moving average of order 1. Solutions are first given in terms of repeated integrals and then for the case where the underlying independent random…

Let $P_N$ be a uniform random $N\times N$ permutation matrix and let $\chi_N(z)=\det(zI_N- P_N)$ denote its characteristic polynomial. We prove a law of large numbers for the maximum modulus of $\chi_N$ on the unit circle, specifically, \[…

We compare Stochastic and Worst-case condition numbers and loss of precision for general computational problems. We show an upper bound for the ratio of Worst-case condition number to the Stochastic condition number of order O(sqrt m). We…