{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/stochastic-block-model/papers/4","list_of":"/task/stochastic-block-model","task":"Stochastic Block Model","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":4,"pages_in_order":4,"rows_per_page":100,"rows":[301,370],"of":370,"counts":{"archive_papers_tagged":370,"with_a_code_link":95,"where_syntology_ran_a_sample":14,"not_listed_spam_title":0,"listed":370,"listed_where_code_ran":14,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":11,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":11,"listed_every_run_a_failure_of_syntologys_instrument":3,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/stochastic-block-model","prev":"/task/stochastic-block-model/papers/3","next":null,"papers":[{"url":null,"slug":"k-sets-a-linear-time-clustering-algorithm-for","title":"K-sets+: a Linear-time Clustering Algorithm for Data Points with a Sparse Similarity Measure","date":"2017-05-11","arxiv_id":"1705.04249","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-clustering-in-the-dynamic-stochastic","title":"Spectral clustering in the dynamic stochastic block model","date":"2017-05-02","arxiv_id":"1705.01204","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-clustering-objective-functions","title":"Hierarchical Clustering: Objective Functions and Algorithms","date":"2017-04-07","arxiv_id":"1704.02147","repositories_listed":0,"syntology":null},{"url":null,"slug":"community-detection-and-stochastic-block","title":"Community Detection and Stochastic Block Models","date":"2017-03-29","arxiv_id":"1703.10146","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-sdps-for-synchronization-and-maxcut","title":"Solving SDPs for synchronization and MaxCut problems via the Grothendieck inequality","date":"2017-03-25","arxiv_id":"1703.08729","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-consistency-of-compressive-spectral","title":"On Consistency of Compressive Spectral Clustering","date":"2017-02-12","arxiv_id":"1702.03522","repositories_listed":0,"syntology":null},{"url":null,"slug":"achieving-the-ks-threshold-in-the-general","title":"Achieving the KS threshold in the general stochastic block model with linearized acyclic belief propagation","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"community-detection-on-evolving-graphs","title":"Community Detection on Evolving Graphs","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"exploiting-tradeoffs-for-exact-recovery-in","title":"Exploiting Tradeoffs for Exact Recovery in Heterogeneous Stochastic Block Models","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-clustering-block-models-and-model-free","title":"Graph Clustering: Block-models and model free results","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"estimating-the-size-of-a-large-network-and","title":"Estimating the Size of a Large Network and its Communities from a Random Sample","date":"2016-10-26","arxiv_id":"1610.08473","repositories_listed":0,"syntology":null},{"url":null,"slug":"algorithms-for-item-categorization-based-on","title":"Algorithms for item categorization based on ordinal ranking data","date":"2016-09-29","arxiv_id":"1609.09544","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-backtracking-spectrum-of-degree-corrected","title":"Non-Backtracking Spectrum of Degree-Corrected Stochastic Block Models","date":"2016-09-08","arxiv_id":"1609.02487","repositories_listed":0,"syntology":null},{"url":null,"slug":"community-detection-algorithm-combining","title":"Community Detection Algorithm Combining Stochastic Block Model and Attribute Data Clustering","date":"2016-07-21","arxiv_id":"1608.00920","repositories_listed":0,"syntology":null},{"url":null,"slug":"combining-random-walks-and-nonparametric","title":"Combining Random Walks and Nonparametric Bayesian Topic Model for Community Detection","date":"2016-07-19","arxiv_id":"1607.05573","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-consistency-of-the-likelihood","title":"On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching","date":"2016-07-05","arxiv_id":"1607.01369","repositories_listed":0,"syntology":null},{"url":null,"slug":"discovery-of-latent-factors-in-high","title":"Discovery of Latent Factors in High-dimensional Data Using Tensor Methods","date":"2016-06-10","arxiv_id":"1606.03212","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-model-selection-of-stochastic-block","title":"Bayesian Model Selection of Stochastic Block Models","date":"2016-05-23","arxiv_id":"1605.07057","repositories_listed":0,"syntology":null},{"url":null,"slug":"orthogonal-symmetric-non-negative-matrix","title":"Orthogonal symmetric non-negative matrix factorization under the stochastic block model","date":"2016-05-17","arxiv_id":"1605.05349","repositories_listed":0,"syntology":null},{"url":null,"slug":"exact-icl-maximization-in-a-non-stationary-1","title":"Exact ICL maximization in a non-stationary temporal extension of the stochastic block model for dynamic networks","date":"2016-05-09","arxiv_id":"1605.02540","repositories_listed":0,"syntology":null},{"url":null,"slug":"active-learning-for-community-detection-in","title":"Active Learning for Community Detection in Stochastic Block Models","date":"2016-05-08","arxiv_id":"1605.02372","repositories_listed":0,"syntology":null},{"url":null,"slug":"performance-of-a-community-detection","title":"Performance of a community detection algorithm based on semidefinite programming","date":"2016-03-30","arxiv_id":"1603.09045","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-simultaneous-preservation-of-privacy","title":"On the Simultaneous Preservation of Privacy and Community Structure in Anonymized Networks","date":"2016-03-25","arxiv_id":"1603.08028","repositories_listed":0,"syntology":null},{"url":null,"slug":"uniform-hypergraph-partitioning-provable","title":"Uniform Hypergraph Partitioning: Provable Tensor Methods and Sampling Techniques","date":"2016-02-21","arxiv_id":"1602.06516","repositories_listed":0,"syntology":null},{"url":null,"slug":"semidefinite-programs-for-exact-recovery-of-a","title":"Semidefinite Programs for Exact Recovery of a Hidden Community","date":"2016-02-20","arxiv_id":"1602.06410","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-tractable-fully-bayesian-method-for-the","title":"A Tractable Fully Bayesian Method for the Stochastic Block Model","date":"2016-02-06","arxiv_id":"1602.02256","repositories_listed":0,"syntology":null},{"url":null,"slug":"partial-recovery-bounds-for-the-sparse","title":"Partial Recovery Bounds for the Sparse Stochastic Block Model","date":"2016-02-02","arxiv_id":"1602.00877","repositories_listed":0,"syntology":null},{"url":null,"slug":"detection-in-the-stochastic-block-model-with","title":"Detection in the stochastic block model with multiple clusters: proof of the achievability conjectures, acyclic BP, and the information-computation gap","date":"2015-12-30","arxiv_id":"1512.09080","repositories_listed":0,"syntology":null},{"url":null,"slug":"convexified-modularity-maximization-for","title":"Convexified Modularity Maximization for Degree-corrected Stochastic Block Models","date":"2015-12-28","arxiv_id":"1512.08425","repositories_listed":0,"syntology":null},{"url":null,"slug":"relative-density-and-exact-recovery-in","title":"Relative Density and Exact Recovery in Heterogeneous Stochastic Block Models","date":"2015-12-15","arxiv_id":"1512.04937","repositories_listed":0,"syntology":null},{"url":null,"slug":"community-detection-via-measure-space","title":"Community Detection via Measure Space Embedding","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"disentangling-bipartite-and-core-periphery","title":"Disentangling bipartite and core-periphery structure in financial networks","date":"2015-11-25","arxiv_id":"1511.08830","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-communities-in-the-presence-of","title":"Learning Communities in the Presence of Errors","date":"2015-11-10","arxiv_id":"1511.03229","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-robust-are-reconstruction-thresholds-for","title":"How Robust are Reconstruction Thresholds for Community Detection?","date":"2015-11-04","arxiv_id":"1511.01473","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-impossibility-result-for-reconstruction-in","title":"An Impossibility Result for Reconstruction in a Degree-Corrected Planted-Partition Model","date":"2015-11-02","arxiv_id":"1511.00546","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-cluster-recovery-in-the-labeled","title":"Optimal Cluster Recovery in the Labeled Stochastic Block Model","date":"2015-10-20","arxiv_id":"1510.05956","repositories_listed":0,"syntology":null},{"url":null,"slug":"recovering-a-hidden-community-beyond-the","title":"Recovering a Hidden Community Beyond the Kesten-Stigum Threshold in $O(|E| \\log^*|V|)$ Time","date":"2015-10-09","arxiv_id":"1510.02786","repositories_listed":0,"syntology":null},{"url":null,"slug":"density-evolution-in-the-degree-correlated","title":"Density Evolution in the Degree-correlated Stochastic Block Model","date":"2015-09-10","arxiv_id":"1509.03281","repositories_listed":0,"syntology":null},{"url":null,"slug":"modelling-time-evolving-interactions-in","title":"Modelling time evolving interactions in networks through a non stationary extension of stochastic block models","date":"2015-09-08","arxiv_id":"1509.02347","repositories_listed":0,"syntology":null},{"url":null,"slug":"local-algorithms-for-block-models-with-side","title":"Local Algorithms for Block Models with Side Information","date":"2015-08-10","arxiv_id":"1508.02344","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-semidefinite-program-for-unbalanced","title":"A semidefinite program for unbalanced multisection in the stochastic block model","date":"2015-07-20","arxiv_id":"1507.05605","repositories_listed":0,"syntology":null},{"url":null,"slug":"multisection-in-the-stochastic-block-model","title":"Multisection in the Stochastic Block Model using Semidefinite Programming","date":"2015-07-08","arxiv_id":"1507.02323","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-network-layers-with-the-strata","title":"Clustering Network Layers With the Strata Multilayer Stochastic Block Model","date":"2015-07-07","arxiv_id":"1507.01826","repositories_listed":0,"syntology":null},{"url":null,"slug":"recovering-communities-in-the-general","title":"Recovering communities in the general stochastic block model without knowing the parameters","date":"2015-06-11","arxiv_id":"1506.03729","repositories_listed":0,"syntology":null},{"url":null,"slug":"community-detection-in-multi-relational-data","title":"Community detection in multi-relational data with restricted multi-layer stochastic blockmodel","date":"2015-06-08","arxiv_id":"1506.02699","repositories_listed":0,"syntology":null},{"url":null,"slug":"achieving-optimal-misclassification","title":"Achieving Optimal Misclassification Proportion in Stochastic Block Model","date":"2015-05-14","arxiv_id":"1505.03772","repositories_listed":0,"syntology":null},{"url":null,"slug":"consistency-of-spectral-hypergraph","title":"Consistency of Spectral Hypergraph Partitioning under Planted Partition Model","date":"2015-05-07","arxiv_id":"1505.01582","repositories_listed":0,"syntology":null},{"url":null,"slug":"overlapping-communities-detection-via-measure","title":"Overlapping Communities Detection via Measure Space Embedding","date":"2015-04-26","arxiv_id":"1504.06796","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-recovery-from-pairwise","title":"Information Recovery from Pairwise Measurements","date":"2015-04-06","arxiv_id":"1504.01369","repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-limits-of-convex-relaxations","title":"Statistical Limits of Convex Relaxations","date":"2015-03-04","arxiv_id":"1503.01442","repositories_listed":0,"syntology":null},{"url":null,"slug":"achieving-exact-cluster-recovery-threshold-1","title":"Achieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions","date":"2015-02-26","arxiv_id":"1502.07738","repositories_listed":0,"syntology":null},{"url":null,"slug":"reconstruction-in-the-labeled-stochastic","title":"Reconstruction in the Labeled Stochastic Block Model","date":"2015-02-11","arxiv_id":"1502.03365","repositories_listed":0,"syntology":null},{"url":null,"slug":"detecting-overlapping-communities-in-networks","title":"Detecting Overlapping Communities in Networks Using Spectral Methods","date":"2014-12-10","arxiv_id":"1412.3432","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-clustering-with-missing-data-convex","title":"Graph Clustering With Missing Data: Convex Algorithms and Analysis","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"achieving-exact-cluster-recovery-threshold","title":"Achieving Exact Cluster Recovery Threshold via Semidefinite Programming","date":"2014-11-24","arxiv_id":"1412.6156","repositories_listed":0,"syntology":null},{"url":null,"slug":"phase-transitions-in-semisupervised","title":"Phase transitions in semisupervised clustering of sparse networks","date":"2014-04-30","arxiv_id":"1404.7789","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-and-computationally-feasible-community","title":"Robust and computationally feasible community detection in the presence of arbitrary outlier nodes","date":"2014-04-23","arxiv_id":"1404.6000","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-latent-block-structure-in-weighted","title":"Learning Latent Block Structure in Weighted Networks","date":"2014-04-02","arxiv_id":"1404.0431","repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-computational-tradeoffs-in","title":"Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices","date":"2014-02-06","arxiv_id":"1402.1267","repositories_listed":0,"syntology":null},{"url":null,"slug":"vertex-nomination-schemes-for-membership","title":"Vertex nomination schemes for membership prediction","date":"2013-12-10","arxiv_id":"1312.2638","repositories_listed":0,"syntology":null},{"url":null,"slug":"impact-of-regularization-on-spectral","title":"Impact of regularization on Spectral Clustering","date":"2013-12-05","arxiv_id":"1312.1733","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-infinite-degree-corrected-stochastic","title":"The Infinite Degree Corrected Stochastic Block Model","date":"2013-11-11","arxiv_id":"1311.2520","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-redemption-clustering-sparse","title":"Spectral redemption: clustering sparse networks","date":"2013-06-24","arxiv_id":"1306.5550","repositories_listed":0,"syntology":null},{"url":null,"slug":"adapting-the-stochastic-block-model-to-edge","title":"Adapting the Stochastic Block Model to Edge-Weighted Networks","date":"2013-05-24","arxiv_id":"1305.5782","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-tensor-approach-to-learning-mixed","title":"A Tensor Approach to Learning Mixed Membership Community Models","date":"2013-02-12","arxiv_id":"1302.2684","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-sparse-graphs","title":"Clustering Sparse Graphs","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-graph-clustering","title":"Improved Graph Clustering","date":"2012-10-11","arxiv_id":"1210.3335","repositories_listed":0,"syntology":null},{"url":null,"slug":"model-selection-for-degree-corrected-block","title":"Model Selection for Degree-corrected Block Models","date":"2012-07-17","arxiv_id":"1207.3994","repositories_listed":0,"syntology":null},{"url":null,"slug":"pseudo-likelihood-methods-for-community","title":"Pseudo-likelihood methods for community detection in large sparse networks","date":"2012-07-10","arxiv_id":"1207.2340","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-partially-observed-graphs-via","title":"Clustering Partially Observed Graphs via Convex Optimization","date":"2011-04-25","arxiv_id":"1104.4803","repositories_listed":0,"syntology":null}],"record_sha256":"46d353c233bdeb4e7378020b5f301aad26a649d0b0d13f70c667293d5a471e4a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}