Co-clustering separately exchangeable network data
From MaRDI portal
Abstract: 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 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 236540 (Why is no real title available?)
- A nonparametric view of network models and Newman–Girvan and other modularities
- Advanced Lectures on Machine Learning
- Consistency of community detection in networks under degree-corrected stochastic block models
- Consistent adjacency-spectral partitioning for the stochastic block model when the model parameters are unknown
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Graph limits and exchangeable random graphs
- Graph limits and parameter testing
- Latent Space Approaches to Social Network Analysis
- Matrix estimation by universal singular value thresholding
- Maximum Likelihood Estimation of Misspecified Models
- Mixed membership stochastic blockmodels
- Probability Inequalities for Sums of Bounded Random Variables
- Random sampling and approximation of MAX-CSPs
- Ranking and empirical minimization of \(U\)-statistics
- Spectral clustering and the high-dimensional stochastic blockmodel
- Stochastic blockmodels with a growing number of classes
- The method of moments and degree distributions for network models
Cited in
(20)- Matched bipartite block model with covariates
- Inference for High-Dimensional Exchangeable Arrays
- Consistent nonparametric estimation for heavy-tailed sparse graphs
- Generalized co-clustering analysis via regularized alternating least squares
- Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding
- Convergence of the groups posterior distribution in latent or stochastic block models
- Matrix estimation by universal singular value thresholding
- Sparse graphs using exchangeable random measures
- Modularity Maximization for Graphons
- Estimating Causal Peer Influence in Homophilous Social Networks by Inferring Latent Locations
- Co-clustering of nonsmooth graphons
- Profile likelihood biclustering
- Identifiability and parameter estimation of the overlapped stochastic co-block model
- Tractably modelling dependence in networks beyond exchangeability
- scientific article; zbMATH DE number 7370528 (Why is no real title available?)
- Co-clustering through latent block model: a review
- scientific article; zbMATH DE number 7255138 (Why is no real title available?)
- Computational lower bounds for graphon estimation via low-degree polynomials
- Spectral clustering in the dynamic stochastic block model
- Estimating a network from multiple noisy realizations
This page was built for publication: Co-clustering separately exchangeable network data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2448722)
