{"total":47,"rows":[{"id":"2205.07826","title":"GraphHD: Efficient graph classification using hyperdimensional computing","created":"2022-05-16","cited_by_count":28,"area":null},{"id":"2406.05815","title":"What Can We Learn from State Space Models for Machine Learning on Graphs?","created":"2024-06-09","cited_by_count":13,"area":null},{"id":"2207.06944","title":"Differentially Private Graph Learning via Sensitivity-Bounded Personalized PageRank","created":"2022-07-14","cited_by_count":12,"area":null},{"id":"2210.04442","title":"DPAR: Decoupled Graph Neural Networks with Node-Level Differential Privacy","created":"2022-10-10","cited_by_count":10,"area":null},{"id":"2104.03895","title":"MGN-Net: a multi-view graph normalizer for integrating heterogeneous biological network populations","created":"2021-04-04","cited_by_count":8,"area":null},{"id":"2110.07570","title":"MGC: A Complex-Valued Graph Convolutional Network for Directed Graphs","created":"2021-10-14","cited_by_count":7,"area":null},{"id":"2106.05065","title":"Multi-layered Network Exploration via Random Walks: From Offline Optimization to Online Learning","created":"2021-06-09","cited_by_count":6,"area":null},{"id":"2407.00077","title":"Differentially Private Graph Diffusion with Applications in Personalized PageRanks","created":"2024-06-22","cited_by_count":4,"area":null},{"id":"2307.04962","title":"Intrinsically motivated graph exploration using network theories of human curiosity","created":"2023-07-11","cited_by_count":3,"area":null},{"id":"2301.10403","title":"Exact and rapid linear clustering of networks with dynamic programming","created":"2023-01-25","cited_by_count":2,"area":null},{"id":"2309.03808","title":"Improved theoretical guarantee for rank aggregation via spectral method","created":"2023-09-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":"2310.08031","title":"Local Graph Clustering with Noisy Labels","created":"2023-10-12","cited_by_count":2,"area":null},{"id":"2410.21634","title":"Faster Local Solvers for Graph Diffusion Equations","created":"2024-10-29","cited_by_count":2,"area":null},{"id":"2504.15324","title":"A Graph Based Raman Spectral Processing Technique for Exosome Classification","created":"2025-04-21","cited_by_count":2,"area":null},{"id":"2207.14358","title":"Topological structure of complex predictions","created":"2022-07-28","cited_by_count":1,"area":null},{"id":"2301.04824","title":"A Network Science perspective of Graph Convolutional Networks: A survey","created":"2023-01-12","cited_by_count":1,"area":null},{"id":"2309.06550","title":"Synthetic Text Generation using Hypergraph Representations","created":"2023-09-06","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":"2502.05204","title":"Invariant Measures for Data-Driven Dynamical System Identification: Analysis and Application","created":"2025-01-31","cited_by_count":1,"area":null},{"id":"2505.03717","title":"Nonnegative Low-rank Matrix Recovery Can Have Spurious Local Minima","created":"2025-05-06","cited_by_count":1,"area":null},{"id":"2506.14843","title":"CACTUS as a Reliable Tool for Early Classification of Age-related Macular Degeneration","created":"2025-06-16","cited_by_count":1,"area":null},{"id":"2510.20604","title":"Efficient Algorithms for Computing Random Walk Centrality","created":"2025-10-23","cited_by_count":1,"area":null},{"id":"2512.08055","title":"Fairness-aware PageRank via Edge Reweighting","created":"2025-12-08","cited_by_count":1,"area":null},{"id":"2512.14711","title":"Promoting Fairness in Information Access within Social Networks","created":"2025-12-08","cited_by_count":1,"area":null},{"id":"2601.02806","title":"Topology-aware Pathological Consistency Matching for Weakly-Paired IHC Virtual Staining","created":"2026-01-06","cited_by_count":1,"area":null},{"id":"2602.02512","title":"Efficient Edge Rewiring Strategies for Enhancing PageRank Fairness","created":"2026-01-23","cited_by_count":1,"area":null},{"id":"2602.08589","title":"FairRARI: A Plug and Play Framework for Fairness-Aware PageRank","created":"2026-02-09","cited_by_count":1,"area":null},{"id":"2603.05375","title":"Robust Node Affinities via Jaccard-Biased Random Walks and Rank Aggregation","created":"2026-03-05","cited_by_count":1,"area":null},{"id":"2105.05733","title":"Thematic recommendations on knowledge graphs using multilayer networks","created":"2021-05-12","cited_by_count":0,"area":null},{"id":"2108.03400","title":"Missing Data Estimation in Temporal Multilayer Position-aware Graph Neural Network (TMP-GNN)","created":"2021-08-07","cited_by_count":0,"area":null},{"id":"2207.11321","title":"A flexible PageRank-based graph embedding framework closely related to spectral eigenvector embeddings","created":"2022-07-22","cited_by_count":0,"area":null},{"id":"2302.14596","title":"Transitions between quasi-stationary states in traffic systems: Cologne orbital motorways as an example","created":"2023-02-28","cited_by_count":0,"area":null},{"id":"2303.17485","title":"Edge Ranking of Graphs in Transportation Networks using a Graph Neural Network (GNN)","created":"2023-03-25","cited_by_count":0,"area":null},{"id":"2309.07030","title":"Optimal transport distances for directed, weighted graphs: a case study with cell-cell communication networks","created":"2023-09-13","cited_by_count":0,"area":null},{"id":"2406.08034","title":"Strong and Weak Random Walks on Signed Networks","created":"2024-06-12","cited_by_count":0,"area":null},{"id":"2410.05188","title":"Matrix-weighted networks for modeling multidimensional dynamics","created":"2024-10-07","cited_by_count":0,"area":null},{"id":"2412.01789","title":"From ChebNet to ChebGibbsNet","created":"2024-12-02","cited_by_count":0,"area":null},{"id":"2509.23374","title":"An Accelerated Newton-GMRES Method for Multilinear PageRank","created":"2025-09-27","cited_by_count":0,"area":null},{"id":"2509.23568","title":"Node Classification via Simplicial Interaction with Augmented Maximal Clique Selection","created":"2025-09-28","cited_by_count":0,"area":null},{"id":"2510.08010","title":"Accelerated Evolving Set Processes for Local PageRank Computation","created":"2025-10-09","cited_by_count":0,"area":null},{"id":"2512.00887","title":"Multilingual Training-Free Remote Sensing Image Captioning","created":"2025-11-30","cited_by_count":0,"area":null},{"id":"2512.01484","title":"Multi-view diffusion geometry using intertwined diffusion trajectories","created":"2025-12-01","cited_by_count":0,"area":null},{"id":"2602.06426","title":"Beyond Code Contributions: How Network Position, Temporal Bursts, and Code Review Activities Shape Contributor Influence in Large-Scale Open Source Ecosystems","created":"2026-02-06","cited_by_count":0,"area":null},{"id":"2603.11472","title":"HawkesRank: Event-Driven Centrality for Real-Time Importance Ranking","created":"2026-03-12","cited_by_count":0,"area":null},{"id":"2605.08681","title":"Core-Halo Decomposition: Decentralizing Large-Scale Fixed-Point Problems","created":"2026-05-09","cited_by_count":0,"area":null},{"id":"2609.09255","title":"CAST: Canonical Approximate Schur Tree for Approximate Cholesky on Graphs","created":"2026-09-08","cited_by_count":0,"area":null}],"next_cursor":null}