No abstract uploaded!

No abstract uploaded!

In this paper, we prove a necessary and sufficient condition for the edge universality of sample covariance matrices with general population. We consider sample covariance matrices of the form $\mathcal Q = TX(TX)^{*}$, where $X$ is an $M_2\times N$ random matrix with $X_{ij}=N^{-1/2}q_{ij}$ such that $q_{ij}$ are $i.i.d.$ random variables with zero mean and unit variance, and $T$ is an $M_1 \times M_2$ deterministic matrix such that $T^* T$ is diagonal. We study the asymptotic behavior of the largest eigenvalues of $\mathcal Q$ when $M:=\min\{M_1,M_2\}$ and $N$ tend to infinity with $\lim_{N \to \infty} {N}/{M}=d \in (0, \infty)$. We prove that the Tracy-Widom law holds for the largest eigenvalue of $\mathcal Q$ if and only if $\lim_{s \rightarrow \infty}s^4 \mathbb{P}(\vert q_{ij} \vert \geq s)=0$ under mild assumptions of $T$. The necessity and sufficiency of this condition for the edge universality was first proved for Wigner matrices by Lee and Yin [34].

In this paper, we propose a novel iterative convolution-thresholding method (ICTM) that is applicable to a range of variational models for image segmentation. A variational model usually minimizes an energy functional consisting of a fidelity term and a regularization term. In the ICTM, the interface between two different segment domains is implicitly represented by their characteristic functions. The fidelity term is usually written as a linear functional of the characteristic functions and the regularized term is approximated by a functional of characteristic functions in terms of heat kernel convolution. This allows us to design an iterative convolution-thresholding method to minimize the approximate energy. The method is simple, efficient and enjoys the energy-decaying property. Numerical experiments show that the method is easy to implement, robust and applicable to various image segmentation models.

Big Data bring new opportunities to modern society and challenges to data scientists. On the one hand, Big Data hold great promises for discovering subtle population patterns and heterogeneities that are not possible with small-scale data. On the other hand, the massive sample size and high dimensionality of Big Data introduce unique computational and statistical challenges, including scalability and storage bottleneck, noise accumulation, spurious correlation, incidental endogeneity and measurement errors. These challenges are distinguished and require new computational and statistical paradigm. This paper gives overviews on the salient features of Big Data and how these features impact on paradigm change on statistical and computational methods as well as computing architectures. We also provide various new perspectives on the Big Data analysis and computation. In particular, we emphasize on