本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2024-12-03
摘要
The leading eigenvalue A of the adjacency matrix of a graph exerts much influence on the behavior of dynamical processes on that graph. It is thus relevant to relate notions of importance of 網絡 structures to A and its associated eigenvectors. We study a previously derived measure of edge importance known as "dynamical importance," which estimates how much A changes when one removes an edge from a graph or adds an edge to it. We examine the accuracy of this estimate for several undirected 網絡 structures and compare it to the relative change in A after an edge removal or edge addition. We then derive a first-order approximation of the change in the leading eigenvector. We also consider the effects of edge additions on Kuramoto dynamics on 網絡s, and we express the Kuramoto order parameter in te
※ 此為已發表論文，全文需透過期刊付費取得