The spacey randomwalk: A stochastic process for higher-order data

SIAM Review

Volumn 59, Issue 2, 2017, Pages 321-345

  Benson, Austin R ^a   Gleich, David F ^b   Lim, Lek Heng ^c  

^a Stanford University   (United States)

^b Purdue University   (United States)

^c UNIVERSITY OF CHICAGO   (United States)

Author keywords

Eigenvector; Random walk; Tensor; Vertex reinforced random walk

Indexed keywords

ALGEBRA; CHAINS; CONVERGENCE OF NUMERICAL METHODS; DYNAMICAL SYSTEMS; EIGENVALUES AND EIGENFUNCTIONS; MARKOV PROCESSES; NUMERICAL METHODS; POPULATION STATISTICS; REINFORCEMENT; STOCHASTIC SYSTEMS; TAXICABS; TENSORS; VECTOR SPACES;

CONTINUOUS DYNAMICAL SYSTEM; CONVERGENCE PROPERTIES; HIGHER-ORDER MARKOV CHAINS; RANDOM WALK; RANDOM WALK MODELING; STATIONARY DISTRIBUTION; TRANSITION MATRICES; TRANSITION PROBABILITIES;

RANDOM PROCESSES;

EID: 85019915527     PISSN: 00361445     EISSN: None     Source Type: Journal    
DOI: 10.1137/16M1074023     Document Type: Article

References (42)

