Related papers: Restricted Eigenvalue Conditions on Subgaussian Ra…

We consider the problem of determining rank loss conditions for a concatenation of full-rank matrices, such that each row of the composing matrices is scaled by a random coefficient. This problem has applications in wireless interference…

We consider the empirical eigenvalue distribution of random real symmetric matrices with stochastically independent skew-diagonals and study its limit if the matrix size tends to infinity. We allow correlations between entries on the same…

Introducing sets of constraints, we define new classes of random-matrix ensembles, the constrained Gaussian unitary (CGUE) and the deformed Gaussian unitary (DGUE) ensembles. The latter interpolate between the GUE and the CGUE. We derive a…

Estimating covariance matrices with high-dimensional complex data presents significant challenges, particularly concerning positive definiteness, sparsity, and numerical stability. Existing robust sparse estimators often fail to guarantee…

This paper investigates the spectral properties of two classes of elliptic problems characterized by mixed Steklov-Robin boundary conditions. Our main objective is to prove that, for a generic domain, all the eigenvalues are simple. This…

In this paper (a sequel to B. Drinovec Drnovsek and F. Forstneric, Holomorphic curves in complex spaces, Duke Math. J. 139 (2007), 203-253) we obtain existence and approximation results for closed complex subvarieties that are normalized by…

We determine under which conditions certain natural models of random constraint satisfaction problems have sharp thresholds of satisfiability. These models include graph and hypergraph homomorphism, the $(d,k,t)$-model, and binary…

This paper considers the matrix completion problem. We show that it is not necessary to assume joint incoherence, which is a standard but unintuitive and restrictive condition that is imposed by previous studies. This leads to a sample…

We investigate a class of parametric elliptic eigenvalue problems with homogeneous essential boundary conditions where the coefficients (and hence the solution $u$) may depend on a parameter $y$. For the efficient approximate evaluation of…

The joint spectral radius of a bounded set of d times d real or complex matrices is defined to be the maximum exponential rate of growth of products of matrices drawn from that set. A set of matrices is said to satisfy the finiteness…

The largest eigenvalue of a matrix is always larger or equal than its largest diagonal entry. We show that for a large class of random Laplacian matrices, this bound is essentially tight: the largest eigenvalue is, up to lower order terms,…

In this paper we characterise the indeterminate case by the eigenvalues of the Hankel matrices being bounded below by a strictly positive constant. An explicit lower bound is given in terms of the orthonormal polynomials and we find…

The Matrix-based Renyi's entropy enables us to directly measure information quantities from given data without the costly probability density estimation of underlying distributions, thus has been widely adopted in numerous statistical…

Complex analysis is a powerful tool to study classical integrable systems, statistical physics on the random lattice, random matrix theory, topological string theory,... All these topics share certain relations, called "loop equations" or…

The row (column) completion problem of polynomial matrices of given degree with prescribed eigenstructure has been studied in \cite{AmBaMaRo23}, where several results of prescription of some of the four types of invariants that form the…

We establish the higher differentiability of solutions to a class of obstacle problems for integral functionals where the convex integrand f satisfies p-growth conditions with respect to the gradient variable. We derive that the higher…

In compressed sensing, the restricted isometry property (RIP) on $M \times N$ sensing matrices (where $M < N$) guarantees efficient reconstruction of sparse vectors. A matrix has the $(s,\delta)$-$\mathsf{RIP}$ property if behaves as a…

We introduce three universality classes of chiral random matrix ensembles with a nonzero chemical potential and real, complex or quaternion real matrix elements. In the thermodynamic limit we find that the distribution of the eigenvalues in…

In this paper, we prove that the Paley graph conjecture implies that the Paley matrix has restricted isometry property (RIP) beating the square-root bottleneck for the sparsity level. Moreover, we show that the RIP of the Paley matrix…

Recovering sparse vectors and low-rank matrices from noisy linear measurements has been the focus of much recent research. Various reconstruction algorithms have been studied, including $\ell_1$ and nuclear norm minimization as well as…