We examine the relationship of a graph G and its random subgraphs which are defined by independently choosing each edge with probability p. Suppose that G has a spectral gap λ (...
We present a new model for self-organizing networks such as the web graph, and analyze its limit behaviour. In the model, new vertices are introduced over time that copy the neighb...
In this paper we suggest evaluating the importance of a website with the mean frequency of visiting the website for the Markov chain on the Internet Graph describing random surfi...
Today’s search engines are increasingly required to broaden their capabilities beyond free-text search. More complex features, such as supporting range constraints over numeric ...
Marcus Fontoura, Ronny Lempel, Runping Qi, Jason Y...
Abstract. In this paper, we consider the problem of calculating fast and accurate approximations to the personalized PageRank score of a webpage. We focus on techniques to improve ...
We present a peer-to-peer service management middleware that dynamically allocates system resources to a large set of applications. The system achieves scalability in number of no...
Constantin Adam, Rolf Stadler, Chunqiang Tang, Mal...
Recent work on modeling the web graph has dwelt on capturing the degree distributions observed on the web. Pointing out that this represents a heavy reliance on "local" p...