اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Sparse Representation of Random Signals
125
0
0.0
(
0
)
تأليف
Tao Qian
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Studies of sparse representation of deterministic signals have been well developed. Amongst there exists one called adaptive Fourier decomposition (AFD) established through adaptive selections of the parameters defining a Takenaka-Malmquist system in one-complex variable. The AFD type algorithms give rise to sparse representations of signals of finite energy. The multivariate generalization of AFD is one called pre-orthogonal AFD (POAFD), the latter being established with the context Hilbert space possessing a dictionary. The purpose of the present study is to generalize both AFD and POAFD to random signals. We work on two types of random signals. One is those expressible as the sum of a deterministic signal with an error term such as a white noise; and the other is, in general, as mixture of several classes of random signals obeying certain distributive law. In the first part of the paper we develop an AFD type sparse representation for one-dimensional random signals by making use analysis of one complex variable. In the second part, without complex analysis, we treat multivariate random signals in the context of stochastic Hilbert space with a dictionary. Like in the deterministic signal case the established random sparse representations are powerful tools in practical signal analysis.
قيم البحث
اقرأ أيضاً
A Herglotz function is a holomorphic map from the open complex unit disk into the closed complex right halfplane. A classical Herglotz function has an integral representation against a positive measure on the unit circle. We prove a free analytic ana
logue of the Herglotz representation and describe how our representations specialize to the free probabilistic case. We also show that the set of representable Herglotz functions arising from noncommutative conditional expectations must be closed in a natural topology.
The integer points (sites) of the real line are marked by the positions of a standard random walk. We say that the set of marked sites is weakly, moderately or strongly sparse depending on whether the jumps of the standard random walk are supported b
y a bounded set, have finite or infinite mean, respectively. Focussing on the case of strong sparsity we consider a nearest neighbor random walk on the set of integers having jumps $pm 1$ with probability $1/2$ at every nonmarked site, whereas a random drift is imposed at every marked site. We prove new distributional limit theorems for the so defined random walk in a strongly sparse random environment, thereby complementing results obtained recently in Buraczewski et al. (2018+) for the case of moderate sparsity and in Matzavinos et al. (2016) for the case of weak sparsity. While the random walk in a strongly sparse random environment exhibits either the diffusive scaling inherent to a simple symmetric random walk or a wide range of subdiffusive scalings, the corresponding limit distributions are non-stable.
We study the spectrum of a random multigraph with a degree sequence ${bf D}_n=(D_i)_{i=1}^n$ and average degree $1 ll omega_n ll n$, generated by the configuration model, and also the spectrum of the analogous random simple graph. We show that, when
the empirical spectral distribution (ESD) of $omega_n^{-1} {bf D}_n $ converges weakly to a limit $ u$, under mild moment assumptions (e.g., $D_i/omega_n$ are i.i.d. with a finite second moment), the ESD of the normalized adjacency matrix converges in probability to $ uboxtimes sigma_{rm sc}$, the free multiplicative convolution of $ u$ with the semicircle law. Relating this limit with a variant of the Marchenko--Pastur law yields the continuity of its density (away from zero), and an effective procedure for determining its support. Our proof of convergence is based on a coupling between the random simple graph and multigraph with the same degrees, which might be of independent interest. We further construct and rely on a coupling of the multigraph to an inhomogeneous ErdH{o}s-Renyi graph with the target ESD, using three intermediate random graphs, with a negligible fraction of edges modified in each step.
A random walk in a sparse random environment is a model introduced by Matzavinos et al. [Electron. J. Probab. 21, paper no. 72: 2016] as a generalization of both a simple symmetric random walk and a classical random walk in a random environment. A ra
ndom walk $(X_n)_{nin mathbb{N}cup{0}}$ in a sparse random environment $(S_k,lambda_k)_{kinmathbb{Z}}$ is a nearest neighbor random walk on $mathbb{Z}$ that jumps to the left or to the right with probability $1/2$ from every point of $mathbb{Z}setminus {ldots,S_{-1},S_0=0,S_1,ldots}$ and jumps to the right (left) with the random probability $lambda_{k+1}$ ($1-lambda_{k+1}$) from the point $S_k$, $kinmathbb{Z}$. Assuming that $(S_k-S_{k-1},lambda_k)_{kinmathbb{Z}}$ are independent copies of a random vector $(xi,lambda)in mathbb{N}times (0,1)$ and the mean $mathbb{E}xi$ is finite (moderate sparsity) we obtain stable limit laws for $X_n$, properly normalized and centered, as $ntoinfty$. While the case $xileq M$ a.s. for some deterministic $M>0$ (weak sparsity) was analyzed by Matzavinos et al., the case $mathbb{E} xi=infty$ (strong sparsity) will be analyzed in a forthcoming paper.
We study the statistics of the largest eigenvalues of $p times p$ sample covariance matrices $Sigma_{p,n} = M_{p,n}M_{p,n}^{*}$ when the entries of the $p times n$ matrix $M_{p,n}$ are sparse and have a distribution with tail $t^{-alpha}$, $alpha>0$.
On average the number of nonzero entries of $M_{p,n}$ is of order $n^{mu+1}$, $0 leq mu leq 1$. We prove that in the large $n$ limit, the largest eigenvalues are Poissonian if $alpha<2(1+mu^{{-1}})$ and converge to a constant in the case $alpha>2(1+mu^{{-1}})$. We also extend the results of Benaych-Georges and Peche [7] in the Hermitian case, removing restrictions on the number of nonzero entries of the matrix.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
