Multilinear pagerank

SIAM Journal on Matrix Analysis and Applications

Volumn 36, Issue 4, 2015, Pages 1507-1541

  Gleich, David F ^a   Lim, Lek Heng ^b   Yu, Yongyang ^a  

^a Purdue University   (United States)

^b UNIVERSITY OF CHICAGO   (United States)

Author keywords

Graphs; Higher Order Markov Chains; Higher Order Pagerank; Hypermatrix; Multilinear Pagerank; Pagerank; Spacey Random Surfer; Tensor; Tensor Page Rank

Indexed keywords

CHAINS; ITERATIVE METHODS; POLYNOMIAL APPROXIMATION; POLYNOMIALS; RANDOM PROCESSES; STOCHASTIC SYSTEMS; TENSORS;

GRAPHS; HIGHER-ORDER MARKOV CHAINS; HYPERMATRIX; PAGE RANKS; PAGERANK; SPACEY RANDOM SURFER;

MARKOV PROCESSES;

EID: 84960395639     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/140985160     Document Type: Article

References (36)

1. A. Anandkumar, D. Hsu, M. Janzamin, and S. Kakade (2013), When are Overcomplete Topic Models Identifiable? Uniqueness of Tensor Tucker Decompositions with Structured Sparsity, arXiv:1308.2853, 2013.
2. M. Benäim (1997), Vertex-reinforced random walks and a conjecture of Pemantle, Ann. Probab., 25, pp. 361-392; also available online from http://projecteuclid.org/euclid.aop/1024404292.
3. A. Benson, D. F. Gleich, and J. Leskovec (2015), Tensor spectral clustering for partitioning higher-order network structures, in Proceedings of the 2015 SIAM International Conference on Data Mining, Vancouver, BC, pp. 118-126; doi:10.1137/1.9781611974010.14.
4. A. Benson, D. F. Gleich, and L.-H. Lim (2015), The Spacey Random Walk: A stochastic Process for Higher-Order Data, In preparation.
5. P. Boldi, R. Posenato, M. Santini, and S. Vigna (2007), Traps and pitfalls of topic-biased PageRank, in Proceedings of the Fourth International Workshop on Algorithms and Models for the Web-Graph WAW2006, pp. 107-116; doi:10.1007/978-3-540-78808-9 10.
6. K. C. Chang, K. Pearson, and T. Zhang (2008), Perron-Frobenius theorem for nonnegative tensors, Commun. Math. Sci. 6, pp. 507-520; doi:10.4310/CMS.2008.v6.n2.a12.
7. M. T. Chu and S.-J. Wu (2014), On the Second Dominant Eigenvalue Affecting the Power Method for Transition Probability Tensors, http://www4.ncsu.edu/mtchu/Research/Papers/power tpt 02.pdf.
8. J. Draisma and J. Kuttler (2014), Bounded-rank tensors are defined in bounded degree, Duke Math. J., 163, pp. 35-63; doi:10.1215/00127094-2405170.
9. V. Freschi (2007), Protein function prediction from interaction networks using a random walk ranking algorithm, in Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering (BIBE 2007), pp. 42-48; doi:10.1109/BIBE.2007.4375543.
10. S. Friedland, S. Gaubert, and L. Han (2013), Perron-Frobenius theorem for nonnegative multilinear forms and extensions, Linear Algebra Appl., 438, pp. 738-749; doi:10.1016/j.laa.2011.02.042.
11. G. Frobenius (1908), Uber matrizen aus positiven elementen, 1, Sitzungsber. Königl. Preuss. Akad. Wiss., pp. 471-476.
12. D. F. Gleich (2015), PageRank beyond the web, SIAM Rev., 57, pp. 321-363; doi:10.1137/140976649.
13. D. F. Gleich, A. P. Gray, C. Greif, and T. Lau (2010), An inner-outer iteration for PageRank, SIAM J. Sci. Comput., 32, pp. 349-371; doi:10.1137/080727397.
14. G. H. Golub and C. van Loan (2013), Matrix Computations, Johns Hopkins University Press, Baltimore, 2013.
15. C. Klymko, D. F. Gleich, and T. G. Kolda (2014), Using triangles to improve community detection in directed networks, in Proceedings of the ASE BigData Conference; also available online from http://www.ase360.org/handle/123456789/104.
16. T. G. Kolda and J. R. Mayo (2011), Shifted power method for computing tensor eigenpairs, SIAM J. Matrix Anal. Appl., 32, pp. 1095-1124; doi:10.1137/100801482.
17. A. N. Langville and C. D. Meyer (2006), Googles PageRank and Beyond: The Science of Search Engine Rankings, Princeton University Press, Princeton, NJ.
18. J. Leskovec, D. Huttenlocher, and J. Kleinberg (2010), Governance in social media: A case study of the Wikipedia promotion process, in Proceedings of the Fourth International AAAI Conference onWeblogs and Social Media, pp. 98-105; http://www.aaai.org/ocs/index.php/ICWSM/ICWSM10/paper/view/1485/1841.
19. W. Li and M. K. Ng (2013), On the limiting probability distribution of a transition probability tensor, Linear Multilinear Algebra, pp. 1-24; doi:10.1080/03081087.2013.777436.
20. X. Li and M. Ng (2015), Solving sparse non-negative tensor equations: Algorithms and applications, Front. Math. China, 10, pp. 649-680; doi:10.1007/s11464-014-0377-3.
21. X. Li, M. Ng, and Y. Ye (2011), Finding Stationary Probability Vector of a Transition Probability Tensor Arising from a Higher-Order Markov Chain, Technical report, Hong Kong Baptist University, http://www.math.hkbu.edu.hk/mng/tensor-research/report1.pdf.
22. X. Li, M. Ng, and Y. Ye (2014), Multicomm: Finding community structure in multi-dimensional networks, IEEE Trans. Knowledge Data Engineering, 26, pp. 929-941; doi:10.1109/TKDE.2013.48.
23. X. Li, M. K. Ng, and Y. Ye (2012), HAR: Hub, authority and relevance scores in multi-relational data for query search, in Proceedings of the 2012 SIAM International Conference on Data Mining, pp. 141-152; doi:10.1137/1.9781611972825.13.
24. L.-H. Lim (2005), Singular values and eigenvalues of tensors: A variational approach, in Proceedings of the 1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, pp. 129-132; doi:10.1109/CAMAP.2005.1574201.
25. L.-H. Lim (2013), Tensors and hypermatrices, in Handbook of Linear Algebra, 2nd ed., Chapman and Hall/CRC, Boca Raton, FL, pp. 231-260; doi:10.1201/b16113-19.
26. J. L. Morrison, R. Breitling, D. J. Higham, and D. R. Gilbert (2005), GeneRank: Using search engine technology for the analysis of microarray experiments, BMC Bioinformatics, 6, p. 233; doi:10.1186/1471-2105-6-233.
27. M. K.-P. Ng, X. Li, and Y. Ye (2011), Multirank: Co-ranking for objects and relations in multirelational data, in Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1217-1225; doi:10.1145/2020408.2020594.
28. J. Nie and L. Wang (2014), Semidefinite Relaxations for Best Rank-1 Tensor Approximations, SIAM J. Matrix Anal. Appl., 35, pp. 1155-1179; doi:10.1137/130935112.
29. L. Page, S. Brin, R. Motwani, and T. Winograd (1999), The PageRank Citation Ranking: Bringing Order to the Web, Technical report 1999-66, Stanford University, Stanford, CA, http://dbpubs.stanford.edu:8090/pub/1999-66.
30. N. Parikh and S. Boyd (2014), Proximal algorithms, Found. Trends Optim., 1, pp. 127-239; doi:10.1561/2400000003.
31. R. Pemantle (1992), Vertex-reinforced random walk, Probab. Theory Related Fields, 92, pp. 117-136; doi:10.1007/BF01205239.
32. O. Perron (1907), Zur theorie der matrices, Math. Ann., 64, pp. 248-263; doi:10.1007/BF01449896.
33. L. Qi (2005), Eigenvalues of a real supersymmetric tensor, J. Symbolic Comput., 40, pp. 1302-1324; doi:10.1016/j.jsc.2005.05.007.
34. Y. Rabinovich, A. Sinclair, and A. Wigderson (1992), Quadratic dynamical systems, in Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pp. 304-313; doi:10.1109/SFCS.1992.267761.
35. R. S. Varga (1962), Matrix Iterative Analysis, Prentice-Hall, Englewood Cliffs, NJ.
36. C. Winter, G. Kristiansen, S. Kersting, J. Roy, D. Aust, T. Knösel, P. Rümmele, B. Jahnke, V. Hentrich, F. Rückert, M. Niedergethmann, W. Weichert, M. Bahra, H. J. Schlitt, U. Settmacher, H. Friess, M. Büchler, H.-D. Saeger, M. Schroeder, C. Pilarsky, and R. Grützmann (2012), Google goes cancer: Improving outcome prediction for cancer patients by network-based ranking of marker genes, PLoS Comput. Bio., 8, e1002511; doi:10.1371/journal.pcbi.1002511.