English
Related papers

Related papers: The smallest singular value of signed random combi…

200 papers

For any integers $d, n \geq 2$ and $1/({\min\{n,d\}})^{0.4999} < \varepsilon<1$, we show the existence of a set of $n$ vectors $X\subset \mathbb{R}^d$ such that any embedding $f:X\rightarrow \mathbb{R}^m$ satisfying $$ \forall x,y\in X,\…

Information Theory · Computer Science 2017-11-10 Kasper Green Larsen , Jelani Nelson

Let M be a noncompact metric space in which every closed ball is compact, and let G be a semigroup of Lipschitz mappings of M. Denote by (Y_n)_{n\geq1} a sequence of independent G-valued, identically distributed random variables (r.v.'s),…

Probability · Mathematics 2016-09-07 Hubert Hennion , Loic Herve

For $g < n$, let $b\_1,...,b\_{n-g}$ be $n - g$ independent vectors in $\mathbb{R}^n$ with a common distribution invariant by rotation. Considering these vectors as a basis for the Euclidean lattice they generate, the aim of this paper is…

Probability · Mathematics 2007-05-23 Ali Akhavi , Jean-François Marckert , Alain Rouault

This papers contains two results concerning random $n \times n$ Bernoulli matrices. First, we show that with probability tending to one the determinant has absolute value $\sqrt {n!} \exp(O(\sqrt(n log n)))$. Next, we prove a new upper…

Combinatorics · Mathematics 2008-07-01 Terence Tao , Van Vu

We establish an explicit upper bound for the Euclidean minimum of a number field which depends, in a precise manner, only on its discriminant and the number of real and complex embeddings. Such bounds were shown to exist by Davenport and…

Number Theory · Mathematics 2023-01-24 Eva Bayer-Fluckiger , Martino Borello , Peter Jossen

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…

Probability · Mathematics 2011-02-01 Mark W. Meckes

Let $M_n$ be a class of symmetric sparse random matrices, with independent entries $M_{ij} = \delta_{ij} \xi_{ij}$ for $i \leq j$. $\delta_{ij}$ are i.i.d. Bernoulli random variables taking the value $1$ with probability $p \geq…

Probability · Mathematics 2018-02-20 Kyle Luh , Van Vu

Let $n$ be a positive integer and $X = [x_{ij}]_{1 \leq i, j \leq n}$ be an $n \times n$\linebreak \noindent sized matrix of independent random variables having joint uniform distribution $$\hbox{Pr} {x_{ij} = k \hbox{for} 1 \leq k \leq n}…

Discrete Mathematics · Computer Science 2011-04-25 Antal Iványi , Imre Kátai

Motivated by problems from compressed sensing, we determine the threshold behavior of a random $n\times d$ $\pm 1$ matrix $M_{n,d}$ with respect to the property "every $s$ columns are linearly independent". In particular, we show that for…

Combinatorics · Mathematics 2023-02-14 Asaf Ferber , Ashwin Sah , Mehtaab Sawhney , Yizhe Zhu

For a tuple $T$ of Hilbert space operators, the 'commuting dilation constant' is the smallest number $c$ such that the operators of $T$ are a simultaneous compression of commuting normal operators of norm at most $c$. We present numerical…

Functional Analysis · Mathematics 2026-03-17 Malte Gerhold , Marcel Scherer , Orr Shalit

A new type of stochastic dependence for a sequence of random variables is introduced and studied. Precisely, (X_n)_{n\geq 1} is said to be conditionally identically distributed (c.i.d.), with respect to a filtration (G_n)_{n\geq 0}, if it…

Probability · Mathematics 2007-05-23 Patrizia Berti , Luca Pratelli , Pietro Rigo

In this paper we study a family of discrete configuration spaces, the so-called protocol complexes, which are of utmost importance in theoretical distributed computing. Specifically, we consider questions of the existance of compliant…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-04-27 D. N. Kozlov

For any $\Lambda>0$, let $\mathcal{M}_{n,\Lambda}$ denote the space containing all locally Lipschitz minimal graphs of dimension $n$ and of arbitrary codimension $m$ in Euclidean space $\mathbb{R}^{n+m}$ with uniformly bounded 2-dilation…

Differential Geometry · Mathematics 2021-09-21 Qi Ding , J. Jost , Y. L. Xin

We show that the spectral radius of an $N\times N$ random symmetric matrix with i.i.d. bounded centered but non-symmetrically distributed entries is bounded from below by $ 2 \*\sigma - o(N^{-6/11+\epsilon}), $ where $\sigma^2 $ is the…

Probability · Mathematics 2008-05-14 Sandrine Peche , Alexander Soshnikov

Compressed sensing is the art of reconstructing structured $n$-dimensional vectors from substantially fewer measurements than naively anticipated. A plethora of analytic reconstruction guarantees support this credo. The strongest among them…

Information Theory · Computer Science 2018-12-20 Peter Jung , Richard Kueng , Dustin G. Mixon

Consider a random $n\times m$ matrix $A$ over the finite field of order $q$ where every column has precisely $k$ nonzero elements, and let $M[A]$ be the matroid represented by $A$. In the case that q=2, Cooper, Frieze and Pegden (RS\&A…

Combinatorics · Mathematics 2024-01-22 Pu Gao , Peter Nelson

We initiate the study of the binary and Boolean rank of $0,1$ matrices that have a small rank over the reals. The relationship between these three rank functions is an important open question, and here we prove that when the real rank $d$…

Combinatorics · Mathematics 2025-07-15 Michal Parnas , Adi Shraibman

Let $G=G(n,p_n)$ be a homogeneous Erd\"os-R\'enyi graph, and $A$ its adjacency matrix with eigenvalues $\lambda_1(A) \geq \lambda_2(A) \geq ... \geq \lambda_n(A).$ Local laws have been used to show that $lambda_2(A)$ can exhibit…

Probability · Mathematics 2024-12-24 Simona Diaconu

We study rectangular Vandermonde matrices $\mathbf{V}$ with $N+1$ rows and $s$ irregularly spaced nodes on the unit circle, in cases where some of the nodes are "clustered" together -- the elements inside each cluster being separated by at…

Numerical Analysis · Mathematics 2020-07-27 Dmitry Batenkov , Benedikt Diederichs , Gil Goldman , Yosef Yomdin

Consider the triangle $T$ with vertices $(0,0)$, $(0,1)$, and $(1,0)$. The lower boundary of the convex hull of $(0,1)$, $(1,0)$, together with $n$ independent uniformly distributed random points in $T$, is called a random convex chain and…

Probability · Mathematics 2026-01-12 Florian Besau , Christoph Thäle
‹ Prev 1 8 9 10 Next ›