最优图拉普拉斯算子
Optimal Graph Laplacian
摘要:
本文提供了一种构造最接近图拉普拉斯矩阵的方法,从测量数据的图拉普拉斯动力学,包括生化系统,同步系统,和多智能体系统。我们考虑网络结构的情况,即,已知给定图的边的连接关系。将寻找最近图拉普拉斯算子的问题转化为一个凸优化问题。因此,我们的问题可以解决使用内点方法。然而,内点法的每次迭代的复杂度是$O(n^6)$,其中$n$是网络的节点数。也就是说,如果$n$很大,则内点方法不能在实际时间内解决我们的问题。为了解决这个问题,我们提出了一个简单而有效的算法的计算复杂度为$O(n^2)$。仿真实验表明,我们的方法是有用的执行数据驱动的建模图拉普拉斯动力学。
英文摘要:
This paper provides a construction method of the nearest graph Laplacian to a matrix identified from measurement data of graph Laplacian dynamics that include biochemical systems, synchronization systems, and multi-agent systems. We consider the case where the network structure, i.e., the connection relationship of edges of a given graph, is known. A problem of finding the nearest graph Laplacian is formulated as a convex optimization problem. Thus, our problem can be solved using interior point methods. However, the complexity of each iteration by interior point methods is $O(n^6)$, where $n$ is the number of nodes of the network. That is, if $n$ is large, interior point methods cannot solve our problem within a practical time. To resolve this issue, we propose a simple and efficient algorithm with the calculation complexity $O(n^2)$. Simulation experiments demonstrate that our method is useful to perform data-driven modeling of graph Laplacian dynamics.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。