arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.03763math.OC
收藏

在simplicial复形上优化加权Hodge拉普拉斯流

Optimizing Weighted Hodge Laplacian Flows on Simplicial Complexes

University of Oslo(奥斯陆大学);DAS Lab(DAS实验室);Department of Mechanical Engineering at University of Texas, Dallas(德克萨斯大学达拉斯分校机械工程系)

Mathias Hudoba de Badyn, Tyler Summers

AI总结:

本文提出了一种基于加权Hodge拉普拉斯流的框架,通过半正定规划优化权重,以提高网络动态性能。

摘要:

simplicial复形是图的推广,用于描述图中节点之间的高阶网络交互。由图拉普拉斯流描述的网络动态在网络科学和控制理论中已被广泛研究,这些可以使用Hodge拉普拉斯来推广到simplicial复形。我们研究了在simplicial复形上的加权Hodge拉普拉斯流。特别是,我们开发了一个基于加权Hodge拉普拉斯流的加权共识动力学框架,并展示了加权Hodge拉普拉斯的分解结果。然后我们证明了加权Hodge拉普拉斯的两个关键谱函数,即伪逆的迹和最小非零特征值,在上和下simplicial权重中是联合凸的,并且可以表示为半正定规划。因此,可以高效地确定全局最优权重以优化这些函数的流。数值实验表明,最优权重可以显著提高这些指标,与均匀权重相比。

英文摘要:

Simplicial complexes are generalizations of graphs that describe higher-order network interactions among nodes in the graph. Network dynamics described by graph Laplacian flows have been widely studied in network science and control theory, and these can be generalized to simplicial complexes using Hodge Laplacians. We study weighted Hodge Laplacian flows on simplicial complexes. In particular, we develop a framework for weighted consensus dynamics based on weighted Hodge Laplacian flows and show some decomposition results for weighted Hodge Laplacians. We then show that two key spectral functions of the weighted Hodge Laplacians, the trace of the pseudoinverse and the smallest non-zero eigenvalue, are jointly convex in upper and lower simplex weights and can be formulated as semidefinite programs. Thus, globally optimal weights can be efficiently determined to optimize flows in terms of these functions. Numerical experiments demonstrate that optimal weights can substantially improve these metrics compared to uniform weights.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