GravityGraphSAGE adapts GraphSAGE with a gravity-inspired decoder to outperform prior graph deep learning methods on directed link prediction across citation networks and 16 real-world graphs.
Title resolution pending
5 Pith papers cite this work. Polarity classification is still indexing.
years
2026 5verdicts
UNVERDICTED 5representative citing papers
Empirical integral operators with discontinuous non-negative symmetric kernels converge spectrally to their population versions with explicit rates as sample size grows to infinity.
CADI quantifies the preservation of relative cluster angles in low-dimensional projections using internal angles from point triples.
LoGraB creates fragmented graph benchmarks with controls for radius, spectral quality, noise, and coverage, while AFR reconstructs faithful graph islands from spectral patches using fidelity scoring, RANSAC-Procrustes alignment, and adaptive stitching, supported by recovery proofs and strong results
A spectral framework for nonlinear DR uses spectral bases plus cross-entropy optimization to create multi-scale embeddings that preserve both global manifold geometry and local neighborhoods while supporting graph-frequency analysis.
citing papers explorer
-
GravityGraphSAGE: Link Prediction in Directed Attributed Graphs
GravityGraphSAGE adapts GraphSAGE with a gravity-inspired decoder to outperform prior graph deep learning methods on directed link prediction across citation networks and 16 real-world graphs.
-
Spectral convergence of empirical integral operators with discontinuous kernels
Empirical integral operators with discontinuous non-negative symmetric kernels converge spectrally to their population versions with explicit rates as sample size grows to infinity.
-
Class Angular Distortion Index for Dimensionality Reduction
CADI quantifies the preservation of relative cluster angles in low-dimensional projections using internal angles from point triples.
-
Spectral Embeddings Leak Graph Topology: Theory, Benchmark, and Adaptive Reconstruction
LoGraB creates fragmented graph benchmarks with controls for radius, spectral quality, noise, and coverage, while AFR reconstructs faithful graph islands from spectral patches using fidelity scoring, RANSAC-Procrustes alignment, and adaptive stitching, supported by recovery proofs and strong results
-
A Spectral Framework for Multi-Scale Nonlinear Dimensionality Reduction
A spectral framework for nonlinear DR uses spectral bases plus cross-entropy optimization to create multi-scale embeddings that preserve both global manifold geometry and local neighborhoods while supporting graph-frequency analysis.