{"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/3","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":3,"pages_in_order":4,"rows_per_page":100,"rows":[201,300],"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/2","next":"/task/stochastic-block-model/papers/4","papers":[{"url":null,"slug":"streaming-belief-propagation-for-community","title":"Streaming Belief Propagation for Community Detection","date":"2021-06-09","arxiv_id":"2106.04805","repositories_listed":0,"syntology":null},{"url":null,"slug":"inferring-community-characteristics-in","title":"The Feature-First Block Model","date":"2021-05-28","arxiv_id":"2105.13762","repositories_listed":0,"syntology":null},{"url":null,"slug":"hypothesis-testing-for-equality-of-latent","title":"Hypothesis Testing for Equality of Latent Positions in Random Graphs","date":"2021-05-23","arxiv_id":"2105.10838","repositories_listed":0,"syntology":null},{"url":null,"slug":"exact-recovery-in-the-general-hypergraph","title":"Exact Recovery in the General Hypergraph Stochastic Block Model","date":"2021-05-11","arxiv_id":"2105.04770","repositories_listed":0,"syntology":null},{"url":null,"slug":"protecting-individual-interests-across","title":"Consistency of Constrained Spectral Clustering under Graph Induced Fair Planted Partitions","date":"2021-05-08","arxiv_id":"2105.03714","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-clustering-under-the-degree","title":"Spectral clustering under degree heterogeneity: a case for the random walk Laplacian","date":"2021-05-03","arxiv_id":"2105.00987","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-class-of-network-models-recoverable-by-1","title":"A class of network models recoverable by spectral clustering","date":"2021-04-21","arxiv_id":"2104.10347","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-multilayer-graphs-with-missing","title":"Clustering multilayer graphs with missing nodes","date":"2021-03-04","arxiv_id":"2103.03235","repositories_listed":0,"syntology":null},{"url":null,"slug":"alma-alternating-minimization-algorithm-for","title":"ALMA: Alternating Minimization Algorithm for Clustering Mixture Multilayer Network","date":"2021-02-20","arxiv_id":"2102.10226","repositories_listed":0,"syntology":null},{"url":null,"slug":"community-detection-exact-recovery-in","title":"Community Detection: Exact Recovery in Weighted Graphs","date":"2021-02-08","arxiv_id":"2102.04439","repositories_listed":0,"syntology":null},{"url":null,"slug":"community-detection-with-a-subsampled","title":"Community Detection with a Subsampled Semidefinite Program","date":"2021-02-02","arxiv_id":"2102.01419","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-theoretic-limits-of-exact","title":"Information Theoretic Limits of Exact Recovery in Sub-hypergraph Models for Community Detection","date":"2021-01-29","arxiv_id":"2101.12369","repositories_listed":0,"syntology":null},{"url":null,"slug":"vem-gcn-topology-optimization-with","title":"VEM-GCN: Topology Optimization with Variational EM for Graph Convolutional Networks","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-power-of-louvain-in-the-stochastic","title":"On the Power of Louvain in the Stochastic Block Model","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"contextual-stochastic-block-model-sharp","title":"Contextual Stochastic Block Model: Sharp Thresholds and Contiguity","date":"2020-11-15","arxiv_id":"2011.09841","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-improved-spectral-clustering-method-for","title":"An improved spectral clustering method for community detection under the degree-corrected stochastic blockmodel","date":"2020-11-12","arxiv_id":"2011.06374","repositories_listed":0,"syntology":null},{"url":null,"slug":"dual-regularized-laplacian-spectral","title":"Dual regularized Laplacian spectral clustering methods on community detection","date":"2020-11-09","arxiv_id":"2011.04392","repositories_listed":0,"syntology":null},{"url":null,"slug":"robustness-of-community-detection-to-random","title":"Robustness of Community Detection to Random Geometric Perturbations","date":"2020-11-09","arxiv_id":"2011.04298","repositories_listed":0,"syntology":null},{"url":null,"slug":"regularized-spectral-methods-for-clustering","title":"Regularized spectral methods for clustering signed networks","date":"2020-11-03","arxiv_id":"2011.01737","repositories_listed":0,"syntology":null},{"url":null,"slug":"sketch-based-community-detection-in-evolving","title":"Sketch-based community detection in evolving networks","date":"2020-09-24","arxiv_id":"2009.11835","repositories_listed":0,"syntology":null},{"url":null,"slug":"nondiagonal-mixture-of-dirichlet-network","title":"Nondiagonal Mixture of Dirichlet Network Distributions for Analyzing a Stock Ownership Network","date":"2020-09-08","arxiv_id":"2009.04446","repositories_listed":0,"syntology":null},{"url":null,"slug":"estimation-in-tensor-ising-models","title":"Estimation in Tensor Ising Models","date":"2020-08-29","arxiv_id":"2008.12882","repositories_listed":0,"syntology":null},{"url":null,"slug":"community-models-for-partially-observed","title":"Community models for networks observed through edge nominations","date":"2020-08-09","arxiv_id":"2008.03652","repositories_listed":0,"syntology":null},{"url":null,"slug":"fractal-gaussian-networks-a-sparse-random","title":"Fractal Gaussian Networks: A sparse random graph model based on Gaussian Multiplicative Chaos","date":"2020-08-07","arxiv_id":"2008.03038","repositories_listed":0,"syntology":null},{"url":null,"slug":"tractably-modelling-dependence-in-networks","title":"Tractably Modelling Dependence in Networks Beyond Exchangeability","date":"2020-07-28","arxiv_id":"2007.14365","repositories_listed":0,"syntology":null},{"url":null,"slug":"scaling-graph-clustering-with-distributed","title":"Scaling Graph Clustering with Distributed Sketches","date":"2020-07-24","arxiv_id":"2007.12669","repositories_listed":0,"syntology":null},{"url":null,"slug":"estimation-of-dense-stochastic-block-models","title":"Estimation of dense stochastic block models visited by random walks","date":"2020-06-14","arxiv_id":"2006.08010","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-theoretic-limits-for-the-matrix","title":"Information-Theoretic Limits for the Matrix Tensor Product","date":"2020-05-22","arxiv_id":"2005.11273","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-stochastic-block-model-scalable","title":"Neural Stochastic Block Model & Scalable Community-Based Graph Learning","date":"2020-05-16","arxiv_id":"2005.07855","repositories_listed":0,"syntology":null},{"url":null,"slug":"consistency-of-spectral-clustering-on","title":"Consistency of Spectral Clustering on Hierarchical Stochastic Block Models","date":"2020-04-30","arxiv_id":"2004.14531","repositories_listed":0,"syntology":null},{"url":null,"slug":"strong-consistency-graph-laplacians-and-the","title":"Strong Consistency, Graph Laplacians, and the Stochastic Block Model","date":"2020-04-21","arxiv_id":"2004.09780","repositories_listed":0,"syntology":null},{"url":null,"slug":"exact-recovery-and-sharp-thresholds-of","title":"Exact recovery and sharp thresholds of Stochastic Ising Block Model","date":"2020-04-13","arxiv_id":"2004.05944","repositories_listed":0,"syntology":null},{"url":null,"slug":"detecting-dynamic-community-structure-in","title":"Detecting Dynamic Community Structure in Functional Brain Networks Across Individuals: A Multilayer Approach","date":"2020-04-09","arxiv_id":"2004.04362","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-spectral-clustering-using-lasso","title":"Robust spectral clustering using LASSO regularization","date":"2020-04-08","arxiv_id":"2004.03845","repositories_listed":0,"syntology":null},{"url":null,"slug":"hypergraph-clustering-in-the-weighted","title":"Robust Hypergraph Clustering via Convex Relaxation of Truncated MLE","date":"2020-03-23","arxiv_id":"2003.10038","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-backtracking-walks-reveal-compartments-in","title":"Non-backtracking walks reveal compartments in sparse chromatin interaction networks","date":"2020-03-22","arxiv_id":"2003.09949","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-clustering-revisited-information","title":"Spectral Clustering Revisited: Information Hidden in the Fiedler Vector","date":"2020-03-22","arxiv_id":"2003.09969","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-regularity-and-conditioning-of-low","title":"On the simplicity and conditioning of low rank semidefinite programs","date":"2020-02-25","arxiv_id":"2002.10673","repositories_listed":0,"syntology":null},{"url":null,"slug":"smoothing-graphons-for-modelling-exchangeable","title":"Smoothing Graphons for Modelling Exchangeable Relational Data","date":"2020-02-25","arxiv_id":"2002.11159","repositories_listed":0,"syntology":null},{"url":null,"slug":"community-detection-on-mixture-multi-layer","title":"Community Detection on Mixture Multi-layer Networks via Regularized Tensor Decomposition","date":"2020-02-10","arxiv_id":"2002.04457","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-and-smooth-improved-guarantees-for","title":"Sparse and Smooth: improved guarantees for Spectral Clustering in the Dynamic Stochastic Block Model","date":"2020-02-07","arxiv_id":"2002.02892","repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-inference-in-heterogeneous-block","title":"The Hierarchy of Block Models","date":"2020-02-07","arxiv_id":"2002.02610","repositories_listed":0,"syntology":null},{"url":null,"slug":"randomized-spectral-clustering-in-large-scale","title":"Randomized Spectral Clustering in Large-Scale Stochastic Block Models","date":"2020-01-20","arxiv_id":"2002.00839","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-nearly-linear-time-algorithm-for-exact","title":"A Nearly-Linear Time Algorithm for Exact Community Recovery in Stochastic Block Model","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"community-detection-and-matrix-completion","title":"Community Detection and Matrix Completion with Social and Item Similarity Graphs","date":"2019-12-06","arxiv_id":"1912.04099","repositories_listed":0,"syntology":null},{"url":null,"slug":"active-learning-in-the-geometric-block-model","title":"Active learning in the geometric block model","date":"2019-11-15","arxiv_id":"1912.06570","repositories_listed":0,"syntology":null},{"url":null,"slug":"phase-transitions-and-optimal-algorithms-in-1","title":"Phase transitions and optimal algorithms for semi-supervised classifications on graphs: from belief propagation to graph convolution network","date":"2019-11-01","arxiv_id":"1911.00197","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-matrix-means-for-semi-supervised","title":"Generalized Matrix Means for Semi-Supervised Learning with Multilayer Graphs","date":"2019-10-30","arxiv_id":"1910.13951","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-clustering-in-the-weighted","title":"Spectral embedding of weighted graphs","date":"2019-10-12","arxiv_id":"1910.05534","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-popularity-adjusted-stochastic-block","title":"Sparse Popularity Adjusted Stochastic Block Model","date":"2019-10-03","arxiv_id":"1910.01931","repositories_listed":0,"syntology":null},{"url":null,"slug":"limit-theorems-for-out-of-sample-extensions","title":"Limit theorems for out-of-sample extensions of the adjacency and Laplacian spectral embeddings","date":"2019-09-29","arxiv_id":"1910.00423","repositories_listed":0,"syntology":null},{"url":null,"slug":"community-detection-and-improved","title":"Community Detection and Improved Detectability in Multiplex Networks","date":"2019-09-23","arxiv_id":"1909.10477","repositories_listed":0,"syntology":null},{"url":null,"slug":"regular-partitions-and-their-use-in","title":"Regular Partitions and Their Use in Structural Pattern Recognition","date":"2019-09-16","arxiv_id":"1909.07420","repositories_listed":0,"syntology":null},{"url":null,"slug":"hermitian-matrices-for-clustering-directed","title":"Hermitian matrices for clustering directed graphs: insights and applications","date":"2019-08-06","arxiv_id":"1908.02096","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-non-tightness-of-the-reconstruction","title":"The non-tightness of the reconstruction threshold of a 4 states symmetric model with different in-block and out-block mutations","date":"2019-06-22","arxiv_id":"1906.09479","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-degree-corrected-stochastic-block","title":"Clustering Degree-Corrected Stochastic Block Model with Outliers","date":"2019-06-07","arxiv_id":"1906.03305","repositories_listed":0,"syntology":null},{"url":null,"slug":"vertex-classification-on-weighted-networks","title":"Vertex Classification on Weighted Networks","date":"2019-06-07","arxiv_id":"1906.02881","repositories_listed":0,"syntology":null},{"url":null,"slug":"blind-identification-of-stochastic-block","title":"Blind identification of stochastic block models from dynamical observations","date":"2019-05-22","arxiv_id":"1905.09107","repositories_listed":0,"syntology":null},{"url":null,"slug":"pair-matching-when-bandits-meet-stochastic","title":"Pair-Matching: Links Prediction with Adaptive Queries","date":"2019-05-17","arxiv_id":"1905.07342","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-clustering-of-signed-graphs-via","title":"Spectral Clustering of Signed Graphs via Matrix Power Means","date":"2019-05-15","arxiv_id":"1905.06230","repositories_listed":0,"syntology":null},{"url":null,"slug":"190412986","title":"Community Detection and Growth Potential Prediction Using the Stochastic Block Model and the Long Short-term Memory from Patent Citation Networks","date":"2019-04-23","arxiv_id":"1904.12986","repositories_listed":0,"syntology":null},{"url":null,"slug":"achieving-the-bayes-error-rate-in","title":"Achieving the Bayes Error Rate in Synchronization and Block Models by SDP, Robustly","date":"2019-04-21","arxiv_id":"1904.09635","repositories_listed":0,"syntology":null},{"url":null,"slug":"community-detection-in-the-sparse-hypergraph","title":"Community detection in the sparse hypergraph stochastic block model","date":"2019-04-11","arxiv_id":"1904.05981","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimized-deformed-laplacian-for-spectrum","title":"Revisiting the Bethe-Hessian: Improved Community Detection in Sparse Heterogeneous Graphs","date":"2019-01-25","arxiv_id":"1901.09715","repositories_listed":0,"syntology":null},{"url":null,"slug":"higher-order-spectral-clustering-under","title":"Higher-Order Spectral Clustering under Superimposed Stochastic Block Model","date":"2018-12-16","arxiv_id":"1812.06515","repositories_listed":0,"syntology":null},{"url":null,"slug":"change-point-estimation-in-a-dynamic","title":"Change Point Estimation in a Dynamic Stochastic Block Model","date":"2018-12-07","arxiv_id":"1812.03090","repositories_listed":0,"syntology":null},{"url":null,"slug":"testing-changes-in-communities-for-the","title":"Testing Changes in Communities for the Stochastic Block Model","date":"2018-11-29","arxiv_id":"1812.00769","repositories_listed":0,"syntology":null},{"url":null,"slug":"exact-recovery-in-the-hypergraph-stochastic","title":"Exact Recovery in the Hypergraph Stochastic Block Model: a Spectral Algorithm","date":"2018-11-16","arxiv_id":"1811.06931","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-community-detection-by-recursive","title":"Hierarchical community detection by recursive partitioning","date":"2018-10-02","arxiv_id":"1810.01509","repositories_listed":0,"syntology":null},{"url":null,"slug":"partial-recovery-bounds-for-clustering-with","title":"Partial recovery bounds for clustering with the relaxed $K$means","date":"2018-07-19","arxiv_id":"1807.07547","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-likelihood-ratio-type-test-for-stochastic","title":"A likelihood-ratio type test for stochastic block models with bounded degrees","date":"2018-07-12","arxiv_id":"1807.04426","repositories_listed":0,"syntology":null},{"url":null,"slug":"pairwise-covariates-adjusted-block-model-for","title":"Pairwise Covariates-adjusted Block Model for Community Detection","date":"2018-07-10","arxiv_id":"1807.03469","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-block-model-for-hypergraphs","title":"Stochastic Block Model for Hypergraphs: Statistical limits and a semidefinite programming approach","date":"2018-07-08","arxiv_id":"1807.02884","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-inference-in-stochastic-block","title":"Efficient inference in stochastic block models with vertex labels","date":"2018-06-20","arxiv_id":"1806.07562","repositories_listed":0,"syntology":null},{"url":null,"slug":"universality-of-the-stochastic-block-model","title":"Universality of the stochastic block model","date":"2018-06-11","arxiv_id":"1806.04214","repositories_listed":0,"syntology":null},{"url":null,"slug":"gradient-coding-via-the-stochastic-block","title":"Gradient Coding via the Stochastic Block Model","date":"2018-05-25","arxiv_id":"1805.10378","repositories_listed":0,"syntology":null},{"url":null,"slug":"randomized-robust-matrix-completion-for-the","title":"Scalable and Robust Community Detection with Randomized Sketching","date":"2018-05-25","arxiv_id":"1805.10927","repositories_listed":0,"syntology":null},{"url":null,"slug":"hypergraph-spectral-clustering-in-the","title":"Hypergraph Spectral Clustering in the Weighted Stochastic Block Model","date":"2018-05-23","arxiv_id":"1805.08956","repositories_listed":0,"syntology":null},{"url":null,"slug":"connectivity-in-random-annulus-graphs-and-the","title":"Connectivity in Random Annulus Graphs and the Geometric Block Model","date":"2018-04-12","arxiv_id":"1804.05013","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-bipartite-network-clustering","title":"Optimal Bipartite Network Clustering","date":"2018-03-15","arxiv_id":"1803.06031","repositories_listed":0,"syntology":null},{"url":null,"slug":"analysis-of-spectral-clustering-algorithms","title":"Analysis of spectral clustering algorithms for community detection: the general bipartite setting","date":"2018-03-12","arxiv_id":"1803.04547","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-block-models-with-multiple","title":"Stochastic Block Models with Multiple Continuous Attributes","date":"2018-03-07","arxiv_id":"1803.02726","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-theoretic-limits-for-community","title":"Information-theoretic Limits for Community Detection in Network Models","date":"2018-02-16","arxiv_id":"1802.06104","repositories_listed":0,"syntology":null},{"url":null,"slug":"vertex-nomination-the-canonical-sampling-and","title":"Vertex nomination: The canonical sampling and the extended spectral nomination schemes","date":"2018-02-14","arxiv_id":"1802.04960","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-minimax-misclassification-ratio-of","title":"On the Minimax Misclassification Ratio of Hypergraph Community Detection","date":"2018-02-03","arxiv_id":"1802.00926","repositories_listed":0,"syntology":null},{"url":null,"slug":"active-community-detection-a-maximum","title":"Active Community Detection with Maximal Expected Model Change","date":"2018-01-11","arxiv_id":"1801.05856","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-which-world-is-your-graph-1","title":"From which world is your graph","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-block-point-process-model-for-continuous","title":"The Block Point Process Model for Continuous-Time Event-Based Dynamic Networks","date":"2017-11-29","arxiv_id":"1711.10967","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-and-reliable-inference-algorithm-for","title":"Fast and reliable inference algorithm for hierarchical stochastic block models","date":"2017-11-14","arxiv_id":"1711.05150","repositories_listed":0,"syntology":null},{"url":null,"slug":"theoretical-and-computational-guarantees-of","title":"Theoretical and Computational Guarantees of Mean Field Variational Inference for Community Detection","date":"2017-10-30","arxiv_id":"1710.11268","repositories_listed":0,"syntology":null},{"url":null,"slug":"algorithmic-detectability-threshold-of-the","title":"Algorithmic detectability threshold of the stochastic block model","date":"2017-10-24","arxiv_id":"1710.08841","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-estimation-from-few-samples","title":"Bayesian estimation from few samples: community detection and related problems","date":"2017-09-30","arxiv_id":"1710.00264","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-statistical-interpretation-of-spectral","title":"A statistical interpretation of spectral embedding: the generalised random dot product graph","date":"2017-09-16","arxiv_id":"1709.05506","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-geometric-block-model","title":"The Geometric Block Model","date":"2017-09-16","arxiv_id":"1709.05510","repositories_listed":0,"syntology":null},{"url":null,"slug":"rates-of-convergence-of-spectral-methods-for","title":"Rates of Convergence of Spectral Methods for Graphon Estimation","date":"2017-09-10","arxiv_id":"1709.03183","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-compressive-sensing-approach-to-community","title":"A Compressive Sensing Approach to Community Detection with Applications","date":"2017-08-30","arxiv_id":"1708.09477","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-ensemble-framework-for-detecting-community","title":"An Ensemble Framework for Detecting Community Changes in Dynamic Networks","date":"2017-07-24","arxiv_id":"1708.08136","repositories_listed":0,"syntology":null},{"url":null,"slug":"query-complexity-of-clustering-with-side","title":"Query Complexity of Clustering with Side Information","date":"2017-06-23","arxiv_id":"1706.07719","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-with-noisy-queries","title":"Clustering with Noisy Queries","date":"2017-06-22","arxiv_id":"1706.07510","repositories_listed":0,"syntology":null},{"url":null,"slug":"exponential-error-rates-of-sdp-for-block","title":"Exponential error rates of SDP for block models: Beyond Grothendieck's inequality","date":"2017-05-23","arxiv_id":"1705.08391","repositories_listed":0,"syntology":null}],"record_sha256":"06d7c5010492bacdea7e6c104a846b555c1e43616738d545e9ec08abeabc492a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}