scholarly journals Random Perturbations of Matrix Polynomials

Author(s):  
Patryk Pagacz ◽  
Michał Wojtylak

Abstract A sum of a large-dimensional random matrix polynomial and a fixed low-rank matrix polynomial is considered. The main assumption is that the resolvent of the random polynomial converges to some deterministic limit. A formula for the limit of the resolvent of the sum is derived, and the eigenvalues are localised. Four instances are considered: a low-rank matrix perturbed by the Wigner matrix, a product HX of a fixed diagonal matrix H and the Wigner matrix X and two special matrix polynomials of higher degree. The results are illustrated with various examples and numerical simulations.

Author(s):  
Daniel Povey ◽  
Gaofeng Cheng ◽  
Yiming Wang ◽  
Ke Li ◽  
Hainan Xu ◽  
...  

2019 ◽  
Vol 37 (4) ◽  
pp. 1-34 ◽  
Author(s):  
Huafeng Liu ◽  
Liping Jing ◽  
Yuhua Qian ◽  
Jian Yu

Author(s):  
Yinlei Hu ◽  
Bin Li ◽  
Falai Chen ◽  
Kun Qu

Abstract Unsupervised clustering is a fundamental step of single-cell RNA sequencing data analysis. This issue has inspired several clustering methods to classify cells in single-cell RNA sequencing data. However, accurate prediction of the cell clusters remains a substantial challenge. In this study, we propose a new algorithm for single-cell RNA sequencing data clustering based on Sparse Optimization and low-rank matrix factorization (scSO). We applied our scSO algorithm to analyze multiple benchmark datasets and showed that the cluster number predicted by scSO was close to the number of reference cell types and that most cells were correctly classified. Our scSO algorithm is available at https://github.com/QuKunLab/scSO. Overall, this study demonstrates a potent cell clustering approach that can help researchers distinguish cell types in single-cell RNA sequencing data.


Sign in / Sign up

Export Citation Format

Share Document