PageRank on inhomogeneous random digraphs


الملخص بالإنكليزية

We study the typical behavior of a generalized version of Googles PageRank algorithm on a large family of inhomogeneous random digraphs. This family includes as special cases direct

تحميل البحث