1. E. S. Allman and J. A. Rhodes (2003), Phylogenetic invariants for the general Markov model of sequence mutation, Math. Biosci., 186 (2), pp. 113{144. (Cited on p. 325).
2. U. Alon (2007), Network motifs: Theory and experimental approaches, Nature Rev. Genetics, 8 (6), pp. 450{461. (Cited on p. 331).
3. A. Anandkumar, R. Ge, D. Hsu, S. M. Kakade, and M. Telgarsky (2014), Tensor decompositions for learning latent variable models, J. Mach. Learn. Res., 15 (1), pp. 2773{2832. (Cited on p. 325).
4. S. Asmussen and P. W. Glynn (2007), Stochastic Simulation: Algorithms and Analysis, Springer, New York. (Cited on p. 322).
5. D. Bayer and P. Diaconis (1992), Trailing the dovetail shuffle to its lair, Ann. Appl. Probab., 2 (2), pp. 294{313, https://doi.org/10.1214/aoap/1177005705. (Cited on p. 322).
6. M. Benam (1997), Vertex-reinforced random walks and a conjecture of Pemantle, Ann. Probab., 25 (1), pp. 361{392. (Cited on pp. 325, 326, 327, 329, 336, 343).
7. M. Benam and M. W. Hirsch (1996), Asymptotic pseudotrajectories and chain recurrent flows, with applications, J. Dynam. Differential Equations, 8 (1), pp. 141{176. (Cited on p. 336).
8. A. R. 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, SIAM, Philadelphia, 2015, pp. 118{126, https://doi.org/10.1137/1.9781611974010.14. (Cited on p. 331).
9. A. Berman and R. J. Plemmons (1994), Nonnegative Matrices in the Mathematical Sciences, SIAM, Philadelphia. (Cited on p. 337).
10. J. Buescu, D. Gracia, and N. Zhong (2011), Computability and dynamical systems, in Dynamics, Games and Science I, Springer, New York, pp. 169{181. (Cited on p. 343).
11. F. Chierichetti, R. Kumar, P. Raghavan, and T. Sarlos (2012), Are web users really Markovian?, in Proceedings of the 21st International Conference on World Wide Web, ACM, New York, pp. 609{618. (Cited on p. 323).
12. M. T. Chu and S.-J. Wu (2014), On the Second Dominant Eigenvalue Affecting the Power Method for Transition Probability Tensors, Technical report. (Cited on pp. 336, 343).
13. P. Comon (1994), Independent component analysis, a new concept?, Signal Process., 36 (3), pp. 287{314, https://doi.org/10.1016/0165-1684(94)90029-9. (Cited on p. 325).
14. D. Coppersmith and P. Diaconis (1987), Random Walks with Reinforcement, unpublished manuscript, pp. 187{220. (Cited on p. 325).
15. P. Diaconis (1988), Recent progress on de Finetti's notions of exchangeability, in Bayesian Statistics 3, J. M. Bernardo, M. H. DeGroot, D. V. Lindley, and A. F. M. Smith, eds., Oxford University Press, New York, pp. 111{125. (Cited on p. 326).
16. J. Duchi, S. Shalev-Shwartz, Y. Singer, and T. Chandra (2008), Efficient projections onto the 1-ball for learning in high dimensions, in Proceedings of the 25th International Conference on Machine Learning, pp. 272{279. (Cited on p. 339).
17. S. Fortunato (2010), Community detection in graphs, Phys. Rep., 486 (3), pp. 75{174. (Cited on p. 330).
18. D. F. Gleich, L.-H. Lim, and Y. Yu (2015), Multilinear PageRank, SIAM J. Matrix Anal. Appl., 36 (4), pp. 1507{1541, https://doi.org/10.1137/140985160. (Cited on pp. 324, 329, 330, 336, 337, 338, 340, 343).
19. G. H. Golub and C. F. Van Loan (2012), Matrix Computations, JHU Press, Baltimore, MD. (Cited on p. 326).
20. R. A. Harshman (1970), Foundations of the PARAFAC procedure: Models and conditions for an explanatory" multimodal factor analysis, UCLA Working Papers in Phonetics, 16, pp. 1{84. (Cited on p. 325).
21. D. L. Hartl and A. G. Clark (1997), Principles of Population Genetics, Sinauer Associates, Sunderland, MA. (Cited on p. 330).
22. G. F. Jonsson and L. N. Trefethen (1998), A numerical analyst looks at the cuto phenomenon" in card shuffing and other Markov chains, in Numerical Analysis 1997: Proceedings of the 17th Dundee Biennial Conference, Addison Wesley Longman, Reading, MA, pp. 150{178. (Cited on p. 322).
23. J. G. Kemeny and J. L. Snell (1960), Finite Markov Chains, van Nostrand, Princeton, NJ. (Cited on p. 323).
24. F. Krzakala, C. Moore, E. Mossel, J. Neeman, A. Sly, L. Zdeborova, and P. Zhang (2013), Spectral redemption in clustering sparse networks, Proc. Natl. Acad. Sci. USA, 110 (52), pp. 20935{ 20940. (Cited on p. 323).
25. A. N. Langville and C. D. Meyer (2006), Google's PageRank and Beyond: The Science of Search Engine Rankings, Princeton University Press, Princeton, NJ. (Cited on p. 322).
26. W. Li and M. K. Ng (2014), On the limiting probability distribution of a transition probability tensor, Linear and Multilinear Algebra, 62 (3), pp. 362{385. (Cited on pp. 324, 335, 336, 343).
27. L.-H. Lim (2005), Singular values and eigenvalues of tensors: A variational approach, in CAM- SAP2005: Proceedings of the 1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, pp. 129{132. (Cited on p. 324).
28. L.-H. Lim (2013), Tensors and Hypermatrices, in Handbook of Linear Algebra, CRC Press, Boca Raton, FL, pp. 231{260. (Cited on p. 325).
29. C. D. Manning, P. Raghavan, and H. Schutze (2008), Introduction to Information Retrieval, Cambridge University Press, Cambridge, UK, 2008. (Cited on p. 330).
30. Q. Mei, J. Guo, and D. Radev (2010), DivRank: The interplay of prestige and diversity in information networks, in Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, New York, pp. 1009{1018. (Cited on p. 330).
31. C. Moore (1990), Unpredictability and undecidability in dynamical systems, Phys. Rev. Lett., 64 (20), pp. 2354{2357. (Cited on p. 343).
32. L. Page, S. Brin, R. Motwani, and T. Winograd (1999), The PageRank Citation Ranking: Bringing Order to the Web, Tech. report 1999-66, Stanford InfoLab, Stanford, CA. (Cited on pp. 329, 330).
33. R. Pemantle (1988), Random Processes with Reinforcement, Ph.D. thesis, MIT, Cambridge, MA. (Cited on p. 325).
34. R. Pemantle (1992), Vertex-reinforced random walk, Probab. Theory Related Fields, 92 (1), pp. 117{136. (Cited on p. 328).
35. R. Pemantle (2007), A survey of random processes with reinforcement, Probab. Surv., 4, pp. 1{79. (Cited on pp. 324, 325).
36. L. Qi (2005), Eigenvalues of a real supersymmetric tensor, J. Symbolic Comput., 40 (6), pp. 1302{1324. (Cited on p. 324).
37. M. Rosvall, A. V. Esquivel, A. Lancichinetti, J. D. West, and R. Lambiotte (2014), Memory in network flows and its effects on spreading dynamics and community detection, Nature Commun., 5, 4630. (Cited on p. 323).
38. S. E. Schaeffer (2007), Graph clustering, Comput. Sci. Rev., 1 (1), pp. 27{64. (Cited on p. 330).
39. N. D. Sidiropoulos, G. B. Giannakis, and R. Bro (2000), Blind PARAFAC receivers for DS-CDMA systems, IEEE Trans. Signal Process., 48 (3), pp. 810{823. (Cited on p. 325).
40. A. Smilde, R. Bro, and P. Geladi (2004), Multi-Way Analysis, Wiley, Chichester, UK. (Cited on p. 325).
41. W. J. Stewart (1994), Introduction to the Numerical Solutions of Markov Chains, Princeton University Press, Princeton, NJ. (Cited on p. 323).
42. J. Sun, D. Tao, and C. Faloutsos (2006), Beyond streams and graphs: Dynamic tensor analysis, in Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, New York, pp. 374{383, https://doi.org/10.1145/1150402.1150445. (Cited on p. 325).