{"total":41,"rows":[{"id":"2101.09611","title":"Generative hypergraph clustering: from blockmodels to modularity","created":"2021-01-24","cited_by_count":49,"area":null},{"id":"2208.00111","title":"20 years of network community detection","created":"2022-07-30","cited_by_count":23,"area":null},{"id":"2204.05646","title":"Inference of hyperedges and overlapping communities in hypergraphs","created":"2022-04-12","cited_by_count":13,"area":null},{"id":"2310.01162","title":"DINE: Dimensional Interpretability of Node Embeddings","created":"2023-10-02","cited_by_count":8,"area":null},{"id":"2307.01282","title":"Normalized mutual information is a biased measure for classification and community detection","created":"2023-07-03","cited_by_count":7,"area":null},{"id":"2311.03857","title":"Structure and inference in hypergraphs with node attributes","created":"2023-11-07","cited_by_count":7,"area":null},{"id":"2103.11956","title":"The Implications of the No-Free-Lunch Theorems for Meta-induction","created":"2021-03-22","cited_by_count":6,"area":null},{"id":"2209.04562","title":"Bayan Algorithm: Detecting Communities in Networks Through Exact and Approximate Optimization of Modularity","created":"2022-09-10","cited_by_count":5,"area":null},{"id":"2204.13586","title":"Nonbacktracking spectral clustering of nonuniform hypergraphs","created":"2022-04-27","cited_by_count":4,"area":null},{"id":"2310.10898","title":"Analyzing Modularity Maximization in Approximation, Heuristic, and Graph Neural Network Algorithms for Community Detection","created":"2023-10-17","cited_by_count":4,"area":null},{"id":"2112.00183","title":"Descriptive vs. inferential community detection in networks: pitfalls, myths, and half-truths","created":"2021-11-30","cited_by_count":3,"area":null},{"id":"2210.09186","title":"Implicit models, latent compression, intrinsic biases, and cheap lunches in community detection","created":"2022-10-17","cited_by_count":3,"area":null},{"id":"2406.17556","title":"Modularity Based Community Detection in Hypergraphs","created":"2024-06-25","cited_by_count":3,"area":null},{"id":"2302.14698","title":"Heuristic Modularity Maximization Algorithms for Community Detection Rarely Return an Optimal Partition or Anything Similar","created":"2023-02-28","cited_by_count":2,"area":null},{"id":"2310.01144","title":"The Map Equation Goes Neural: Mapping Network Flows with Graph Neural Networks","created":"2023-10-02","cited_by_count":2,"area":null},{"id":"2101.00503","title":"Modularity maximisation for graphons","created":"2021-01-02","cited_by_count":1,"area":null},{"id":"2303.08157","title":"Graph Neural Network Surrogates of Fair Graph Filtering","created":"2023-03-14","cited_by_count":1,"area":null},{"id":"2401.00688","title":"Inference and Visualization of Community Structure in Attributed Hypergraphs Using Mixed-Membership Stochastic Block Models","created":"2024-01-01","cited_by_count":1,"area":null},{"id":"2409.10263","title":"MDL-Pool: Adaptive Multilevel Graph Pooling Based on Minimum Description Length","created":"2024-09-16","cited_by_count":1,"area":null},{"id":"2601.06262","title":"Matrix Factorization Framework for Community Detection under the Degree-Corrected Block Model","created":"2026-01-09","cited_by_count":1,"area":null},{"id":"2101.08623","title":"Synwalk -- Community Detection via Random Walk Modelling","created":"2021-01-21","cited_by_count":0,"area":null},{"id":"2102.03472","title":"Overcoming Bias in Community Detection Evaluation","created":"2021-02-06","cited_by_count":0,"area":null},{"id":"2103.04186","title":"The Automatic Quasi-clique Merger algorithm (AQCM)","created":"2021-03-06","cited_by_count":0,"area":null},{"id":"2103.14424","title":"Node metadata can produce predictability transitions in network inference problems","created":"2021-03-26","cited_by_count":0,"area":null},{"id":"2110.09274","title":"pygrank: A Python Package for Graph Node Ranking","created":"2021-10-18","cited_by_count":0,"area":null},{"id":"2111.11623","title":"A Modular Framework for Centrality and Clustering in Complex Networks","created":"2021-11-23","cited_by_count":0,"area":null},{"id":"2112.06287","title":"Identifying bias in cluster quality metrics","created":"2021-12-12","cited_by_count":0,"area":null},{"id":"2205.08047","title":"Perfect Spectral Clustering with Discrete Covariates","created":"2022-05-17","cited_by_count":0,"area":null},{"id":"2207.05301","title":"Edge Augmentation on Disconnected Graphs via Eigenvalue Elevation","created":"2022-07-12","cited_by_count":0,"area":null},{"id":"2301.11120","title":"Bayesian Detection of Mesoscale Structures in Pathway Data on Graphs","created":"2023-01-16","cited_by_count":0,"area":null},{"id":"2302.02787","title":"Generative models for two-ground-truth partitions in networks","created":"2023-02-06","cited_by_count":0,"area":null},{"id":"2309.10408","title":"Unsupervised Learning via Network-Aware Embeddings","created":"2023-09-19","cited_by_count":0,"area":null},{"id":"2412.08187","title":"From communities to interpretable network and word embedding: an unified approach","created":"2024-12-11","cited_by_count":0,"area":null},{"id":"2504.11621","title":"Robust Markov stability for community detection at a scale learned based on the structure","created":"2025-04-15","cited_by_count":0,"area":null},{"id":"2506.11869","title":"How do Probabilistic Graphical Models and Graph Neural Networks Look at Network Data?","created":"2025-06-13","cited_by_count":0,"area":null},{"id":"2510.06245","title":"DynBenchmark: Customizable Ground Truths to Benchmark Community Detection and Tracking in Temporal Networks","created":"2025-10-03","cited_by_count":0,"area":null},{"id":"2511.21350","title":"Learning Multi-Order Block Structure in Higher-Order Networks","created":"2025-11-26","cited_by_count":0,"area":null},{"id":"2602.12250","title":"Community Concealment from Graph Neural Networks","created":"2026-02-12","cited_by_count":0,"area":null},{"id":"2606.26132","title":"Code evolution for link prediction in complex networks","created":"2026-06-18","cited_by_count":0,"area":null},{"id":"2608.03696","title":"Learning and Clustering on Temporal Graphs: Principles, Primitives, and Pooling","created":"2026-08-04","cited_by_count":0,"area":null},{"id":"2609.08152","title":"Topology-induced Operators Reveal Complementary Graph Representations without Training","created":"2026-09-08","cited_by_count":0,"area":null}],"next_cursor":null}