TL;DR
The paper introduces the spacey random walk, a non-Markovian process that models higher-order data, with applications in ranking, clustering, and analyzing complex trajectory data.
Contribution
It presents the spacey random walk as a novel stochastic process linking higher-order tensor eigenvectors to non-Markovian dynamics.
Findings
Convergence properties of the process are analyzed.
Numerical methods for stationary distribution computation are discussed.
Applications include population genetics, ranking, clustering, and trajectory analysis.
Abstract
Random walks are a fundamental model in applied mathematics and are a common example of a Markov chain. The limiting stationary distribution of the Markov chain represents the fraction of the time spent in each state during the stochastic process. A standard way to compute this distribution for a random walk on a finite set of states is to compute the Perron vector of the associated transition matrix. There are algebraic analogues of this Perron vector in terms of transition probability tensors of higher-order Markov chains. These vectors are nonnegative, have dimension equal to the dimension of the state space, and sum to one and are derived by making an algebraic substitution in the equation for the joint-stationary distribution of a higher-order Markov chains. Here, we present the spacey random walk, a non-Markovian stochastic process whose stationary distribution is given by the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
