超越对称化:针对(无)符号有向图的有效邻接矩阵与重整化
Beyond symmetrization: effective adjacency matrices and renormalization for (un)singed directed graphs
AI总结:
本文提出有效邻接矩阵概念,将通用图映射为无符号无向图,从而直接应用现有无向图工具集,并利用Hodge-Helmholtz分解探究形变算子与有效矩阵的相互作用。
摘要:
为了处理有向图和/或符号图的特性,新的拉普拉斯算子应运而生。例如,在方向性方面,我们遇到了磁算子、膨胀算子(其研究尚不充分)、基于随机游走的算子等等。这些新算子的定义引发了对新研究和概念的需求,进而促使了新计算工具的开发。但这真的有必要吗?在这项工作中,我们定义了有效邻接矩阵的概念,它源于形变拉普拉斯算子(如磁算子、膨胀算子和信号算子)的定义。这些有效矩阵能够将通用图映射到一族无符号无向图,从而使得我们可以应用已被充分探索的无向图度量、机器学习方法和重整化群工具集。为了探究形变算子与有效矩阵之间的相互作用,我们展示了 Hodge-Helmholtz 分解如何帮助我们驾驭这一复杂性。
英文摘要:
To address the peculiarities of directed and/or signed graphs, new Laplacian operators have emerged. For instance, in the case of directionality, we encounter the magnetic operator, dilation (which is underexplored), operators based on random walks, and so forth. The definition of these new operators leads to the need for new studies and concepts, and consequently, the development of new computational tools. But is this really necessary? In this work, we define the concept of effective adjacency matrices that arise from the definition of deformed Laplacian operators such as magnetic, dilation, and signal. These effective matrices allow mapping generic graphs to a family of unsigned, undirected graphs, enabling the application of the well-explored toolkit of measures, machine learning methods, and renormalization groups of undirected graphs. To explore the interplay between deformed operators and effective matrices, we show how the Hodge-Helmholtz decomposition can assist us in navigating this complexity.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。