Spectral Braids：用拓扑辫子刻画动态有向网络的新方法
Spectral Braids: A Topological Descriptor for Dynamic Directed Networks
作者把复数特征值随时间的缠绕路径变成一条拓扑辫子，再用 Burau 表示转成特征向量，四分类做到 97.1%，比不追踪特征值的基线 44.5% 高出一大截，图机器学习方向值得看看。
一篇 arXiv 论文提出 spectral braids 方法，处理动态有向网络。每个时间快照被聚合成社区级转移矩阵，其复数特征值随时间在复平面上运动的缠绕轨迹被编码为一条辫子，再用 Burau 表示映射成固定长度特征向量。在四类合成在线社区网络的动态分类任务上，该方法达到 97.1% 准确率，对比不追踪特征值的最佳特征集 44.5%。Burau 特征还能区分事件顺序不同、但交叉次数相同的网络。论文称这是首个在图数据上定义辫子与辫子单值化并用于动态网络学习的做法。
Spectral Braids: A Topological Descriptor for Dynamic Directed Networks
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 is a braid, a classical object from topology. We propose spectral braids, a methodology for dynamic directed networks: each snapshot is aggregated into a community-level transition matrix, its complex eigenvalues are tracked over time, and the braid they trace is read off as a word. The word is then mapped to a matrix by the Burau representation, which gives a fixed-size feature vector for any classifier. The braid has a concrete meaning: each eigenvalue describes how a group of communities behaves, and each crossing records one group overtaking another. We evaluate the method on dynamic network classification, using synthetic networks of online communities whose labels describe how the network evolved between the same starting and ending states. Our experimental results show that the proposed features reach 97.1% accuracy on four classes, against 44.5% for the best feature set that does not track eigenvalues, and that the Burau features also separate networks containing the same events in a different order, which simple counts of crossings cannot do. To the best of our knowledge, this is the first study that defines braids and braid monodromy on graph data and uses them as features for learning on dynamic networks.