Community Detection and Stochastic Block Models
From MaRDI portal
Publication:4556226
DOI10.1561/0100000067zbMath1403.62111OpenAlexW4292330641MaRDI QIDQ4556226
Publication date: 23 November 2018
Published in: Foundations and Trends® in Communications and Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1561/0100000067
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Random graphs (graph-theoretic aspects) (05C80) Research exposition (monographs, survey articles) pertaining to statistics (62-02)
Related Items
Overlapping community detection in networks via sparse spectral decomposition, The hierarchy of block models, Community detection and percolation of information in a geometric setting, Assortativity and Bidegree Distributions on Bernoulli Random Graph Superpositions, Sparse and smooth: improved guarantees for spectral clustering in the dynamic stochastic block model, Hypothesis testing in sparse weighted stochastic block model, Exact recovery of community detection in \(k\)-partite graph models with applications to learning electric potentials in electric networks, Aligning random graphs with a sub-tree similarity message-passing algorithm, Multilayer hypergraph clustering using the aggregate similarity matrix, Mixture models and networks: The stochastic blockmodel, Respondent-driven sampling on sparse Erdös-Rényi graphs, Concentration of multi-overlaps for random dilute ferromagnetic spin models, Random geometric graph: some recent developments and perspectives, A compressed sensing based least squares approach to semi-supervised local cluster extraction, Social disruption games in signed networks, Chain-referral sampling on stochastic block models, Unnamed Item, Unnamed Item, Bayesian consensus clustering in multiplex networks, Weighted stochastic block model, Analysis of spectral clustering algorithms for community detection: the general bipartite setting, A comparison of statistical relational learning and graph neural networks for aggregate graph queries, A Metric on Directed Graphs and Markov Chains Based on Hitting Probabilities, Non-convex exact community recovery in stochastic block model, Unnamed Item, Graph Powering and Spectral Robustness
