Add to ORKGCan one assess, by visiting only a small portion of a graph, if a given node has a signicantly higher PageRank score than another? We show that the answer strongly depends on the interplay between the required correctness guarantees (is one willing to accept a small probability of error?) and the graph exploration model (can one only visit parents and children of already visited nodes?)
The “Local Ranking Problem ” (LRP) is related to the com-putation of a centrality-like rank on a loc...
PageRank is a topological measure of the authority of Web pages which is adopted by Google search en...
To what extent can changes in PageRank's damping factor affect node ranking? We prove that, at least...
Can one assess, by visiting only a small portion of a graph, if a given node has a signicantly highe...
Can one assess, by visiting only a small portion of a graph, if a given node has a significantly hig...
International audienceCan one assess, by visiting only a small portion of a graph, if a given node h...
Imagine you are a social network user who wants to search, in a list of potential candidates, for th...
Imagine you are a social network user who wants to search, in a list of potential candidates, for th...
Search engines are a key factor shaping the way people interact with today’s worldwide web. It is th...
Can one compute the pageRank score of a single, arbitrary node in a graph, exploring only a vanishin...
Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often de...
The problem of approximating the PageRank score of a node with minimal information about the rest of...
PageRank is a key element in the success of search engines, allowing to rank the most important hits...
Page Rank is a well-known algorithm for measuring centrality in networks. It was originally proposed...
PageRank is a well-known algorithm for measuring centrality in net-works. It was originally proposed...
The “Local Ranking Problem ” (LRP) is related to the com-putation of a centrality-like rank on a loc...
PageRank is a topological measure of the authority of Web pages which is adopted by Google search en...
To what extent can changes in PageRank's damping factor affect node ranking? We prove that, at least...
Can one assess, by visiting only a small portion of a graph, if a given node has a signicantly highe...
Can one assess, by visiting only a small portion of a graph, if a given node has a significantly hig...
International audienceCan one assess, by visiting only a small portion of a graph, if a given node h...
Imagine you are a social network user who wants to search, in a list of potential candidates, for th...
Imagine you are a social network user who wants to search, in a list of potential candidates, for th...
Search engines are a key factor shaping the way people interact with today’s worldwide web. It is th...
Can one compute the pageRank score of a single, arbitrary node in a graph, exploring only a vanishin...
Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often de...
The problem of approximating the PageRank score of a node with minimal information about the rest of...
PageRank is a key element in the success of search engines, allowing to rank the most important hits...
Page Rank is a well-known algorithm for measuring centrality in networks. It was originally proposed...
PageRank is a well-known algorithm for measuring centrality in net-works. It was originally proposed...
The “Local Ranking Problem ” (LRP) is related to the com-putation of a centrality-like rank on a loc...
PageRank is a topological measure of the authority of Web pages which is adopted by Google search en...
To what extent can changes in PageRank's damping factor affect node ranking? We prove that, at least...