Key papers

• Geometric Routing in Geometric Inhomogeneous Random Graphs (2026)
  Yu-Cheng Chiu et al.
  1.89
• Trees and Graphs with Non Log-concave Dominating Set Sequence via AI Tools (2026)
  Alina Du et al.
  1.83
• Invariant-Based Diagnostics for Graph Benchmarks (2026)
  Richard von Moos et al.
  1.83
• Learning Minimally Rigid Graphs with High Realization Counts (2026)
  Oleksandr Slyvka et al.
  1.83
• Representing Higher-Order Networks: A Survey of Graph-Based Frameworks (2026)
  Takaaki Fujita et al.
  1.83
• Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them (2026)
  Snir Hordan et al.
  1.83
• Local network evolution rules drive shortest path multiplicity (2026)
  Alexei Vazquez
  1.83
• Ollivier-Ricci Curvature of Riemannian Manifolds and Directed Graphs with Applications to Graph Neural Networks (2026)
  Eleanor Wiesler
  1.78
• The eigenvector centrality of hypergraphs (2026)
  Changjiang Bu et al.
  1.78
• Greedy Routing in a Sequentially Grown One-Dimensional Random Graph (2026)
  Alexander Ponomarenko
  1.78
• A two-steps tensor eigenvector centrality for nodes and hyperedges in hypergraphs (2026)
  Qing Xu et al.
  1.72
• Overcoming Tight Constraints in Soft Happy Colouring (2026)
  Mohammad Hadi Shekarriz et al.
  1.72
• CayleyPy-4: AI-Holography. Towards analogs of holographic string dualities for AI tasks (2026)
  A. Chervov et al.
  1.72
• Complete Causal Identification from Ancestral Graphs under Selection Bias (2026)
  Leihao Chen and Joris M. Mooij
  1.72
• Non-Clashing Teaching in Graphs: Algorithms, Complexity, and Bounds (2026)
  Sujoy Bhore et al.
  1.67
• RLGT: A reinforcement learning framework for extremal graph theory (2026)
  Ivan Damnjanovi\'c et al.
  1.67
• A series of real networks invariants (2026)
  Mikhail Tuzhilin
  1.61
• Neural Algorithmic Reasoning for Approximate $k$-Coloring with Recursive Warm Starts (2026)
  Knut Vanderbush et al.
  1.61
• Note on edge expansion and modularity in preferential attachment graphs (2026)
  Colin McDiarmid et al.
  1.61
• Fractional Diffusion on Graphs: Superposition of Laplacian Semigroups and Memory (2026)
  Nikita Deniskin et al.
  1.61
• Community detection in network using Szegedy quantum walk (2026)
  Md Samsur Rahaman et al.
  1.61
• Finding core subgraphs of directed graphs via discrete Ricci curvature flow (2025)
  Juan Zhao et al.
  1.56
• Towards a General Framework for Predicting and Explaining the Hardness of Graph-based Combinatorial Optimization Problems using Machine Learning and Association Rule Mining (2025)
  Bharat Sharman et al.
  1.56
• Geometric characterisation of structural and regular equivalences in undirected (hyper)graphs (2025)
  Marzieh Eidi and Nina Otter
  1.56
• Graph Neural Networks vs Convolutional Neural Networks for Graph Domination Number Prediction (2025)
  Randy Davila and Beyzanur Ispir
  1.50
• On the expressivity of sparse maxout networks (2025)
  Moritz Grillo et al.
  1.44
• Reinforcement learning for graph theory, Parallelizing Wagner's approach (2025)
  Alix Bouffard and Jane Breen
  1.39
• CayleyPy Growth: Efficient growth computations and hundreds of new conjectures on Cayley graphs (Brief version) (2025)
  A. Chervov et al.
  1.39
• Maxout Polytopes (2025)
  Andrei Balakin et al.
  1.39
• Modularity and random graphs (2025)
  Colin McDiarmid and Fiona Skerman
  1.39
