论文标题
重新审视随机冲浪：概括Pagerank的传送模型
Random Surfing Revisited: Generalizing PageRank's Teleportation Model
论文作者
论文摘要
我们重新审视随机冲浪者模型，重点是忽略的 - 缩放组件，并介绍了Ncdawarerank；一个新颖的排名框架，旨在利用网络元信息及其高阶结构组织的各个方面，以保留数学结构和Pagerank的有吸引力的计算特征。对拟议模型的严格理论探索揭示了许多数学属性，这些属性在鲁棒性，可计算性以及对灵活性和表现力进行建模方面需要切实的好处。一组实验网络的实验验证了NCDAWARERANK的理论预测属性，并将其作为网络中心度度量的有效性展示。
We revisit the Random Surfer model, focusing on its--often overlooked--Teleportation component, and we introduce NCDawareRank; a novel ranking framework designed to exploit network meta-information as well as aspects of its higher-order structural organization in a way that preserves the mathematical structure and the attractive computational characteristics of PageRank. A rigorous theoretical exploration of the proposed model reveals a wealth of mathematical properties that entail tangible benefits in terms of robustness, computability, as well as modeling flexibility and expressiveness. A set of experiments on real-work networks verify the theoretically predicted properties of NCDawareRank, and showcase its effectiveness as a network centrality measure.
