Consistency Thresholds for Binary Symmetric Block Models

No abstract is available for this paper.

• Publication year

  2014

• Venue

  arXiv.org

• Publication date

  2014-07-07

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Exact Recovery in the Stochastic Block Model

  2014cited by this paper
• Belief propagation, robust reconstruction and optimal recovery of block models

  2013cited by this paper
• Graph spectra and the detectability of community structure in networks

  2012cited by this paper
• Stochastic Block Models and Reconstruction

  2012cited by this paper
• Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications

  2011cited by this paper
• A nonparametric view of network models and Newman–Girvan and other modularities

  2009cited by this paper
• ON THE STRENGTH OF CONNECTEDNESS OF A RANDOM GRAPH

  2001cited by this paper
• Spectral partitioning of random graphs

  2001cited by this paper
• Algorithms for graph partitioning on the planted partition model

  1999cited by this paper
• The Metropolis Algorithm for Graph Bisection

  1998cited by this paper
• Estimation and Prediction for Stochastic Blockmodels for Graphs with Latent Block Structure

  1997cited by this paper
• The Solution of Some Random NP-Hard Problems in Polynomial Expected Time

  1989cited by this paper
• Graph bisection algorithms with good average case behavior

  1984cited by this paper
• Stochastic blockmodels: First steps

  1983cited by this paper

• Information Limits of Joint Community Detection and Finite Group Synchronization

  2026cites this paper
• Computational Lower Bounds for Graphon Estimation via Low-degree Polynomials

  2023cites this paper
• A Neural Collapse Perspective on Feature Evolution in Graph Neural Networks

  2023cites this paper
• Goodness-of-Fit of Attributed Probabilistic Graph Generative Models

  2023cites this paper
• PageRank Nibble on the Sparse Directed Stochastic Block Model

  2023cites this paper
• Spectral clustering in the Gaussian mixture block model

  2023cites this paper
• Exact Community Recovery over Signed Graphs

  2022influential citation
• Consensus on Dynamic Stochastic Block Models: Fast Convergence and Phase Transitions

  2022cites this paper
• Válasz Dr. Kertész János „A Function-Structure Approach to Complex Networks” című, Gulyás András által az MTA doktora cím elnyerése céljából benyújtott értekezésről adott bírálatára

  2021cites this paper
• Subspace Estimation from Unbalanced and Incomplete Data Matrices: 𝓁2, ∞ Statistical Guarantees

  2021cites this paper
• Graph Community Detection from Coarse Measurements: Recovery Conditions for the Coarsened Weighted Stochastic Block Model

  2021cites this paper
• Optimal Non-Convex Exact Recovery in Stochastic Block Model via Projected Power Method

  2021cites this paper
• On Variational Inference in Biclustering Models

  2021cites this paper
• Correlation Clustering Reconstruction in Semi-Adversarial Models

  2021cites this paper
• A Useful Criterion on Studying Consistent Estimation in Community Detection

  2021cites this paper
• Spectral Robustness for Correlation Clustering Reconstruction in Semi-Adversarial Models

  2021cites this paper
• Community Detection in Social Networks: Multilayer Networks and Pairwise Covariates

  2020cites this paper
• Adjusted chi-square test for degree-corrected block models

  2020cites this paper
• Amortized Probabilistic Detection of Communities in Graphs

  2020cites this paper
• Detecting Latent Communities in Network Formation Models

  2020cites this paper
• Non-convex exact community recovery in stochastic block model

  2020cites this paper
• A Nearly-Linear Time Algorithm for Exact Community Recovery in Stochastic Block Model

  2020influential citation
• The Ising antiferromagnet and max cut on random regular graphs

  2020cites this paper
• Attentive Clustering Processes

  2020cites this paper
• O ct 2 01 9 Subspace Estimation from Unbalanced and Incomplete Data Matrices : l 2 , ∞ Statistical Guarantees

  2019cites this paper
• Essays on the Economics of Networks

  2019cites this paper
• Subspace Estimation from Unbalanced and Incomplete Data Matrices: $\ell_{2,\infty}$ Statistical Guarantees.

  2019cites this paper
• Unified $\ell_{2\rightarrow\infty}$ Eigenspace Perturbation Theory for Symmetric Random Matrices

  2019cites this paper
• Iterative algorithm for discrete structure recovery

  2019cites this paper
• L G ] 6 F eb 2 01 8 Recovering Structured Probability Matrices

  2018cites this paper
• CONCENTRATION OF RANDOM GRAPHS AND APPLICATION TO COMMUNITY DETECTION

  2018cites this paper
• Minimax Rates in Network Analysis: Graphon Estimation, Community Detection and Hypothesis Testing

  2018influential citation
• Hypergraph Spectral Clustering in the Weighted Stochastic Block Model

  2018cites this paper
• Proof of the Achievability Conjectures for the General Stochastic Block Model

  2018cites this paper
• Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure

  2018cites this paper
• Optimal rates for community estimation in the weighted stochastic block model

  2017cites this paper
• Inferring the Ideological Affiliations of Political Committees Via Financial Contributions Networks

  2017cites this paper
• Community Recovery in Hypergraphs

  2017cites this paper
• Testing Network Structure Using Relations Between Small Subgraph Probabilities

  2017cites this paper
• Community detection and stochastic block models: recent developments

  2017cites this paper