• The Ubiquitous Sparse Matrix-Matrix Products (2025)
  Ayd{\i}n Bulu\c{c}
  1.33
• Influence Prediction in Collaboration Networks: An Empirical Study on arXiv (2025)
  Marina Lin et al.
  1.33
• Quality control in sublinear time: a case study via random graphs (2025)
  Cassandra Marcussen et al.
  1.33
• Reconstructing graphs and their connectivity using graphlets (2025)
  David Hartman and Aneta Pokorn\'a and Daniel Trlifaj and Llu\'is Vena
  1.33
• Empirical Analysis Of Heuristic and Approximation Algorithms for the The Mutual-Visibility Problem (2025)
  Vanja Stojanovi\'c et al.
  1.28
• Complex non-backtracking matrix for directed graphs (2025)
  Keishi Sando et al.
  1.28
• SASH: Decoding Community Structure in Graphs (2025)
  Allison Beemer et al.
  1.28
• In Reverie Together: Ten Years of Mathematical Discovery with a Machine Collaborator (2025)
  Randy Davila et al.
  1.28
• The Artificial Benchmark for Community Detection with Outliers and Overlapping Communities (ABCD+$o^2$) (2025)
  Jordan Barrett et al.
  1.22
• Inference of Hierarchical Core-Periphery Structure in Temporal Networks (2025)
  Theodore Y. Faust and Mason A. Porter
  1.22
• Social Networks: Enumerating Maximal Community Patterns in $c$-Closed Graphs (2025)
  Gabriela Bourla et al.
  1.22
• Circular Directional Flow Decomposition of Networks (2025)
  Marc Homs-Dones et al.
  1.22
• Data analysis using discrete cubical homology (2025)
  Chris Kapulkin et al.
  1.22
• Expanders in Models of Social Networks (2025)
  Marc Kaufmann et al.
  1.22
• Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs (2025)
  Marco Bressan and Victor Chepoi and Emmanuel Esposito and Maximilian Thiessen
  1.22
• Towards a format for describing networks / 1. Networks and knowledge graphs (2025)
  Vladimir Batagelj et al.
  1.17
• Weighted Random Dot Product Graphs (2025)
  Bernardo Marenco et al.
  1.17
• Higher-Order Group Synchronization (2025)
  Adriana L. Duncan et al.
  1.17
• Causal Models for Growing Networks (2025)
  Gecia Bravo-Hermsdorff et al.
  1.11
• Burning some myths on privacy properties of social networks against active attacks (2025)
  Serafino Cicerone and Gabriele Di Stefano and Sandi Klav\v{z}ar and Ismael G. Yero
  1.11
• New centrality measure: ksi-centrality (2025)
  Mikhail Tuzhilin
  1.06
• Diffusion Models for Cayley Graphs (2025)
  Michael R. Douglas and Kit Fraser-Taliente
  1.06
• Permutation Equivariant Neural Networks for Symmetric Tensors (2025)
  Edward Pearce-Crump
  1.06
• Identifying and Characterising Higher Order Interactions in Mobility Networks Using Hypergraphs (2025)
  Prathyush Sambaturu et al.
  1.06
• Cluster Synchronization via Graph Laplacian Eigenvectors (2025)
  Tobias Timofeyev et al.
  1.06
• Detecting Arbitrary Planted Subgraphs in Random Graphs (2025)
  Dor Elimelech and Wasim Huleihel
  1.06
• Pangraphs as models of higher-order interactions (2025)
  Mateusz Iskrzy\'nski et al.
  1.00
• CayleyPy RL: Pathfinding and Reinforcement Learning on Cayley Graphs (2025)
  A. Chervov et al.
  1.00
• Local Limits of Small World Networks (2025)
  Yeganeh Alimohammadi et al.
  0.94
• Low rank matrix completion and realization of graphs: results and problems (2025)
  S. Dzhenzher et al.
  0.94