cs.SI · 2026-10-29 · No. 157
Social and Information Networks, 2026-10-29.
1 new papers in cs.SI. Titles, authors,
abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →
01 — The papers
1 entries-
01
Spectral Braids: A Topological Descriptor for Dynamic Directed Networks
Mehmet Emin Aktas, Esra Akbas
cs.SI · cs.LG
Eigenvalues are a workhorse of graph machine learning: spectral clustering, spectral graph neural networks, and graph kernels all summarize a network by the eigenvalues of a matrix. These eigenvalues are almost always treated as a static list of numbers. When a graph changes, however, its eigenvalues move, and when the matrix is not symmetric, they move in the complex plane, where they can wind around each other. The pattern of this winding...
This edition is part of The Daily Abstract — cs.SI archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.
#D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.