{"total":23,"rows":[{"id":"2101.06855","title":"GraphAttacker: A General Multi-Task GraphAttack Framework","created":"2021-01-18","cited_by_count":8,"area":null},{"id":"2102.00500","title":"A Multiscale Environment for Learning by Diffusion","created":"2021-01-31","cited_by_count":8,"area":null},{"id":"2105.00987","title":"Spectral clustering under degree heterogeneity: a case for the random walk Laplacian","created":"2021-05-03","cited_by_count":7,"area":null},{"id":"2108.03098","title":"Localization in 1D non-parametric latent space models from pairwise affinities","created":"2021-08-06","cited_by_count":7,"area":null},{"id":"2106.01260","title":"Matrix factorisation and the interpretation of geodesic distance","created":"2021-06-02","cited_by_count":6,"area":null},{"id":"2102.10263","title":"Inducing a hierarchy for multi-class classification problems","created":"2021-02-20","cited_by_count":5,"area":null},{"id":"2201.01728","title":"Matrix Completion with Hierarchical Graph Side Information","created":"2022-01-02","cited_by_count":5,"area":null},{"id":"2109.14950","title":"A useful criterion on studying consistent estimation in community detection","created":"2021-09-30","cited_by_count":3,"area":null},{"id":"2208.08638","title":"Lost in the Shuffle: Testing Power in the Presence of Errorful Network Vertex Labels","created":"2022-08-18","cited_by_count":3,"area":null},{"id":"2307.13818","title":"Gradient-Based Spectral Embeddings of Random Dot Product Graphs","created":"2023-07-25","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":"2101.12430","title":"Subgraph nomination: Query by Example Subgraph Retrieval in Networks","created":"2021-01-29","cited_by_count":1,"area":null},{"id":"2306.00833","title":"When Does Bottom-up Beat Top-down in Hierarchical Community Detection?","created":"2023-06-01","cited_by_count":1,"area":null},{"id":"2309.01301","title":"T-Stochastic Graphs","created":"2023-09-04","cited_by_count":1,"area":null},{"id":"2312.11054","title":"Detection of Model-based Planted Pseudo-cliques in Random Dot Product Graphs by the Adjacency Spectral Embedding and the Graph Encoder Embedding","created":"2023-12-18","cited_by_count":1,"area":null},{"id":"2402.04403","title":"Edge-Parallel Graph Encoder Embedding","created":"2024-02-06","cited_by_count":1,"area":null},{"id":"2505.03649","title":"Weighted Random Dot Product Graphs","created":"2025-05-06","cited_by_count":1,"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":"2208.13921","title":"Dynamic Network Sampling for Community Detection","created":"2022-08-29","cited_by_count":0,"area":null},{"id":"2409.17544","title":"Optimizing the Induced Correlation in Omnibus Joint Graph Embeddings","created":"2024-09-26","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":"2602.21055","title":"Adjacency Spectral Embeddings of Correlation Networks","created":"2026-02-24","cited_by_count":0,"area":null},{"id":"2609.19357","title":"Learning Submanifolds for Subsequent Inference on Random Dot Product Graphs, Part 1: Theory","created":"2026-09-16","cited_by_count":0,"area":null}],"next_cursor":null}