具有随机链接模型的有向网络的谱统计
Spectral Statistics of Directed Networks with Random Link Model Transpose-Asymmetry
摘要:
随机网络通过在网络迭代矩阵特征值中产生不确定性来影响复杂的图滤波器设计,图滤波器响应的定义点。虽然联合统计的特征值通常逃避分析,可预测的谱渐近可以出现大规模的网络。以前发表的作品成功地分析了由无向图和具有转置对称分布的有向图描述的大规模网络,重点是作为应用的时不变网络的共识加速滤波器设计。这项工作扩展了这些结果,使分析某些大规模的有向网络描述的转置非对称分布。具体地说,高效可计算的谱密度近似是可能的转置非对称渗流网络模型与节点传递对称群和正常的平均矩阵。数值模拟支持派生的近似和应用程序的共识过滤器。
英文摘要:
Stochastic network influences complicate graph filter design by producing uncertainty in network iteration matrix eigenvalues, the points at which the graph filter response is defined. While joint statistics for the eigenvalues typically elude analysis, predictable spectral asymptotics can emerge for large scale networks. Previously published works successfully analyze large-scale networks described by undirected graphs and directed graphs with transpose-symmetric distributions, focusing on consensus acceleration filter design for time-invariant networks as an application. This work expands upon these results by enabling analysis of certain large-scale directed networks described by transpose-asymmetric distributions. Specifically, efficiently computable spectral density approximations are possible for transpose-asymmetric percolation network models with node-transitive symmetry group and normal mean matrix. Numerical simulations support the derived approximations and application to consensus filters.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。