Related papers: The random paving property for uniformly bounded m…

This paper establishes new concentration inequalities for random matrices constructed from independent random variables. These results are analogous with the generalized Efron-Stein inequalities developed by Boucheron et al. The proofs rely…

This paper is concerned with structures of general graphs with perfect matchings. We first reveal a partially ordered structure among factor-components of general graphs with perfect matchings. Our second result is a generalization of…

We establish a Pythagorean theorem for the absolute values of the blocks of a partitioned matrix. This leads to a series of remarkable operator inequalities.

In a paper that appeared in 2010, C. Tone proved a multivariate central limit theorem for some strictly stationary random fields of random vectors satisfying certain mixing conditions. The "normalization" of a given "partial sum" (or "block…

There has recently been renewed recognition of the need to understand the consistency properties that must be preserved when a generalized matrix inverse is required. The most widely known generalized inverse, the Moore-Penrose…

We consider random matrices whose entries are f(<Xi,Xj>) or f(||Xi-Xj||^2) for iid vectors Xi in R^p with normalized distribution. Assuming that f is sufficiently smooth and the distribution of Xi's is sufficiently nice, El Karoui [17]…

This paper establishes a new comparison principle for the minimum eigenvalue of a sum of independent random positive-semidefinite matrices. The principle states that the minimum eigenvalue of the matrix sum is controlled by the minimum…

We study two fundamental optimization problems: (1) scaling a symmetric positive definite matrix by a positive diagonal matrix so that the resulting matrix has row and column sums equal to 1; and (2) minimizing a quadratic function subject…

We show several ways to round a real matrix to an integer one such that the rounding errors in all rows and columns as well as the whole matrix are less than one. This is a classical problem with applications in many fields, in particular,…

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…

We study the problem of finding a minimal graph with prescribed boundary data in arbitrary dimension and codimension. Existence, uniqueness, stability and regularity are treated. We first present the well-known results for codimension one:…

Learning an appropriate (dis)similarity function from the available data is a central problem in machine learning, since the success of many machine learning algorithms critically depends on the choice of a similarity function to compare…

We give a simple proof of the matrix Spencer conjecture up to poly-logarithmic rank: given symmetric $d \times d$ matrices $A_1,\ldots,A_n$ each with $\|A_i\|_{\mathsf{op}} \leq 1$ and rank at most $n/\log^3 n$, one can efficiently find…

A quantum finite multi-barrier system, with a periodic potential, is considered and exact expressions for its plane wave amplitudes are obtained using the Transfer Matrix method [10]. This quantum model is then associated with a stochastic…

We consider banded block Toeplitz matrices $T_n$ with $n$ block rows and columns. We show that under certain technical assumptions, the normalized eigenvalue counting measure of $T_n$ for $n\to\infty$ weakly converges to one component of…

For each $\alpha \in \mathbb{R}$, $t \geq 1$, we show that there exists a unique $\mathbb{N}$-indexed line ensemble of random continuous curves $\mathbb{R}_{\le 0} \to \mathbb{R}$ with the following properties: (1) The top curve is…

For any unitary matrix there exists a ZXZ decomposition, according to a theorem by Idel and Wolf. For any even-dimensional unitary matrix there exists a block-ZXZ decomposition, according to a theorem by F\"uhr and Rzeszotnik. We conjecture…

This paper focuses on the study of existence and uniqueness of distributional and classical solutions to the Cauchy Boltzmann problem for the soft potential case assuming $S^{n-1}$ integrability of the angular part of the collision kernel…

In this paper, we introduce polynomial time algorithms that generate random $k$-noncrossing partitions and 2-regular, $k$-noncrossing partitions with uniform probability. A $k$-noncrossing partition does not contain any $k$ mutually…

We study the distribution of partial sums of Rademacher random multiplicative functions $(f(n))_n$ evaluated at polynomial arguments. We show that for a polynomial $P\in \mathbb Z[x]$ that is a product of at least two distinct linear…