论文检索

利用低阶多项式研究图函数估计的计算下界AI 解读

Graphon estimation has been one of the most fundamental problems in network analysis and has received considerable attention in the past decade. From the statistical perspective, the minimax error rate of graphon estimation has been established by (Ann. Statist. 43 (2015) 2624–2652) for both stochastic block model (SBM) and nonparametric graphon estimation. The statistical optimal estimators are based on constrained least squares and have computational complexity exponential…

对《通过边抽样进行网络交叉验证》的讨论AI 解读

We congratulate the authors for their exciting paper (Li et al., 2020) on the difficult problem of network model selection. The authors have proposed an interesting cross-validation procedure that selects the best network model according to the criterion ... One of the main novelties of the method is the use of matrix completion to reconstruct a full network |$\{\skew6\hat{A}_{ij}\}_{1\leq i\neq j\leq n}$| from the partial set of observations |$\{A_{ij}\}_{(i,\,j)\in\Omega}$|…

度修正块模型中的社区检测AI 解读

Community detection is a central problem of network data analysis. Given a network, the goal of community detection is to partition the network nodes into a small number of clusters, which could often help reveal interesting structures. The present paper studies community detection in Degree-Corrected Block Models (DCBMs). We first derive asymptotic minimax risks of the problem for a misclassification proportion loss under appropriate conditions. The minimax risks are shown…

达到最优收敛率的 Graphon 估计AI 解读

Network analysis is becoming one of the most active research areas in statistics. Significant advances have been made recently on developing theories, methodologies and algorithms for analyzing networks. However, there has been little fundamental study on optimal estimation. In this paper, we establish optimal rate of convergence for graphon estimation. For the stochastic block model with $k$ clusters, we show that the optimal rate under the mean squared error is $n^{-1}\log k+k^{2}/n^{2}$…