Remark on the norm of random Hankel matrices |
| |
Authors: | V V Nekrutkin |
| |
Institution: | 1. St. Petersburg State University, Universitetskaya nab. 7/9, St. Petersburg, 199034, Russia
|
| |
Abstract: | In recent years, the asymptotic properties of structured random matrices have attracted the attention of many experts involved in probability theory. In particular, R. Adamczak (J. Theor. Probab., Vol. 23, 2010) proved that, under fairly weak conditions, the squared spectral norms of large square Hankel matrices generated by independent identically distributed random variables grow with probability 1, as Nln(N), where N is the size of a matrix. On the basis of these results, by using the technique and ideas of Adamczak’s paper cited above, we prove that, under certain constraints, the squared spectral norms of large rectangular Hankel matrices generated by linear stationary sequences grow almost certainly no faster than Nln(N), where N is the number of different elements in a Hankel matrix. Nekrutkin (Stat. Interface, Vol. 3, 2010) pointed out that this result may be useful for substantiating (by using series of perturbation theory) so-called “signal subspace methods,” which are often used for processing time series. In addition to the main result, the paper contains examples and discusses the sharpness of the obtained inequality. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|