arXiv:2510. 07716v2 Announce Type: replace Abstract: We propose refined GRFs (GRFs++), a new class of Graph Random Features (GRFs) for efficient and accurate computations involving kernels defined on the nodes of a graph.
Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.
arXiv:2607. 10074v1 Announce Type: new Abstract: Graph machine learning provides powerful tools for understanding complex networks and learning meaningful node representations.
arXiv:2604. 12211v2 Announce Type: replace Abstract: Ollivier-Ricci curvature (ORC), defined via the Wasserstein distance that captures rich geometric information, has received growing attention in both theory and applications.
arXiv:2503. 06396v2 Announce Type: replace Abstract: The minimum vertex cover (MVC) problem seeks to identify the smallest set of vertices that cover all edges in an undirected graph.
arXiv:2512. 02694v3 Announce Type: replace-cross Abstract: We propose the first return time distribution (FRTD) of a random walk as an interpretable and mathematically grounded node embedding.
arXiv:2203. 04711v2 Announce Type: replace Abstract: We present a framework for embedding graph structured data into a vector space, taking into account node features and topology of a graph into the optimal transport (OT) problem.
arXiv:2605. 14981v2 Announce Type: replace Abstract: Gromov--Wasserstein (GW) distances compare graphs, shapes, and point clouds through internal distances, without requiring a common coordinate system.