{"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/community-detection/papers/3","list_of":"/task/community-detection","task":"Community Detection","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":10,"rows_per_page":100,"rows":[201,300],"of":919,"counts":{"archive_papers_tagged":919,"with_a_code_link":263,"where_syntology_ran_a_sample":16,"not_listed_spam_title":0,"listed":919,"listed_where_code_ran":16,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":14,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":14,"listed_every_run_a_failure_of_syntologys_instrument":2,"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/community-detection","prev":"/task/community-detection/papers/2","next":"/task/community-detection/papers/4","papers":[{"url":"/paper/graphair-graph-representation-learning-with","slug":"graphair-graph-representation-learning-with","title":"GraphAIR: Graph Representation Learning with Neighborhood Aggregation and Interaction","date":"2019-11-05","arxiv_id":"1911.01731","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":4,"n_honours":3,"n_violates":2,"n_no_contract":1,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 3 honoured, 2 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/graphair-graph-representation-learning-with#ran","syntology_url":"https://syntology.ai/paper/1911.01731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.01731"}},"official":{"repos":["CRIPAC-DIG/GraphAIR"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/is-performance-of-scholars-correlated-to","slug":"is-performance-of-scholars-correlated-to","title":"Is Performance of Scholars Correlated to Their Research Collaboration Patterns?","date":"2019-11-05","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/hypergraph-clustering-with-categorical-edge","slug":"hypergraph-clustering-with-categorical-edge","title":"Clustering in graphs and hypergraphs with categorical edge labels","date":"2019-10-22","arxiv_id":"1910.09943","repositories_listed":1,"syntology":null},{"url":"/paper/follow-alice-into-the-rabbit-hole-giving","slug":"follow-alice-into-the-rabbit-hole-giving","title":"ALOHA: Artificial Learning of Human Attributes for Dialogue Agents","date":"2019-10-18","arxiv_id":"1910.08293","repositories_listed":1,"syntology":null},{"url":"/paper/overlapping-community-detection-with-graph-1","slug":"overlapping-community-detection-with-graph-1","title":"Overlapping Community Detection with Graph Neural Networks","date":"2019-09-26","arxiv_id":"1909.12201","repositories_listed":1,"syntology":{"n":12,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/overlapping-community-detection-with-graph-1#ran","syntology_url":"https://syntology.ai/paper/1909.12201","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.12201"}},"official":{"repos":["shchur/overlapping-community-detection"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-distributed-hybrid-community-detection","slug":"a-distributed-hybrid-community-detection","title":"A Distributed Hybrid Community Detection Methodology for Social Networks","date":"2019-08-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/consistent-community-detection-in-continuous","slug":"consistent-community-detection-in-continuous","title":"CHIP: A Hawkes Process Model for Continuous-time Networks with Scalable and Consistent Estimation","date":"2019-08-19","arxiv_id":"1908.06940","repositories_listed":1,"syntology":null},{"url":"/paper/overlapping-community-detection-in-networks","slug":"overlapping-community-detection-in-networks","title":"Overlapping community detection in networks based on link partitioning and partitioning around medoids","date":"2019-07-20","arxiv_id":"1907.08731","repositories_listed":1,"syntology":null},{"url":"/paper/embedding-based-silhouette-community","slug":"embedding-based-silhouette-community","title":"Embedding-based Silhouette Community Detection","date":"2019-07-17","arxiv_id":"1908.02556","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-co-learning-on-mathcalg","slug":"unsupervised-co-learning-on-mathcalg","title":"Unsupervised Co-Learning on $\\mathcal{G}$-Manifolds Across Irreducible Representations","date":"2019-06-06","arxiv_id":"1906.02707","repositories_listed":1,"syntology":null},{"url":"/paper/attributed-graph-clustering-via-adaptive","slug":"attributed-graph-clustering-via-adaptive","title":"Attributed Graph Clustering via Adaptive Graph Convolution","date":"2019-06-04","arxiv_id":"1906.01210","repositories_listed":1,"syntology":null},{"url":"/paper/graph-learning-network-a-structure-learning-1","slug":"graph-learning-network-a-structure-learning-1","title":"Graph Learning Network: A Structure Learning Algorithm","date":"2019-05-29","arxiv_id":"1905.12665","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-identify-high-betweenness","slug":"learning-to-identify-high-betweenness","title":"Learning to Identify High Betweenness Centrality Nodes from Scratch: A Novel Graph Neural Network Approach","date":"2019-05-24","arxiv_id":"1905.10418","repositories_listed":1,"syntology":null},{"url":"/paper/percomcv-a-hybrid-approach-of-community","slug":"percomcv-a-hybrid-approach-of-community","title":"PercoMCV: A hybrid approach of community detection in social networks","date":"2019-05-21","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/190510350","slug":"190510350","title":"Unsupervised Community Detection with Modularity-Based Attention Model","date":"2019-05-20","arxiv_id":"1905.10350","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/190510350#ran","syntology_url":"https://syntology.ai/paper/1905.10350","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10350"}},"official":{"repos":["Ivanopolo/modnet"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/semantic-flow-in-language-networks","slug":"semantic-flow-in-language-networks","title":"Semantic flow in language networks","date":"2019-05-18","arxiv_id":"1905.07595","repositories_listed":1,"syntology":null},{"url":"/paper/energy-based-self-attentive-learning-of","slug":"energy-based-self-attentive-learning-of","title":"Energy-based Self-attentive Learning of Abstractive Communities for Spoken Language Understanding","date":"2019-04-20","arxiv_id":"1904.09491","repositories_listed":1,"syntology":null},{"url":"/paper/190412593","slug":"190412593","title":"Density-based Community Detection/Optimization","date":"2019-04-07","arxiv_id":"1904.12593","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-estimation-of-the-latent-dimension","slug":"bayesian-estimation-of-the-latent-dimension","title":"Bayesian estimation of the latent dimension and communities in stochastic blockmodels","date":"2019-04-06","arxiv_id":"1904.05333","repositories_listed":1,"syntology":null},{"url":"/paper/community-detection-over-a-heterogeneous","slug":"community-detection-over-a-heterogeneous","title":"Community detection over a heterogeneous population of non-aligned networks","date":"2019-04-04","arxiv_id":"1904.05332","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-stochastic-block-model-for","slug":"hierarchical-stochastic-block-model-for","title":"Hierarchical Stochastic Block Model for Community Detection in Multiplex Networks","date":"2019-03-30","arxiv_id":"1904.05330","repositories_listed":1,"syntology":null},{"url":"/paper/network-reconstruction-and-community","slug":"network-reconstruction-and-community","title":"Network reconstruction and community detection from dynamics","date":"2019-03-26","arxiv_id":"1903.10833","repositories_listed":1,"syntology":null},{"url":"/paper/communitygan-community-detection-with","slug":"communitygan-community-detection-with","title":"CommunityGAN: Community Detection with Generative Adversarial Nets","date":"2019-01-20","arxiv_id":"1901.06631","repositories_listed":1,"syntology":null},{"url":"/paper/deep-network-embedding-for-graph","slug":"deep-network-embedding-for-graph","title":"Deep Network Embedding for Graph Representation Learning in Signed Networks","date":"2019-01-07","arxiv_id":"1901.01718","repositories_listed":1,"syntology":null},{"url":"/paper/statement-networks-a-power-structure","slug":"statement-networks-a-power-structure","title":"Statement networks: a power structure narrative as depicted by newspapers","date":"2018-12-10","arxiv_id":"1812.03632","repositories_listed":1,"syntology":null},{"url":"/paper/node-embedding-with-adaptive-similarities-for","slug":"node-embedding-with-adaptive-similarities-for","title":"Node Embedding with Adaptive Similarities for Scalable Learning over Graphs","date":"2018-11-27","arxiv_id":"1811.10797","repositories_listed":1,"syntology":null},{"url":"/paper/clubmark-a-parallel-isolation-framework-for","slug":"clubmark-a-parallel-isolation-framework-for","title":"Clubmark: a Parallel Isolation Framework for Benchmarking and Profiling Clustering Algorithms on NUMA Architectures","date":"2018-11-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/coupled-graphs-and-tensor-factorization-for","slug":"coupled-graphs-and-tensor-factorization-for","title":"Coupled Graphs and Tensor Factorization for Recommender Systems and Community Detection","date":"2018-09-22","arxiv_id":"1809.08353","repositories_listed":1,"syntology":null},{"url":"/paper/biasedwalk-biased-sampling-for-representation","slug":"biasedwalk-biased-sampling-for-representation","title":"BiasedWalk: Biased Sampling for Representation Learning on Graphs","date":"2018-09-07","arxiv_id":"1809.02482","repositories_listed":1,"syntology":null},{"url":"/paper/community-detection-in-networks-with","slug":"community-detection-in-networks-with","title":"Community detection in networks without observing edges","date":"2018-08-18","arxiv_id":"1808.06079","repositories_listed":1,"syntology":null},{"url":"/paper/temporally-evolving-community-detection-and","slug":"temporally-evolving-community-detection-and","title":"Using link and content over time for embedding generation in Dynamic Attributed Networks","date":"2018-07-17","arxiv_id":"1807.06560","repositories_listed":1,"syntology":null},{"url":"/paper/block-structure-based-time-series-models-for","slug":"block-structure-based-time-series-models-for","title":"Block-Structure Based Time-Series Models For Graph Sequences","date":"2018-04-24","arxiv_id":"1804.08796","repositories_listed":1,"syntology":null},{"url":"/paper/neural-brane-neural-bayesian-personalized","slug":"neural-brane-neural-bayesian-personalized","title":"Neural-Brane: Neural Bayesian Personalized Ranking for Attributed Network Embedding","date":"2018-04-23","arxiv_id":"1804.08774","repositories_listed":1,"syntology":null},{"url":"/paper/generative-models-for-local-network-community","slug":"generative-models-for-local-network-community","title":"Generative models for local network community detection","date":"2018-04-12","arxiv_id":"1804.04469","repositories_listed":1,"syntology":null},{"url":"/paper/multi-view-banded-spectral-clustering-with","slug":"multi-view-banded-spectral-clustering-with","title":"Multi-view Banded Spectral Clustering with Application to ICD9 Clustering","date":"2018-04-06","arxiv_id":"1804.02097","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-overfit-and-underfit-in-models-of","slug":"evaluating-overfit-and-underfit-in-models-of","title":"Evaluating Overfit and Underfit in Models of Network Community Structure","date":"2018-02-28","arxiv_id":"1802.10582","repositories_listed":1,"syntology":null},{"url":"/paper/community-detection-using-diffusion","slug":"community-detection-using-diffusion","title":"Community detection using diffusion information","date":"2018-01-23","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/prune-preserving-proximity-and-global-ranking","slug":"prune-preserving-proximity-and-global-ranking","title":"PRUNE: Preserving Proximity and Global Ranking for Network Embedding","date":"2017-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/surfacing-contextual-hate-speech-words-within","slug":"surfacing-contextual-hate-speech-words-within","title":"Surfacing contextual hate speech words within social media","date":"2017-11-28","arxiv_id":"1711.10093","repositories_listed":1,"syntology":null},{"url":"/paper/guided-machine-learning-for-power-grid","slug":"guided-machine-learning-for-power-grid","title":"Guided Machine Learning for power grid segmentation","date":"2017-11-13","arxiv_id":"1711.09715","repositories_listed":1,"syntology":null},{"url":"/paper/estimation-of-low-rank-matrices-via","slug":"estimation-of-low-rank-matrices-via","title":"Estimation of Low-Rank Matrices via Approximate Message Passing","date":"2017-11-06","arxiv_id":"1711.01682","repositories_listed":1,"syntology":null},{"url":"/paper/a-network-approach-to-topic-models","slug":"a-network-approach-to-topic-models","title":"A network approach to topic models","date":"2017-08-04","arxiv_id":"1708.01677","repositories_listed":1,"syntology":null},{"url":"/paper/cane-context-aware-network-embedding-for","slug":"cane-context-aware-network-embedding-for","title":"CANE: Context-Aware Network Embedding for Relation Modeling","date":"2017-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-node-attributes-for-incomplete","slug":"leveraging-node-attributes-for-incomplete","title":"Leveraging Node Attributes for Incomplete Relational Data","date":"2017-06-14","arxiv_id":"1706.04289","repositories_listed":1,"syntology":null},{"url":"/paper/improving-coarsening-schemes-for-hypergraph","slug":"improving-coarsening-schemes-for-hypergraph","title":"Improving Coarsening Schemes for Hypergraph Partitioning by Exploiting Community Structure","date":"2017-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/fault-detection-engine-in-intelligent","slug":"fault-detection-engine-in-intelligent","title":"Fault Detection Engine in Intelligent Predictive Analytics Platform for DCIM","date":"2016-10-16","arxiv_id":"1610.04872","repositories_listed":1,"syntology":null},{"url":"/paper/mpi-faun-an-mpi-based-framework-for","slug":"mpi-faun-an-mpi-based-framework-for","title":"MPI-FAUN: An MPI-Based Framework for Alternating-Updating Nonnegative Matrix Factorization","date":"2016-09-28","arxiv_id":"1609.09154","repositories_listed":1,"syntology":null},{"url":"/paper/covariate-regularized-community-detection-in","slug":"covariate-regularized-community-detection-in","title":"Covariate Regularized Community Detection in Sparse Graphs","date":"2016-07-10","arxiv_id":"1607.02675","repositories_listed":1,"syntology":null},{"url":"/paper/on-clustering-network-valued-data","slug":"on-clustering-network-valued-data","title":"On clustering network-valued data","date":"2016-06-08","arxiv_id":"1606.02401","repositories_listed":1,"syntology":null},{"url":"/paper/network-structure-metadata-and-the-prediction","slug":"network-structure-metadata-and-the-prediction","title":"Network structure, metadata and the prediction of missing nodes and annotations","date":"2016-04-01","arxiv_id":"1604.00255","repositories_listed":1,"syntology":null},{"url":"/paper/real-time-community-detection-in-large-social","slug":"real-time-community-detection-in-large-social","title":"Real-Time Community Detection in Large Social Networks on a Laptop","date":"2016-01-15","arxiv_id":"1601.03958","repositories_listed":1,"syntology":null},{"url":"/paper/statistical-physics-of-inference-thresholds","slug":"statistical-physics-of-inference-thresholds","title":"Statistical physics of inference: Thresholds and algorithms","date":"2015-11-08","arxiv_id":"1511.02476","repositories_listed":1,"syntology":null},{"url":"/paper/time-series-clustering-via-community","slug":"time-series-clustering-via-community","title":"Time Series Clustering via Community Detection in Networks","date":"2015-08-19","arxiv_id":"1508.04757","repositories_listed":1,"syntology":null},{"url":"/paper/on-semidefinite-relaxations-for-the-block","slug":"on-semidefinite-relaxations-for-the-block","title":"On semidefinite relaxations for the block model","date":"2014-06-21","arxiv_id":"1406.5647","repositories_listed":1,"syntology":null},{"url":"/paper/high-quality-scalable-and-parallel-community","slug":"high-quality-scalable-and-parallel-community","title":"High Quality, Scalable and Parallel Community Detectionfor Large Real Graphs","date":"2014-03-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/efficiently-inferring-community-structure-in","slug":"efficiently-inferring-community-structure-in","title":"Efficiently inferring community structure in bipartite networks","date":"2014-03-12","arxiv_id":"1403.2933","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-block-structures-and-high","slug":"hierarchical-block-structures-and-high","title":"Hierarchical Block Structures and High-resolution Model Selection in Large Networks","date":"2013-10-16","arxiv_id":"1310.4377","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-discovery-of-overlapping","slug":"efficient-discovery-of-overlapping","title":"Efficient discovery of overlapping communities in massive networks","date":"2013-09-03","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/online-tensor-methods-for-learning-latent","slug":"online-tensor-methods-for-learning-latent","title":"Online Tensor Methods for Learning Latent Variable Models","date":"2013-09-03","arxiv_id":"1309.0787","repositories_listed":1,"syntology":null},{"url":"/paper/detecting-community-structure-using-label","slug":"detecting-community-structure-using-label","title":"Detecting community structure using label propagation with weighted coherent neighborhood propinquity","date":"2013-07-15","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/constrained-fractional-set-programs-and-their","slug":"constrained-fractional-set-programs-and-their","title":"Constrained fractional set programs and their application in local clustering and community detection","date":"2013-06-14","arxiv_id":"1306.3409","repositories_listed":1,"syntology":null},{"url":"/paper/qualitative-comparison-of-community-detection","slug":"qualitative-comparison-of-community-detection","title":"Qualitative Comparison of Community Detection Algorithms","date":"2012-07-16","arxiv_id":"1207.3603","repositories_listed":1,"syntology":null},{"url":"/paper/community-detection-in-graphs","slug":"community-detection-in-graphs","title":"Community detection in graphs","date":"2009-06-03","arxiv_id":"0906.0612","repositories_listed":1,"syntology":null},{"url":null,"slug":"understanding-the-effect-of-knowledge-graph","title":"Understanding the Effect of Knowledge Graph Extraction Error on Downstream Graph Analyses: A Case Study on Affiliation Graphs","date":"2025-06-14","arxiv_id":"2506.12367","repositories_listed":0,"syntology":null},{"url":null,"slug":"strongly-consistent-community-detection-in","title":"Strongly Consistent Community Detection in Popularity Adjusted Block Models","date":"2025-06-08","arxiv_id":"2506.07224","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-community-detection-in-dense","title":"Optimal community detection in dense bipartite graphs","date":"2025-05-23","arxiv_id":"2505.18372","repositories_listed":0,"syntology":null},{"url":null,"slug":"pre-trained-prompt-driven-community-search","title":"Pre-trained Prompt-driven Semi-supervised Local Community Detection","date":"2025-05-18","arxiv_id":"2505.12304","repositories_listed":0,"syntology":null},{"url":null,"slug":"nazm-network-analysis-of-zonal-metrics-in","title":"NAZM: Network Analysis of Zonal Metrics in Persian Poetic Tradition","date":"2025-05-12","arxiv_id":"2505.08052","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-noise-resilient-semi-supervised-graph","title":"A Noise-Resilient Semi-Supervised Graph Autoencoder for Overlapping Semantic Community Detection","date":"2025-05-09","arxiv_id":"2505.05965","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-price-of-differential-privacy-for-1","title":"On the Price of Differential Privacy for Spectral Clustering over Stochastic Block Models","date":"2025-05-09","arxiv_id":"2505.05816","repositories_listed":0,"syntology":null},{"url":null,"slug":"signal-recovery-from-random-dot-product","title":"Signal Recovery from Random Dot-Product Graphs Under Local Differential Privacy","date":"2025-04-24","arxiv_id":"2504.17274","repositories_listed":0,"syntology":null},{"url":null,"slug":"new-recipe-for-semi-supervised-community","title":"New Recipe for Semi-supervised Community Detection: Clique Annealing under Crystallization Kinetics","date":"2025-04-22","arxiv_id":"2504.15927","repositories_listed":0,"syntology":null},{"url":null,"slug":"privacy-preserving-transfer-learning-for","title":"Privacy-Preserving Transfer Learning for Community Detection using Locally Distributed Multiple Networks","date":"2025-04-01","arxiv_id":"2504.00890","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-local-perspective-based-model-for","title":"A Local Perspective-based Model for Overlapping Community Detection","date":"2025-03-27","arxiv_id":"2503.21558","repositories_listed":0,"syntology":null},{"url":null,"slug":"mapping-hymns-and-organizing-concepts-in-the","title":"Mapping Hymns and Organizing Concepts in the Rigveda: Quantitatively Connecting the Vedic Suktas","date":"2025-03-23","arxiv_id":"2503.18226","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-fastmap-new-applications","title":"Revisiting FastMap: New Applications","date":"2025-03-14","arxiv_id":"2503.11908","repositories_listed":0,"syntology":null},{"url":null,"slug":"unifying-structural-proximity-and-equivalence","title":"Unifying Structural Proximity and Equivalence for Enhanced Dynamic Network Embedding","date":"2025-03-14","arxiv_id":"2503.19926","repositories_listed":0,"syntology":null},{"url":null,"slug":"community-detection-by-elpmeans-an","title":"Community Detection by ELPMeans: An Unsupervised Approach That Uses Laplacian Centrality and Clustering","date":"2025-02-27","arxiv_id":"2502.19895","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-robustness-of-structural-features-in","title":"The Robustness of Structural Features in Species Interaction Networks","date":"2025-02-24","arxiv_id":"2502.16778","repositories_listed":0,"syntology":null},{"url":null,"slug":"fitting-networks-with-a-cancellation-trick","title":"Fitting networks with a cancellation trick","date":"2025-02-23","arxiv_id":"2502.16728","repositories_listed":0,"syntology":null},{"url":null,"slug":"human-centric-community-detection-in-hybrid","title":"Human-Centric Community Detection in Hybrid Metaverse Networks with Integrated AI Entities","date":"2025-02-15","arxiv_id":"2502.10750","repositories_listed":0,"syntology":null},{"url":null,"slug":"unified-graph-networks-ugn-a-deep-neural","title":"Unified Graph Networks (UGN): A Deep Neural Framework for Solving Graph Problems","date":"2025-02-11","arxiv_id":"2502.07500","repositories_listed":0,"syntology":null},{"url":null,"slug":"comparative-analysis-of-community-detection","title":"Comparative Analysis of Community Detection Algorithms on the SNAP Social Circles Dataset","date":"2025-02-01","arxiv_id":"2502.04341","repositories_listed":0,"syntology":null},{"url":null,"slug":"induced-modularity-and-community-detection","title":"Induced Modularity and Community Detection for Functionally Interpretable Reinforcement Learning","date":"2025-01-28","arxiv_id":"2501.17077","repositories_listed":0,"syntology":null},{"url":null,"slug":"principal-graph-encoder-embedding-and","title":"Principal Graph Encoder Embedding and Principal Community Detection","date":"2025-01-24","arxiv_id":"2501.14939","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-fine-tuning-with-latent-cluster","title":"Improving Fine-Tuning with Latent Cluster Correction","date":"2025-01-21","arxiv_id":"2501.11919","repositories_listed":0,"syntology":null},{"url":null,"slug":"community-detection-for-contexual-lsbm","title":"Community Detection for Contextual-LSBM: Theoretical Limitations of Misclassification Rate and Efficient Algorithms","date":"2025-01-19","arxiv_id":"2501.11139","repositories_listed":0,"syntology":null},{"url":null,"slug":"village-net-clustering-a-rapid-approach-to","title":"Village-Net Clustering: A Rapid approach to Non-linear Unsupervised Clustering of High-Dimensional Data","date":"2025-01-16","arxiv_id":"2501.10471","repositories_listed":0,"syntology":null},{"url":null,"slug":"intelligent-anti-money-laundering-solution","title":"Intelligent Anti-Money Laundering Solution Based upon Novel Community Detection in Massive Transaction Networks on Spark","date":"2025-01-08","arxiv_id":"2501.09026","repositories_listed":0,"syntology":null},{"url":null,"slug":"exact-matching-in-correlated-networks-with","title":"Exact Matching in Correlated Networks with Node Attributes for Improved Community Recovery","date":"2025-01-06","arxiv_id":"2501.02851","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-clustering-via-community-detection","title":"Deep Clustering via Community Detection","date":"2025-01-03","arxiv_id":"2501.02036","repositories_listed":0,"syntology":null},{"url":null,"slug":"kan-kan-buff-signed-graph-neural-networks","title":"KAN KAN Buff Signed Graph Neural Networks?","date":"2025-01-01","arxiv_id":"2501.00709","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-concentration-for-random-signed-graphs","title":"Matrix Concentration for Random Signed Graphs and Community Recovery in the Signed Stochastic Block Model","date":"2024-12-29","arxiv_id":"2412.20620","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-language-models-meet-graph-neural","title":"Large Language Models Meet Graph Neural Networks: A Perspective of Graph Mining","date":"2024-12-26","arxiv_id":"2412.19211","repositories_listed":0,"syntology":null},{"url":null,"slug":"hypergraph-clustering-using-ricci-curvature","title":"Hypergraph clustering using Ricci curvature: an edge transport perspective","date":"2024-12-20","arxiv_id":"2412.15695","repositories_listed":0,"syntology":null},{"url":null,"slug":"representation-learning-of-dynamic-networks","title":"Representation learning of dynamic networks","date":"2024-12-15","arxiv_id":"2412.11065","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-scale-node-embeddings-for-graph","title":"Multi-Scale Node Embeddings for Graph Modeling and Generation","date":"2024-12-05","arxiv_id":"2412.04354","repositories_listed":0,"syntology":null},{"url":null,"slug":"community-detection-with-heterogeneous-block","title":"Community Detection with Heterogeneous Block Covariance Model","date":"2024-12-04","arxiv_id":"2412.03780","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-table-integration-in-data-lakes","title":"Table Integration in Data Lakes Unleashed: Pairwise Integrability Judgment, Integrable Set Discovery, and Multi-Tuple Conflict Resolution","date":"2024-11-30","arxiv_id":"2412.00324","repositories_listed":0,"syntology":null},{"url":null,"slug":"transition-network-analysis-a-novel-framework","title":"Transition Network Analysis: A Novel Framework for Modeling, Visualizing, and Identifying the Temporal Patterns of Learners and Learning Processes","date":"2024-11-23","arxiv_id":"2411.15486","repositories_listed":0,"syntology":null}],"record_sha256":"589e3d6139d15e3fa41fa44bd4dfe0fa442782fe89c85f43aa436b0b1ccb4dc0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}