Belief propagation, robust reconstruction and optimal recovery of block models
From MaRDI portal
Publication:341611
DOI10.1214/15-AAP1145zbMath1350.05154arXiv1309.1380MaRDI QIDQ341611
Elchanan Mossel, Allan Sly, Joe Neeman
Publication date: 16 November 2016
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.1380
Social networks; opinion dynamics (91D30) Random graphs (graph-theoretic aspects) (05C80) Combinatorial aspects of block designs (05B05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Multilayer Modularity Belief Propagation to Assess Detectability of Community Structure, Weighted Message Passing and Minimum Energy Flow for Heterogeneous Stochastic Block Models with Side Information, Multi-group binary choice with social interaction and a random communication structure -- a random graph approach, Unnamed Item, An information-percolation bound for spin synchronization on general graphs, Optimal rates for community estimation in the weighted stochastic block model, Exact recovery in block spin Ising models at the critical line, Aligning random graphs with a sub-tree similarity message-passing algorithm, Find Your Place: Simple Distributed Algorithms for Community Detection, Fundamental limits of weak recovery with applications to phase retrieval, Detection thresholds in very sparse matrix completion, Community detection in the sparse hypergraph stochastic block model, Broadcasting‐induced colorings of preferential attachment trees, Community detection in sparse random networks, Fluctuations in mean-field Ising models, Combinatorial statistics and the sciences, Mutual information for the sparse stochastic block model, Phase transitions in semidefinite relaxations, Learning sparse graphons and the generalized Kesten-Stigum threshold, Step-by-step community detection in volume-regular graphs, Theoretical and computational guarantees of mean field variational inference for community detection, Recovering Structured Probability Matrices, Notes on computational-to-statistical gaps: predictions using statistical physics, Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding, The Lov\'asz Theta Function for Random Regular Graphs and Community Detection in the Hard Regime, Fluctuation results for general block spin Ising models, Unnamed Item, On semidefinite relaxations for the block model, Contiguity and non-reconstruction results for planted partition models: the dense case, Random Laplacian matrices and convex relaxations, Submatrix localization via message passing, Community Detection and Stochastic Block Models, Statistical inference on random dot product graphs: a survey, Estimating the number of communities by spectral methods, Information reconstruction on an infinite tree for a \(4\times 4\)-state asymmetric model with community effects, Optimization via low-rank approximation for community detection in networks, Community detection in sparse networks via Grothendieck's inequality, Community detection in degree-corrected block models, Fluctuations for block spin Ising models, Profile likelihood biclustering, Exact recovery in the Ising blockmodel, Large degree asymptotics and the reconstruction threshold of the asymmetric binary channels, Phase Transition of the Reconstructability of a General Model with Different In-Community and Out-Community Mutations on an Infinite Tree, Matrix estimation by universal singular value thresholding, Consistency of spectral clustering in stochastic block models, Unnamed Item, The Ising Antiferromagnet and Max Cut on Random Regular Graphs, Global and individualized community detection in inhomogeneous multilayer networks, Broadcasting on random recursive trees
