论文标题
网络导航使用页面等级随机步行
Network navigation using Page Rank random walks
论文作者
论文摘要
我们基于连续的时间近似引入形式主义，以研究页面等级随机步行的特征。我们发现，占用概率的扩散具有一种动力学，该动力学呈指数级“忘记”初始条件，并将其定位为仅取决于网络特征的稳态状态。在步行从单个节点开始的特殊情况下，我们发现过渡值的最大特征值（lambda = 1）不促进动态，并且概率沿相应特征向量的方向恒定。我们研究了访问新节点的过程，我们发现它具有与占用概率相似的动态。最后，我们确定节点之间的平均运输时间<t>，我们发现与征税步行的相应时间表现出一定的联系。这些结果的相关性存在于该页面等级，这是个人搜索行为的更合理模型，可以证明表现出类似于Levy Walks的功能，而该功能又显示为“区域受限搜索”的常见大规模搜索策略的合理模型。
We introduce a formalism based on a continuous time approximation, to study the characteristics of Page Rank random walks. We find that the diffusion of the occupancy probability has a dynamics that exponentially "forgets" the initial conditions and settles to a steady state that depends only on the characteristics of the network. In the special case in which the walk begins from a single node, we find that the largest eigenvalue of the transition value (lambda=1) does not contribute to the dynamic and that the probability is constant in the direction of the corresponding eigenvector. We study the process of visiting new node, which we find to have a dynamic similar to that of the occupancy probability. Finally, we determine the average transit time between nodes <T>, which we find to exhibit certain connection with the corresponding time for Levy walks. The relevance of these results reside in that Page Rank, which are a more reasonable model for the searching behavior of individuals, can be shown to exhibit features similar to Levy walks, which in turn have been shown to be a reasonable model of a common large scale search strategy known as "Area Restricted Search".
