arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1803.06146math.PR
收藏

PageRank的本地weak convergence

Local weak convergence for PageRank

Alessandro Garavaglia, Remco van der Hofstad, Nelly Litvak

摘要:

PageRank是一种用于测量网络中心性的著名算法。它最初是由Google提出的,用于对万维网中的页面进行排名。PageRank的一个有趣的经验性质是所谓的“幂律假设”:在无标度网络中,PageRank分数遵循幂律,其指数与(in-)度相同。到目前为止,这一假设已被证实的经验和几个特定的随机图模型。相比之下,本文不专注于一个随机图模型,但研究的存在性的渐近PageRank分布,当图的大小趋于无穷大,使用局部弱收敛。这可能有助于确定幂律假设成立的一般网络结构。本文从(随机)无向图序列的局部弱收敛的定义出发,将这一概念推广到有向图。为此,我们定义了一个探索过程中的有向设置,保持跟踪的顶点的进出度。然后我们用它来证明渐近PageRank分布的存在性。因此,PageRank的限制分布可以直接计算为限制对象的函数。我们将我们的结果应用到定向配置模型和连续时间分支过程树,以及优先连接模型。

英文摘要:

PageRank is a well-known algorithm for measuring centrality in networks. It was originally proposed by Google for ranking pages in the World-Wide Web. One of the intriguing empirical properties of PageRank is the so-called `power-law hypothesis': in a scale-free network the PageRank scores follow a power law with the same exponent as the (in-)degrees. Up to date, this hypothesis has been confirmed empirically and in several specific random graphs models. In contrast, this paper does not focus on one random graph model but investigates the existence of an asymptotic PageRank distribution, when the graph size goes to infinity, using local weak convergence. This may help to identify general network structures in which the power-law hypothesis holds. We start from the definition of local weak convergence for sequences of (random) undirected graphs, and extend this notion to directed graphs. To this end, we define an exploration process in the directed setting that keeps track of in- and out-degrees of vertices. Then we use this to prove the existence of an asymptotic PageRank distribution. As a result, the limiting distribution of PageRank can be computed directly as a function of the limiting object. We apply our results to the directed configuration model and continuous-time branching processes trees, as well as preferential attachment models.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