{"url":"/task/stochastic-block-model","name":"Stochastic Block Model","slug":"stochastic-block-model","description_markdown":null,"categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":370,"papers_with_code":95,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":30,"of":95,"tagged_in_all":370,"items":[{"url":"/paper/supervised-community-detection-with-line","title":"Supervised Community Detection with Line Graph Neural Networks","date":"2017-05-23","arxiv_id":"1705.08415","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/graph-encoder-embedding","title":"One-Hot Graph Encoder Embedding","date":"2021-09-27","arxiv_id":"2109.13098","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_unverified":0,"n_pointer_only":2}},{"url":"/paper/spectral-clustering-of-graphs-with-the-bethe","title":"Spectral Clustering of Graphs with the Bethe Hessian","date":"2014-06-07","arxiv_id":"1406.1880","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/graph-convolution-for-semi-supervised","title":"Graph Convolution for Semi-Supervised Classification: Improved Linear Separability and Out-of-Distribution Generalization","date":"2021-02-13","arxiv_id":"2102.06966","repositories_listed":2,"syntology":null},{"url":"/paper/latent-space-models-for-multiplex-networks","title":"Latent space models for multiplex networks with shared structure","date":"2020-12-28","arxiv_id":"2012.14409","repositories_listed":2,"syntology":null},{"url":"/paper/interpretable-clustering-on-dynamic-graphs","title":"Interpretable Clustering on Dynamic Graphs with Recurrent Graph Neural Networks","date":"2020-12-16","arxiv_id":"2012.08740","repositories_listed":2,"syntology":null},{"url":"/paper/community-detection-with-graph-neural","title":"Community Detection with Graph Neural Networks","date":"2018-10-25","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/partition-wise-graph-filtering-a-unified","title":"Partition-wise Graph Filtering: A Unified Perspective Through the Lens of Graph Coarsening","date":"2025-05-20","arxiv_id":"2505.14033","repositories_listed":1,"syntology":null},{"url":"/paper/community-and-hyperedge-inference-in-multiple","title":"Community and hyperedge inference in multiple hypergraphs","date":"2025-05-08","arxiv_id":"2505.04967","repositories_listed":1,"syntology":null},{"url":"/paper/communities-in-the-kuramoto-model-dynamics","title":"Communities in the Kuramoto Model: Dynamics and Detection via Path Signatures","date":"2025-03-21","arxiv_id":"2503.17546","repositories_listed":1,"syntology":null},{"url":"/paper/a-semidefinite-relaxation-approach-for-fair","title":"A Semidefinite Relaxation Approach for Fair Graph Clustering","date":"2024-10-19","arxiv_id":"2410.15233","repositories_listed":1,"syntology":null},{"url":"/paper/what-is-missing-in-homophily-disentangling","title":"What Is Missing In Homophily? Disentangling Graph Homophily For Graph Neural Networks","date":"2024-06-27","arxiv_id":"2406.18854","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/csa-trans-code-structure-aware-transformer","title":"CSA-Trans: Code Structure Aware Transformer for AST","date":"2024-04-07","arxiv_id":"2404.05767","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_unverified":0,"n_pointer_only":5}},{"url":"/paper/maximum-likelihood-estimation-on-stochastic","title":"Spectral Clustering for Directed Graphs via Likelihood Estimation on Stochastic Block Models","date":"2024-03-28","arxiv_id":"2403.19516","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-network-outputs-are-almost","title":"Almost Surely Asymptotically Constant Graph Neural Networks","date":"2024-03-06","arxiv_id":"2403.03880","repositories_listed":1,"syntology":null},{"url":"/paper/vec-sbm-optimal-community-detection-with","title":"VEC-SBM: Optimal Community Detection with Vectorial Edges Covariates","date":"2024-02-29","arxiv_id":"2402.18805","repositories_listed":1,"syntology":null},{"url":"/paper/inferring-community-structure-in-attributed","title":"Inference and Visualization of Community Structure in Attributed Hypergraphs Using Mixed-Membership Stochastic Block Models","date":"2024-01-01","arxiv_id":"2401.00688","repositories_listed":1,"syntology":null},{"url":"/paper/non-backtracking-graph-neural-networks","title":"Non-backtracking Graph Neural Networks","date":"2023-10-11","arxiv_id":"2310.07430","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_unverified":2,"n_pointer_only":5}},{"url":"/paper/an-investigation-of-representation-and","title":"An Investigation of Representation and Allocation Harms in Contrastive Learning","date":"2023-10-02","arxiv_id":"2310.01583","repositories_listed":1,"syntology":null},{"url":"/paper/graph-topological-property-recovery-with-heat","title":"DYMAG: Rethinking Message Passing Using Dynamical-systems-based Waveforms","date":"2023-09-18","arxiv_id":"2309.09924","repositories_listed":1,"syntology":null},{"url":"/paper/examining-the-effects-of-degree-distribution","title":"Examining the Effects of Degree Distribution and Homophily in Graph Learning Models","date":"2023-07-17","arxiv_id":"2307.08881","repositories_listed":1,"syntology":null},{"url":"/paper/a-neural-collapse-perspective-on-feature-1","title":"A Neural Collapse Perspective on Feature Evolution in Graph Neural Networks","date":"2023-07-04","arxiv_id":"2307.01951","repositories_listed":1,"syntology":{"n":7,"n_ran":1,"n_unverified":6,"n_pointer_only":0}},{"url":"/paper/structured-cooperative-learning-with","title":"Structured Cooperative Learning with Graphical Model Priors","date":"2023-06-16","arxiv_id":"2306.09595","repositories_listed":1,"syntology":{"n":27,"n_ran":16,"n_unverified":11,"n_pointer_only":27}},{"url":"/paper/when-do-graph-neural-networks-help-with-node","title":"When Do Graph Neural Networks Help with Node Classification? Investigating the Impact of Homophily Principle on Node Distinguishability","date":"2023-04-25","arxiv_id":"2304.14274","repositories_listed":1,"syntology":{"n":10,"n_ran":5,"n_unverified":5,"n_pointer_only":0}},{"url":"/paper/synergistic-graph-fusion-via-encoder","title":"Synergistic Graph Fusion via Encoder Embedding","date":"2023-03-31","arxiv_id":"2303.18051","repositories_listed":1,"syntology":null},{"url":"/paper/rmultinet-an-r-package-for-multilayer","title":"rMultiNet: An R Package For Multilayer Networks Analysis","date":"2023-02-09","arxiv_id":"2302.04437","repositories_listed":1,"syntology":null},{"url":"/paper/differentially-private-hierarchical","title":"Differentially-Private Hierarchical Clustering with Provable Approximation Guarantees","date":"2023-01-31","arxiv_id":"2302.00037","repositories_listed":1,"syntology":null},{"url":"/paper/statistical-mechanics-of-generalization-in-1","title":"Homophily modulates double descent generalization in graph convolution networks","date":"2022-12-26","arxiv_id":"2212.13069","repositories_listed":1,"syntology":null},{"url":"/paper/disc-differential-spectral-clustering-of","title":"DiSC: Differential Spectral Clustering of Features","date":"2022-11-10","arxiv_id":"2211.05314","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_unverified":0,"n_pointer_only":5}},{"url":"/paper/scalable-spectral-clustering-with-group","title":"Scalable Spectral Clustering with Group Fairness Constraints","date":"2022-10-28","arxiv_id":"2210.16435","repositories_listed":1,"syntology":null}],"syntology_records":10,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}