无标度随机图中的PageRank
PageRank in scale-free random graphs
摘要:
我们分析了有向配置模型上的PageRank分布,并表明随着图的大小增长到无穷大,它可以通过适当构造的树的根节点的PageRank来近似。这棵树的近似是反过来关系到一个线性随机不动点方程,已在最近的文献中进行了深入研究的解决方案。
英文摘要:
We analyze the distribution of PageRank on a directed configuration model and show that as the size of the graph grows to infinity it can be closely approximated by the PageRank of the root node of an appropriately constructed tree. This tree approximation is in turn related to the solution of a linear stochastic fixed point equation that has been thoroughly studied in the recent literature.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。