arXiv:2505. 03649v4 Announce Type: replace-cross Abstract: Modeling of intricate relational patterns has become a cornerstone of contemporary statistical research and related data science fields.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.
The paper introduces a moment-guided edge sampling framework that quantifies how local edge edits affect global graph structure using spectral moments of the random-walk transition matrix. Two complementary methods— a combinatorial closed‑form update for low‑order moments and a low‑rank approach exploiting locality and cyclic trace invariance— enable efficient computation of moment changes for single or batched edits. These moment changes serve as interpretable structural signatures, and preserving them is shown to retain key graph properties such as triangle‑weighted clustering, while also improving performance in supervised node classification and graph contrastive learning.
arXiv:2606. 00934v1 Announce Type: cross Abstract: Network data are ubiquitous across the social sciences, biology, and information systems.
arXiv:2510. 03690v4 Announce Type: replace Abstract: Real-world graph datasets often arise from mixtures of populations, where graphs are generated by multiple distinct underlying distributions.
arXiv:2608. 10845v1 Announce Type: cross Abstract: Spectral clustering methods for network data are commonly based on a few matrix representations, such as the adjacency matrix and the symmetric Laplacian.
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:2607. 10074v1 Announce Type: new Abstract: Graph machine learning provides powerful tools for understanding complex networks and learning meaningful node representations.