Fetching the paper…
Reading the bibliography…
We study bipartite community detection in networks, or more generally the network biclustering problem.
“Spectral clustering and the high-dimensional stochastic blockmodel”
Karl Rohe, Sourav Chatterjee and Bin Yu · 1915
Earlier work this paper cites.
“Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels”
Peter Bickel, David Choi, Xiangyu Chang and Hai Zhang · 1943
Earlier work this paper cites.
“A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations”
Herman Chernoff · 1952
Earlier work this paper cites.
“The Poisson approximation to the Poisson binomial distribution”
Joseph Hodges and Lucien Le · 1960
Earlier work this paper cites.
“Direct clustering of a data matrix”
John Hartigan · 1972
Earlier work this paper cites.
“The tail of the hypergeometric distribution”
Vasek Chv“’atal · 1979
Earlier work this paper cites.
“Asymptotic error probability of binary hypothesis testing for poisson point-process observations (corresp.)”
Sergio Verd“’u · 1986
Earlier work this paper cites.
“Linear assignment problems and extensions”
Rainer Burkard and Eranda Cela · 1999
Earlier work this paper cites.
“Biclustering of expression data.”
Yizong Cheng and George Church · 2000
Earlier work this paper cites.
“Estimation and prediction for stochastic blockstructures”
Krzysztof Nowicki and Tom A Snijders · 2001
Earlier work this paper cites.
“Discovering statistically significant biclusters in gene expression data”
Amos Tanay, Roded Sharan and Ron Shamir · 2002
Earlier work this paper cites.
“Information-Theoretic Co-clustering”, 2003, pp. 89–98
Inderjit Dhillon · 2003
Earlier work this paper cites.
“Elements of information theory”
Thomas Cover and Joy Thomas · 2006
Earlier work this paper cites.
“Co-clustering documents and words using Bipartite Co-clustering documents and words using Bipartite Spectral Graph Partitioning”
I Dhillon · 2006
Earlier work this paper cites.
“Bipartite network projection and personal recommendation”
Tao Zhou, Jie Ren, Mat“’us Medo and Yi Zhang · 2007
Earlier work this paper cites.
“A nonparametric view of network models and Newman–Girvan and other modularities”
Peter Bickel and Aiyou Chen · 2009
Earlier work this paper cites.
“Identification of regulatory modules in time series gene expression data using a linear time biclustering algorithm”
Sara Madeira, Miguel Teixeira, Isabel Sa-Correia and Arlindo Oliveira · 2010
Earlier work this paper cites.
“Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications”
Aurelien Decelle, Florent Krzakala, Cristopher Moore and Lenka Zdeborov“’a · 2011
Earlier work this paper cites.
“Consistency of maximum-likelihood and variational estimators in the stochastic block model”
Alain Celisse, Jean-Jacques Daudin and Laurent Pierre · 2012
Earlier work this paper cites.
“Consistency of community detection in networks under degree-corrected stochastic block models”
Yunpeng Zhao, Elizaveta Levina and Ji Zhu · 2012
Earlier work this paper cites.
“Consistent adjacency-spectral partitioning for the stochastic block model when the model parameters are unknown”
Donniell Fishkind et al · 2013
Cited alongside, same era.
“Spectral redemption in clustering sparse networks”
Florent Krzakala et al · 2013
Cited alongside, same era.
“Consistency of spectral clustering in sparse stochastic block models. arXiv preprint”
Jing Lei and Alessandro Rinaldo · 2013
Cited alongside, same era.
“Efficiently inferring community structure in bipartite networks”
Daniel. Larremore, Aaron Clauset and Abigail. Jacobs · 2014
Cited alongside, same era.
“Community detection thresholds and the weak Ramanujan property”
Laurent Massouli“’e · 2014
Cited alongside, same era.
“Achieving exact cluster recovery threshold via semidefinite programming”
Bruce Hajek, Yihong Wu and Jiaming Xu · 2016
Later among the works it cites.
“Achieving exact cluster recovery threshold via semidefinite programming: Extensions”
Bruce Hajek, Yihong Wu and Jiaming Xu · 2016
Later among the works it cites.
“Semidefinite programs on sparse random graphs and their application to community detection”
Andrea Montanari and Subhabrata Sen · 2016
Later among the works it cites.
“Performance of a community detection algorithm based on semidefinite programming”
Federico Ricci-Tersenghi, Adel Javanmard and Andrea Montanari · 2016
Later among the works it cites.
“Minimax rates of community detection in stochastic block models”
Anderson Zhang and Harrison Zhou · 2016
Later among the works it cites.
“Community detection and stochastic block models: recent developments”
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Van Vu · 2014
Cited alongside, same era.
“Inferring structure in bipartite networks using the latent block model and exact ICL”, 2014, pp. 23
Jason Wyse, Nial Friel and Pierre Latouche · 2014
Cited alongside, same era.
“Accurate community detection in the stochastic block model via spectral algorithms”
Se-Young Yun and Alexandre Proutiere · 2014
Cited alongside, same era.
“Community detection in general stochastic block models: Fundamental limits and efficient algorithms for recovery”
Emmanuel Abbe and Colin Sandon · 2015
Cited alongside, same era.
“Random Laplacian matrices and convex relaxations”
Afonso Bandeira · 2015
Cited alongside, same era.
“Non-backtracking spectrum of random graphs: community detection and non-regular ramanujan graphs”
Charles Bordenave, Marc Lelarge and Laurent Massouli“’e · 2015
Cited alongside, same era.
“Stochastic block model and community detection in sparse graphs: A spectral algorithm with optimal rate of recovery”
Peter Chin, Anup Rao and Van Vu · 2015
Cited alongside, same era.
Emmanuel Abbe · 2017
Later among the works it cites.
“Multisection in the stochastic block model using semidefinite programming”
Naman Agarwal, Afonso Bandeira, Konstantinos Koiliaris and Alexandra Kolla · 2017
Later among the works it cites.
“A spectral method for community detection in moderately sparse degree-corrected stochastic block models”
Lennart Gulikers, Marc Lelarge and Laurent Massouli“’e · 2017
Later among the works it cites.
“A semidefinite program for unbalanced multisection in the stochastic block model”
Amelia Perry and Alexander Wein · 2017
Later among the works it cites.
“Spectral clustering in the dynamic stochastic block model”
Marianna Pensky and Teng Zhang · 2017
Later among the works it cites.
“Matched bipartite block model with covariates”
Zahra. Razaee, Arash. Amini and Jingyi Li · 2017
Later among the works it cites.
“Optimal Rates for Community Estimation in the Weighted Stochastic Block Model”
Min Xu, Varun Jog and Po-Ling Loh · 2017
Later among the works it cites.
Anderson Zhang and Harrison Zhou · 2017
Later among the works it cites.
“On semidefinite relaxations for the block model”
Arash Amini and Elizaveta Levina · 2018
Closest in time.
“Community detection in hypergraphs: Optimal statistical limit and efficient algorithms”
I Chien, Chung-Yi Lin and I-Hsiang Wang · 2018
Closest in time.
“Community detection in degree-corrected block models”
Chao Gao, Zongming Ma, Anderson Zhang and Harrison Zhou · 2018
Closest in time.
“Analysis of spectral clustering algorithms for community detection: the general bipartite setting”
Zhixin Zhou and Arash. Amini · 2018
Closest in time.
“Achieving optimal misclassification proportion in stochastic block models”
Chao Gao, Zongming Ma, Anderson Zhang and Harrison Zhou · 2024
Closest in time.
“Pseudo-likelihood methods for community detection in large sparse networks”
Arash Amini, Aiyou Chen, Peter Bickel and Elizaveta Levina · 2097
Closest in time.