Key papers

• Discrete Diffusion Models: A Unified Framework from Tokenization to Generation (2026)
  Ye Yuan et al.
  10.42
• Beyond the $d^{2.5}$-mixing bound for Dikin walks on polytopes (2026)
  Yunbum Kook
  3.45
• Reflected UAS: Corrected Deterministic Stability and Direct CTMC Drift Calculation (2026)
  Krishna Subedi
  1.94
• Geometric Routing in Geometric Inhomogeneous Random Graphs (2026)
  Yu-Cheng Chiu et al.
  1.89
• Network node immunization: improving Netshield algorithm through random rooted forests (2026)
  Luca Avena et al.
  1.89
• Scaling Laws from Sequential Feature Recovery: A Solvable Hierarchical Model (2026)
  Arie Wortsman-Zurich et al.
  1.83
• Bayesian Latent Space Models for Graphs Are Misspecified: Toward Robust Inference via Generalized Posteriors (2026)
  Aldric Labarthe (CB et al.
  1.83
• Anomalous scaling in redirection networks (2026)
  Harrison Hartle et al.
  1.78
• Intensity Dot Product Graphs (2026)
  Giulio Valentino Dalla Riva and Matteo Dalla Riva
  1.78
• node2vec or triangle-biased random walks: stationarity, regularity & recurrence (2026)
  Luca Avena et al.
  1.78
• A Learning-Based Superposition Operator for Non-Renewal Arrival Processes in Queueing Networks (2026)
  Eliran Sherzer
  1.72
• P\'olya Thresholds Graphs (2026)
  Jinghan Yu et al.
  1.72
• Detection of local geometry in random graphs: information-theoretic and computational limits (2026)
  Jinho Bok et al.
  1.72
• Complete Causal Identification from Ancestral Graphs under Selection Bias (2026)
  Leihao Chen and Joris M. Mooij
  1.72
• Static and Dynamic Approaches to Computing Barycenters of Probability Measures on Graphs (2026)
  David Gentile et al.
  1.72
• Fundamental Limits of Community Detection in Contextual Multi-Layer Stochastic Block Models (2026)
  Shuyang Gong and Dong Huang and Zhangsong Li
  1.67
• Random geometric graphs with smooth kernels: sharp detection threshold and a spectral conjecture (2026)
  Cheng Mao et al.
  1.67
• Constrained graph generation: Preserving diameter and clustering coefficient simultaneously (2026)
  D\'avid Ferenczi et al.
  1.67
• Maximum entropy based testing in network models: ERGMs and constrained optimization (2026)
  Subhro Ghosh et al.
  1.67
• A discrete Benamou-Brenier formulation of Optimal Transport on graphs (2026)
  Kieran Morris and Oliver Johnson
  1.61
• Graph energy as a measure of community detectability in networks (2026)
  Lucas B\"ottcher et al.
  1.61
• Note on edge expansion and modularity in preferential attachment graphs (2026)
  Colin McDiarmid et al.
  1.61
• Bringing order to network centrality measures (2026)
  G. Exarchakos et al.
  1.61
• Distributional Computational Graphs: Error Bounds (2026)
  Olof Hallqvist Elias et al.
  1.61
• Matching and mixing: Matchability of graphs under Markovian error (2026)
  Zhirui Li et al.
  1.61
• Sampling on Metric Graphs (2025)
  Rajat Vadiraj Dwaraknath et al.
  1.56
• Provable Diffusion Posterior Sampling for Bayesian Inversion (2025)
  Jinyuan Chang et al.
  1.56
• A new adaptive two-layer model for opinion spread in hypergraphs: parameter sensitivity and estimation (2025)
  \'Agnes Backhausz et al.
  1.56
• Limit Theorems for Stochastic Gradient Descent in High-Dimensional Single-Layer Networks (2025)
  Parsa Rangriz
  1.50
• Statistics of leaves in growing random trees (2025)
  Harrison Hartle et al.
  1.50
• A Phase Transition for Opinion Dynamics with Competing Biases (2025)
  Federico Capannoli et al.
  1.50
• A Fast Binary Splitting Approach for Non-Adaptive Learning of Erd\H{o}s--R\'enyi Graphs (2025)
  Hoang Ta and Jonathan Scarlett
  1.50
• Resolving Node Identifiability in Graph Neural Processes via Laplacian Spectral Encodings (2025)
  Zimo Yan et al.
  1.50
• Permutation-Invariant Spectral Learning via Dyson Diffusion (2025)
  Tassilo Schwarz et al.
  1.44
• Observer-Based Source Localization in Tree Infection Networks via Laplace Transforms (2025)
  Kesler O'Connor et al.
  1.44
• The Diameter of (Threshold) Geometric Inhomogeneous Random Graphs (2025)
  Zylan Benjert et al.
  1.44
• Boltzmann Graph Ensemble Embeddings for Aptamer Libraries (2025)
  Starlika Bauskar and Jade Jiao and Narayanan Kannan and Alexander Kimm and Justin M. Baker and Matthew J. Tyler and Andrea L. Bertozzi and Anne M. Andrews
  1.44
• Learning from one graph: transductive learning guarantees via the geometry of small random worlds (2025)
  Nils Detering et al.
  1.39
• A Cycle Walk for Sampling Measures on Spanning Forests for Redistricting (2025)
  Daryl R. DeFord et al.
  1.39
• Modularity and random graphs (2025)
  Colin McDiarmid and Fiona Skerman
  1.39
• Multi-Community Spectral Clustering for Geometric Graphs (2025)
  Luiz Emilio Allem and Konstantin Avrachenkov and Carlos Hoppen and Hariprasad Manjunath and Lucas Siviero Sibemberg
  1.33
• Assortativity in geometric and scale-free networks (2025)
  Marc Kaufmann and Ulysse Schaller and Thomas Bl\"asius and Johannes Lengler
  1.33
• Quality control in sublinear time: a case study via random graphs (2025)
  Cassandra Marcussen et al.
  1.33
• The Generalized Friendship Paradox for Spectral Centralities (2025)
  Rajat Subhra Hazra et al.
  1.28
• Weighted Random Dot Product Graphs (2025)
  Bernardo Marenco et al.
  1.17
• Cascades on Constrained Multiplex Networks (2025)
  Christian Kluge et al.
  1.17
• Graph Alignment via Birkhoff Relaxation (2025)
  Sushil Mahavir Varma et al.
  1.06
• Detecting Arbitrary Planted Subgraphs in Random Graphs (2025)
  Dor Elimelech and Wasim Huleihel
  1.06
• Computational Lower Bounds for Correlated Random Graphs via Algorithmic Contiguity (2025)
  Zhangsong Li
  1.00
• Private Synthetic Graph Generation and Fused Gromov-Wasserstein Distance (2025)
  Leoni Carla Wirth et al.
  1.00
• The feasibility of multi-graph alignment: a Bayesian approach (2025)
  Louis Vassaux et al.
  1.00
• Stationary distribution of node2vec random walks on household models (2025)
  Lars Schroeder and Clara Stegehuis
  1.00
• Residual connections provably mitigate oversmoothing in graph neural networks (2025)
  Ziang Chen et al.
  0.94
• BN-Pool: Bayesian Nonparametric Pooling for Graphs (2025)
  Daniele Castellana et al.
  0.94
• Local Limits of Small World Networks (2025)
  Yeganeh Alimohammadi et al.
  0.94
• Sharp exact recovery threshold for two-community Euclidean random graphs (2025)
  Julia Gaudio et al.
  0.94
• Robust Multi-object Matching via Iterative Reweighting of the Graph Connection Laplacian (2020)
  Yunpeng Shi et al.
  —
• Learning Sparse Graphons and the Generalized Kesten-Stigum Threshold (2020)
  Emmanuel Abbe et al.
  —
• The Spectrum of Fisher Information of Deep Networks Achieving Dynamical Isometry (2020)
  Tomohiro Hayase et al.
  —
• Estimation of dense stochastic block models visited by random walks (2020)
  Viet Chi Tran et al.
  —