论文检索

高维随机向量相互独立性的秩最大值—求和检验AI 解读

We consider the problem of testing mutual independence of high-dimensional random vectors, and propose a series of high-dimensional rank-based max-sum tests, which are suitable for high-dimensional data and can be robust to distribution types of the variables, form of the dependence between variables and the sparsity of correlation coefficients. Further, we demonstrate the application of some representative members of the proposed tests on testing cross-sectional…

基于剖面伪似然的快速网络社区检测AI 解读

The stochastic block model is one of the most studied network models for community detection, and fitting its likelihood function on large-scale networks is known to be challenging. One prominent work that overcomes this computational challenge is the fast pseudo-likelihood approach proposed by Amini et al. for fitting stochastic block models to large sparse networks. However, this approach does not have convergence guarantee, and may not be well suited for small and medium…

高维面板数据截面独立性的最大值—求和检验AI 解读

We consider a testing problem for cross-sectional independence for high-dimensional panel data, where the number of cross-sectional units is potentially much larger than the number of observations. The cross-sectional independence is described through linear regression models. We study three tests named the sum, the max and the max-sum tests, where the latter two are new. The sum test is initially proposed by Breusch and Pagan (1980). We design the max and sum tests for…