{"total":34,"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.05885","title":"A Hierarchical Block Distance Model for Ultra Low-Dimensional Graph Representations","created":"2022-04-12","cited_by_count":9,"area":null},{"id":"2102.00500","title":"A Multiscale Environment for Learning by Diffusion","created":"2021-01-31","cited_by_count":8,"area":null},{"id":"2402.18974","title":"Generating Graphs via Spectral Diffusion","created":"2024-02-29","cited_by_count":8,"area":null},{"id":"2101.02510","title":"Disentangling homophily, community structure and triadic closure in networks","created":"2021-01-07","cited_by_count":6,"area":null},{"id":"2201.01728","title":"Matrix Completion with Hierarchical Graph Side Information","created":"2022-01-02","cited_by_count":5,"area":null},{"id":"2405.01015","title":"Network reconstruction via the minimum description length principle","created":"2024-05-02","cited_by_count":5,"area":null},{"id":"2111.00604","title":"Graph Embedding with Hierarchical Attentive Membership","created":"2021-10-31","cited_by_count":4,"area":null},{"id":"2210.15541","title":"Transformers meet Stochastic Block Models: Attention with Data-Adaptive Sparsity and Cost","created":"2022-10-27","cited_by_count":4,"area":null},{"id":"2106.15821","title":"Multilayer Networks for Text Analysis with Multiple Data Types","created":"2021-06-30","cited_by_count":3,"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":"2109.05408","title":"On the Fundamental Limits of Matrix Completion: Leveraging Hierarchical Similarity Graphs","created":"2021-09-12","cited_by_count":2,"area":null},{"id":"2305.04281","title":"Analysing Multiscale Clusterings with Persistent Homology","created":"2023-05-07","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.12430","title":"Subgraph nomination: Query by Example Subgraph Retrieval in Networks","created":"2021-01-29","cited_by_count":1,"area":null},{"id":"2110.01421","title":"Unraveling the graph structure of tabular data through Bayesian and spectral analysis","created":"2021-10-04","cited_by_count":1,"area":null},{"id":"2110.08904","title":"Deep forecasting of translational impact in medical research","created":"2021-10-17","cited_by_count":1,"area":null},{"id":"2201.01658","title":"Systematic assessment of the quality of fit of the stochastic block model for empirical networks","created":"2022-01-05","cited_by_count":1,"area":null},{"id":"2208.12933","title":"Consistency between ordering and clustering methods for graphs","created":"2022-08-27","cited_by_count":1,"area":null},{"id":"2210.04232","title":"Revealing Patient-Reported Experiences in Healthcare from Social Media using the DAPMAV Framework","created":"2022-10-09","cited_by_count":1,"area":null},{"id":"2309.01301","title":"T-Stochastic Graphs","created":"2023-09-04","cited_by_count":1,"area":null},{"id":"2503.07736","title":"Uncertainty quantification and posterior sampling for network reconstruction","created":"2025-03-10","cited_by_count":1,"area":null},{"id":"2507.22955","title":"LLMs Between the Nodes: Community Discovery Beyond Vectors","created":"2025-07-29","cited_by_count":1,"area":null},{"id":"2604.07492","title":"Cluster Attention for Graph Machine Learning","created":"2026-04-08","cited_by_count":1,"area":null},{"id":"2108.06651","title":"SamBaS: Sampling-Based Stochastic Block Partitioning","created":"2021-08-15","cited_by_count":0,"area":null},{"id":"2111.02330","title":"Geodesic Length Distribution in Sparse Network Ensembles","created":"2021-11-03","cited_by_count":0,"area":null},{"id":"2201.06517","title":"Demographic Confounding Causes Extreme Instances of Lifestyle Politics on Facebook","created":"2022-01-17","cited_by_count":0,"area":null},{"id":"2208.09710","title":"Adversarial contamination of networks in the setting of vertex nomination: a new trimming method","created":"2022-08-20","cited_by_count":0,"area":null},{"id":"2209.03219","title":"Reconstructing signed relations from interaction data","created":"2022-09-07","cited_by_count":0,"area":null},{"id":"2601.20020","title":"Matching and mixing: Matchability of graphs under Markovian error","created":"2026-01-27","cited_by_count":0,"area":null},{"id":"2603.08965","title":"Semantic Level of Detail for Knowledge Graphs: Discovering Abstraction Boundaries via Spectral Heat Diffusion","created":"2026-03-09","cited_by_count":0,"area":null},{"id":"2606.02055","title":"Query-Limited Community Recovery in Stochastic Block Models","created":"2026-06-01","cited_by_count":0,"area":null}],"next_cursor":null}