Co-clustering separately exchangeable network data

DOI10.1214/13-AOS1173zbMath1294.62059arXiv1212.4093OpenAlexW2005455916WikidataQ59410895 ScholiaQ59410895MaRDI QIDQ2448722

David Choi, Patrick J. Wolfe

Publication date: 5 May 2014

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1212.4093

zbMATH Keywords

bipartite graphprofile likelihoodoracle inequalitynetwork clusteringstatistical network analysisstochastic blockmodel and co-blockmodel

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Nonparametric estimation (62G05) Random matrices (probabilistic aspects) (60B20)

Related Items

Unnamed Item ⋮ Modularity Maximization for Graphons ⋮ Generalized co-clustering analysis via regularized alternating least squares ⋮ Inference for High-Dimensional Exchangeable Arrays ⋮ Estimating Causal Peer Influence in Homophilous Social Networks by Inferring Latent Locations ⋮ Unnamed Item ⋮ Sparse Graphs Using Exchangeable Random Measures ⋮ Estimating a network from multiple noisy realizations ⋮ Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding ⋮ Spectral clustering in the dynamic stochastic block model ⋮ Profile likelihood biclustering ⋮ Consistent nonparametric estimation for heavy-tailed sparse graphs ⋮ Matrix estimation by universal singular value thresholding ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
• Spectral clustering and the high-dimensional stochastic blockmodel
• The method of moments and degree distributions for network models
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Random sampling and approximation of MAX-CSPs
• Consistency of community detection in networks under degree-corrected stochastic block models
• Matrix estimation by universal singular value thresholding
• Ranking and empirical minimization of \(U\)-statistics
• Stochastic blockmodels with a growing number of classes
• Graph limits and parameter testing
• A nonparametric view of network models and Newman–Girvan and other modularities
• Mixed membership stochastic blockmodels
• Graph limits and exchangeable random graphs
• Latent Space Approaches to Social Network Analysis
• Consistent Adjacency-Spectral Partitioning for the Stochastic Block Model When the Model Parameters Are Unknown
• Probability Inequalities for Sums of Bounded Random Variables
• Advanced Lectures on Machine Learning
• Multiplicative Attribute Graph Model of Real-World Networks
• Maximum Likelihood Estimation of Misspecified Models