Co-clustering separately exchangeable network data
This article establishes the performance of stochastic blockmodels in addressing the co-clustering problem of partitioning a binary array into subsets, assuming only that the data are generated by a nonparametric process satisfying the condition of separate exchangeability. We provide oracle inequalities with rate of convergence $\mathcal{O}_P(n^{-1/4})$ corresponding to profile likelihood maximization and mean-square error minimization, and show that the blockmodel can be interpreted in this setting as an optimal piecewise-constant approximation to the generative nonparametric model. We also show for large sample sizes that the detection of co-clusters in such data indicates with high probability the existence of co-clusters of equal size and asymptotically equivalent connectivity in the underlying generative process.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringSimilar Papers 제목 키워드 기반
Maximal Inequalities for Separately Exchangeable Empirical Processes
This paper derives new maximal inequalities for empirical processes associated with separately exchangeable random arrays. For fixed index dimension $K\ge 1$, we establish a global maximal inequality bounding the $q$-th …
Inference for high-dimensional exchangeable arrays
We consider inference for high-dimensional separately and jointly exchangeable arrays where the dimensions may be much larger than the sample sizes. For both exchangeable arrays, we first derive high-dimensional central …
Density EstimationregressionVocal Bursts Intensity PredictionSequential Edge Clustering in Temporal Multigraphs
Interaction graphs, such as those recording emails between individuals or transactions between institutions, tend to be sparse yet structured, and often grow in an unbounded manner. Such behavior can be well-captured by …
ClusteringGraphical Dirichlet Process for Clustering Non-Exchangeable Grouped Data
We consider the problem of clustering grouped data with possibly non-exchangeable groups whose dependencies can be characterized by a known directed acyclic graph. To allow the sharing of clusters among the non-exchangea…
ClusteringCross-Fitting-Free Debiased Machine Learning with Multiway Dependence
This paper develops an asymptotic theory for two-step debiased machine learning (DML) estimators in generalised method of moments (GMM) models with general multiway clustered dependence, without relying on cross-fitting.…