Abstract
Many natural and man-made systems can be represented as graphs, sets of objects (called nodes) and pairwise relations between these objects (called edges). These include the brain, which contains neurons (nodes) that exchange signals through chemical pathways (edges), the Internet, which contains websites (nodes) that are connected via hyperlinks (edges), etc. To study graphs, researchers in diverse domains have used Personalized PageRank (PPR) [6]. Informally, PPR assigns to each node v a vector πv , where πv (w) describes the importance or relevance of node w from the perspective ofv. PPR has proven useful in many applications, both practical and graph-theoretic. Examples include recommending who a user should follow on Twitter [7] (v may wish to follow w if πv (w) is large) and local graph partitioning [2] (the set of nodesw with large πv (w) can be viewed as a community surrounding v).
- Reid Andersen, Christian Borgs, Jennifer Chayes, John Hopcroft, Vahab Mirrokni, and Shang-Hua Teng. 2008. Local computation of PageRank contributions. Internet Mathematics 5, 1--2 (2008), 23--45.Google Scholar
Cross Ref
- Reid Andersen, Fan Chung, and Kevin Lang. 2006. Local graph partitioning using PageRank vectors. In 2006 IEEE Symposium on Foundations of Computer Science. IEEE, 475--486.Google Scholar
Digital Library
- Charles Bordenave, Pietro Caputo, and Justin Salez. 2018. Random walk on sparse random digraphs. Probability Theory and Related Fields 170, 3--4 (2018), 933--960.Google Scholar
Cross Ref
- Ningyuan Chen, Nelly Litvak, and Mariana Olvera-Cravioto. 2017. Generalized PageRank on directed configuration networks. Random Structures & Algorithms 51, 2 (2017), 237--274.Google Scholar
Cross Ref
- Ningyuan Chen and Mariana Olvera-Cravioto. 2013. Directed random graphs with given degree distributions. Stochastic Systems 3, 1 (2013), 147--186.Google Scholar
Cross Ref
- David F Gleich. 2015. PageRank beyond the Web. SIAM Rev. 57, 3 (2015), 321--363.Google Scholar
Digital Library
- Pankaj Gupta, Ashish Goel, Jimmy Lin, Aneesh Sharma, Dong Wang, and Reza Zadeh. 2013. WTF: The who to follow service at Twitter. In Proceedings of the 22nd international conference on World Wide Web. ACM, 505--514.Google Scholar
Digital Library
- Glen Jeh and Jennifer Widom. 2003. Scaling personalizedweb search. In Proceedings of the 12th International Conference on World Wide Web. ACM, 271--279.Google Scholar
Digital Library
Recommendations
A Structural Result for Personalized PageRank and its Algorithmic Consequences
Many systems, such as the Internet, social networks, and the power grid, can be represented as graphs. When analyzing graphs, it is often useful to compute scores describing the relative importance or distance between nodes. One example is Personalized ...
Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
Clique separator decomposition, introduced by Whitesides and Tarjan, is one of the most important graph decompositions. A hole is a chordless cycle with at least five vertices. A paraglider is a graph with five vertices a ...
A Structural Result for Personalized PageRank and its Algorithmic Consequences
SIGMETRICS '19: Abstracts of the 2019 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer SystemsMany systems, such as the Internet, social networks, and the power grid, can be represented as graphs. When analyzing graphs, it is often useful to compute scores describing the relative importance or distance between nodes. One example is Personalized ...






Comments