PureRank: 一种无参数的网络节点递归重要性度量
PureRank: A parameter-free recursive importance measure for network nodes
AI总结:
PureRank基于递归重要性定义(RDI)提出无参数网络节点重要性度量方法,通过强连通分量分解分类节点,利用Katz方程参数选择计算局部重要性向量,并聚合得到PureRank向量,实验表明其在不同网络结构下具有不同的相似性表现。
摘要:
本文开发了PureRank,一种基于递归定义重要性(RDI)的无参数网络节点重要性度量方法。对于任意有向网络,PureRank通过强连通分量分解将节点分为递归、暂态和悬垂类,并根据RDI原则在类受限子网络上选择Katz方程参数计算局部重要性向量,最后将这些向量聚合为PureRank向量。该模块化设计支持并行和增量计算,同时保留统一的随机游走解释。在三个SNAP网络上的数值实验表明,PageRank在计算效率上优于PureRank,除非阻尼因子d接近1。PageRank与PureRank的相似性取决于d和节点分类。在完全递归网络中,相似性随d单调增加,当d=0.999时,Kendall's τ_b=0.966,Pearson相关系数=1.000。而在两种暂态主导网络中,相似性随d变化非单调。PureRank被扩展到多属性网络。
英文摘要:
This study develops PureRank, a parameter-free importance measure for network nodes based on the recursive definition of importance (RDI). For any directed network, PureRank uniquely determines an importance score vector without user-specified parameters. PureRank can thus provide a neutral reference for parameter-dependent importance measures. PureRank is constructed in three steps: (i) nodes are classified into {\it recurrent}, {\it transient}, and {\it dangling} classes via strongly connected component decomposition; (ii) for each class, the local importance vector is obtained by choosing the parameters of the Katz equation on the class-restricted subnetwork according to the RDI principle; and (iii) the local importance vectors are aggregated into the PureRank vector. This modular design supports parallel and incremental computation while retaining a unified random-surfer interpretation. Numerical experiments on three SNAP networks show that PageRank has a computational advantage over PureRank except when the damping factor $d$ is close to one, and that the similarity of PageRank to PureRank depends on $d$ and the node classification. In the fully recurrent network, similarity increases monotonically with $d$ and reaches Kendall's $τ_b=0.966$ and Pearson correlation coefficient $=1.000$ at $d=0.999$, whereas in the two transient-dominated networks, similarity varies nonmonotonically with $d$. PureRank is extended to multi-attribute networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。