Related papers: Incoherent dictionaries and the statistical restri…
The CR analogue of B.-Y. Chen's conjecture on pseudo biharmonic maps will be shown. Pseudo biharmonic, but not pseudo harmonic, isometric immersions with parallel pseudo mean curvature vector fields, will be characterized. Several examples…
This paper considers the estimation of Shannon entropy for discrete distributions with countably infinite support. While minimax rates for finite-support distributions are established, infinite-support distributions present distinct…
This article extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, which is a composition of a random matrix of certain type and a…
Under the assumption that a finite signal with different sampling lengths or different sampling frequencies is considered as equivalent, the signal space is considered as the quotient space of $\mathbb{R}^{\infty}$ over equivalence. The…
We investigate concentration properties of functions of random vectors with values in the discrete cube, satisfying the stochastic covering property (SCP) or the strong Rayleigh property (SRP). Our result for SCP measures include…
We prove that quaternion Gaussian random matrices satisfy the restricted isometry property (RIP) with overwhelming probability. We also explain why the restricted isometry random variables (RIV) approach is not appropriate for drawing…
Asymptotic expressions of the mutual information between any discrete input and the corresponding output of the scalar additive white Gaussian noise channel are presented in the limit as the signal-to-noise ratio (SNR) tends to infinity.…
This letter aims at extending the Constrained Semiparametric Cramer-Rao Bound (CSCRB) for the joint estimation of mean vector and scatter matrix of Real Elliptically Symmetric (RES) distributions to Complex Elliptically Symmetric (CES)…
Series representations consisting of spherical harmonics are obtained for characteristic exponents and probability density functions of multivariate stable distributions under various conditions. A esult potentially applicable in a…
We will show that tight frames satisfying the restricted isometry property give rise to nearly tight fusion frames which are nearly orthogonal and hence are nearly equi-isoclinic. We will also show how to replace parts of the RIP frame with…
For piecewise expanding one-dimensional maps without periodic turning points we prove that isolated eigenvalues of small (random) perturbations of these maps are close to isolated eigenvalues of the unperturbed system. (Here ``eigenvalue''…
This paper discusses reconstruction of signals from few measurements in the situation that signals are sparse or approximately sparse in terms of a general frame via the $l_q$-analysis optimization with $0<q\leq 1$. We first introduce a…
We provide a unified analysis of the predictive risk of ridge regression and regularized discriminant analysis in a dense random effects model. We work in a high-dimensional asymptotic regime where $p, n \to \infty$ and $p/n \to \gamma \in…
The orthogonality of cat and displaced cat states, underlying Heisenberg limited measurement in quantum metrology, is studied in the limit of large number of states. The asymptotic expression for the corresponding state overlap function,…
A matrix $A$ is said to have the $\ell_p$-Restricted Isometry Property ($\ell_p$-RIP) if for all vectors $x$ of up to some sparsity $k$, $\|{Ax}\|_p$ is roughly proportional to $\|{x}\|_p$. We study this property for $m \times n$ matrices…
The $s$-point correlation function of a Gaussian Hermitian random matrix theory, with an external source tuned to generate a multi-critical singularity, provides the intersection numbers of the moduli space for the $p$-th spin curves…
The simultaneous orthogonal matching pursuit (SOMP) is a popular, greedy approach for common support recovery of a row-sparse matrix. However, compared to the noiseless scenario, the performance analysis of noisy SOMP is still nascent,…
Compressed Sensing aims to capture attributes of a sparse signal using very few measurements. Cand\`{e}s and Tao showed that sparse reconstruction is possible if the sensing matrix acts as a near isometry on all $\boldsymbol{k}$-sparse…
Constraint Satisfaction Problem (CSP) is a fundamental algorithmic problem that appears in many areas of Computer Science. It can be equivalently stated as computing a homomorphism $\mbox{$\bR \rightarrow \bGamma$}$ between two relational…
Known sparsity thresholds for basis pursuit to deliver the maximally sparse solution of the compressed sensing recovery problem typically depend on the dictionary's coherence. While the coherence is easy to compute, it can lead to rather…