{"total":30,"rows":[{"id":"2101.08358","title":"Marius: Learning Massive Graph Embeddings on a Single Machine","created":"2021-01-20","cited_by_count":29,"area":null},{"id":"2204.06127","title":"Reinforcement learning on graphs: A survey","created":"2022-04-13","cited_by_count":20,"area":null},{"id":"2310.04475","title":"Demystifying Embedding Spaces using Large Language Models","created":"2023-10-06","cited_by_count":17,"area":null},{"id":"2110.12344","title":"A Broader Picture of Random-walk Based Graph Embedding","created":"2021-10-24","cited_by_count":16,"area":null},{"id":"2111.00048","title":"On the Power of Edge Independent Graph Models","created":"2021-10-29","cited_by_count":16,"area":null},{"id":"2106.01282","title":"Spectral embedding for dynamic networks with stability guarantees","created":"2021-06-02","cited_by_count":13,"area":null},{"id":"2102.08532","title":"DeepWalking Backwards: From Embeddings Back to Graphs","created":"2021-02-17","cited_by_count":6,"area":null},{"id":"2201.08481","title":"Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling","created":"2022-01-20","cited_by_count":6,"area":null},{"id":"2312.04762","title":"The Graph Lottery Ticket Hypothesis: Finding Sparse, Informative Graph Structure","created":"2023-12-08","cited_by_count":6,"area":null},{"id":"2102.06984","title":"Learning low-rank latent mesoscale structures in networks","created":"2021-02-13","cited_by_count":3,"area":null},{"id":"2111.03030","title":"Exact Representation of Sparse Networks with Symmetric Nonnegative Embeddings","created":"2021-11-04","cited_by_count":3,"area":null},{"id":"2310.14441","title":"EDGE++: Improved Training and Sampling of EDGE","created":"2023-10-22","cited_by_count":3,"area":null},{"id":"2312.03691","title":"On the Role of Edge Dependency in Graph Generative Models","created":"2023-12-06","cited_by_count":3,"area":null},{"id":"2503.01723","title":"How Low Can You Go? Searching for the Intrinsic Dimensionality of Complex Networks using Metric Node Embeddings","created":"2025-03-03","cited_by_count":3,"area":null},{"id":"2205.03486","title":"Clustered Graph Matching for Label Recovery and Graph Classification","created":"2022-05-06","cited_by_count":2,"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":"2106.09671","title":"Pseudo-Euclidean Attract-Repel Embeddings for Undirected Graphs","created":"2021-06-17","cited_by_count":1,"area":null},{"id":"2210.15277","title":"Implications of sparsity and high triangle density for graph representation learning","created":"2022-10-27","cited_by_count":1,"area":null},{"id":"2507.14835","title":"Differentially Private Synthetic Graphs Preserving Triangle-Motif Cuts","created":"2025-07-20","cited_by_count":1,"area":null},{"id":"2105.13251","title":"An Impossibility Theorem for Node Embedding","created":"2021-05-27","cited_by_count":0,"area":null},{"id":"2106.14238","title":"Interpretable Network Representation Learning with Principal Component Analysis","created":"2021-06-27","cited_by_count":0,"area":null},{"id":"2202.03945","title":"Spectral embedding and the latent geometry of multipartite networks","created":"2022-02-08","cited_by_count":0,"area":null},{"id":"2210.11561","title":"Low-Rank Representations Towards Classification Problem of Complex Networks","created":"2022-10-20","cited_by_count":0,"area":null},{"id":"2212.03720","title":"Pseudo-Riemannian Embedding Models for Multi-Relational Graph Representations","created":"2022-12-02","cited_by_count":0,"area":null},{"id":"2303.11230","title":"Fitting Low-rank Models on Egocentrically Sampled Partial Networks","created":"2023-03-09","cited_by_count":0,"area":null},{"id":"2405.09595","title":"Simplicity within biological complexity","created":"2024-05-15","cited_by_count":0,"area":null},{"id":"2410.20895","title":"Valid Bootstraps for Network Embeddings with Applications to Network Visualisation","created":"2024-10-28","cited_by_count":0,"area":null},{"id":"2412.04354","title":"Multi-Scale Node Embeddings for Graph Modeling and Generation","created":"2024-12-05","cited_by_count":0,"area":null},{"id":"2509.12396","title":"Information Loss and Disparate Effects in Network Embeddings","created":"2025-09-15","cited_by_count":0,"area":null},{"id":"2603.11965","title":"Uncovering Locally Low-dimensional Structure in Networks by Locally Optimal Spectral Embedding","created":"2026-03-12","cited_by_count":0,"area":null}],"next_cursor":null}