本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2022-08-23
摘要
is essential in several fields. The straightforward approach consists of calculating all the eigenvalues in O(n3) (where n is the number of nodes in the 網絡) and then counting the ones that belong to the interval [a,b]. Another approach is to use Sylvester’s law of inertia, which also requires O(n3). Although both methods provide the exact number of eigenvalues in [a,b], their application for large 網絡s is 計算ly infeasible. Sometimes, an approximation of μ[a,b] is enough. In this case, Chebyshev’s method approximates μ[a,b] in O(|E|) (where |E| is the number of edges). This study presents two alternatives to compute μ[a,b] for locally tree-like 網絡s: edge- and degree-based algorithms. The former presented a better accuracy than Chebyshev’s method. It runs in O(d|E|), where d is the number of i
※ 此為已發表論文，全文需透過期刊付費取得