• Minerva: an alignment- and reference-free approach to deconvolve Linked-Reads for metagenomics

  2017cites this paper
• Spectral analysis in bipartite biregular graphs and community detection

  2017influential citation
• ENTRYWISE EIGENVECTOR ANALYSIS OF RANDOM MATRICES WITH LOW EXPECTED RANK.

  2017cites this paper
• Topics in Graph Clustering

  2017cites this paper
• Strong Consistency of Spectral Clustering for Stochastic Block Models

  2017cites this paper
• Estimating Community Structure in Networks by Spectral Methods

  2016cites this paper
• Recovering Structured Probability Matrices

  2016cites this paper
• Clustering Via Crowdsourcing

  2016cites this paper
• Statistical Network Analysis: Beyond Block Models.

  2016influential citation
• The Projected Power Method: An Efficient Algorithm for Joint Alignment from Pairwise Differences

  2016cites this paper
• A variant of the spectral clustering method using l1 -penalty to promote sparse eigenvectors basis

  2016cites this paper
• On the Simultaneous Preservation of Privacy and Community Structure in Anonymized Networks

  2016cites this paper
• Benchmarking recovery theorems for the DC-SBM

  2016cites this paper
• Community detection and the stochastic block model

  2016cites this paper
• PECOK: a convex optimization approach to variable clustering

  2016cites this paper
• Asymptotic mutual information for the balanced binary stochastic block model

  2016cites this paper
• Asymptotic mutual information for the binary stochastic block model

  2016cites this paper
• Clustering with an oracle

  2016cites this paper
• Title Concentration and regularization of random graphs Permalink

  2016cites this paper
• Community Detection in Degree-Corrected Block Models

  2016cites this paper
• Statistical inference for structural models in high dimension. Sparse generalized linear models, PLS through orthogonal polynomials and community detection in graphs

  2015cites this paper
• Optimal Cluster Recovery in the Labeled Stochastic Block Model

  2015cites this paper
• Recovering communities in weighted stochastic block models

  2015influential citation
• Information-theoretic bounds for exact recovery in weighted stochastic block models using the Renyi divergence

  2015influential citation
• Achieving Optimal Misclassification Proportion in Stochastic Block Models

  2015cites this paper
• Detection in the stochastic block model with multiple clusters: proof of the achievability conjectures, acyclic BP, and the information-computation gap

  2015cites this paper
• Stochastic Block Model and Community Detection in Sparse Graphs: A spectral algorithm with optimal rate of recovery

  2015cites this paper
• Local Algorithms for Block Models with Side Information

  2015cites this paper
• Concentration and regularization of random graphs

  2015cites this paper
• Community detection in general stochastic block models: fundamental limits and efficient recovery algorithms

  2015cites this paper
• Recovering Communities in the General Stochastic Block Model Without Knowing the Parameters

  2015cites this paper
• Minimax Rates of Community Detection in Stochastic Block Models

  2015influential citation
• Multisection in the Stochastic Block Model using Semidefinite Programming

  2015cites this paper
• Asymptotic Mutual Information for the Two-Groups Stochastic Block Model

  2015cites this paper
• Sparse random graphs: regularization and concentration of the Laplacian

  2015cites this paper
• Community Detection in General Stochastic Block models: Fundamental Limits and Efficient Algorithms for Recovery

  2015cites this paper
• Recovery and Rigidity in a Regular Stochastic Block Model

  2015influential citation
• Achieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions

  2015cites this paper
• Information recovery from pairwise measurements: A shannon-theoretic approach

  2015cites this paper
• Relative Density and Exact Recovery in Heterogeneous Stochastic Block Models

  2015cites this paper
• MODEL ASSISTED VARIABLE CLUSTERING: MINIMAX-OPTIMAL RECOVERY AND ALGORITHMS.

  2015cites this paper
• Consistent community detection in multi-relational data through restricted multi-layer stochastic blockmodel

  2015influential citation
• Information Recovery From Pairwise Measurements

  2015influential citation
• Achieving exact cluster recovery threshold via semidefinite programming

  2015cites this paper
• A Generic Sample Splitting Approach for Refined Community Recovery in Stochastic Block Models

  2014cites this paper
• Statistical inference in networks: fundamental limits and efficient algorithms

  2014cites this paper
• On semidefinite relaxations for the block model

  2014cites this paper
• Accurate Community Detection in the Stochastic Block Model via Spectral Algorithms

  2014cites this paper
• Rate-optimal graphon estimation

  2014cites this paper
• Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices

  2014cites this paper
• Relax, No Need to Round: Integrality of Clustering Formulations

  2014cites this paper
• Exact Recovery in the Stochastic Block Model

  2014cites this paper
• Achieving Exact Cluster Recovery Threshold via Semidefinite Programming

  2014cites this paper
• Computational Lower Bounds for Community Detection on Random Graphs

  2014cites this paper
• Detecting Overlapping Communities in Networks Using Spectral Methods

  2014influential citation
• Perfect Clustering for Stochastic Blockmodel Graphs via Adjacency Spectral Embedding

  2013cites this paper
• Strong Consistency with Limited Information for the Binary Hypergraph Stochastic Block Model

  year unknowncites this paper
• Title Sparse random graphs : regularization and concentration of the Laplacian Permalink

  year unknowncites this paper