Login / Signup
Almost-Linear-Time Algorithms for Markov Chains and New Spectral Primitives for Directed Graphs.
Michael B. Cohen
Jonathan A. Kelner
John Peebles
Richard Peng
Anup B. Rao
Aaron Sidford
Adrian Vladu
Published in:
CoRR (2016)
Keyphrases
</>
markov chain
directed graph
random walk
steady state
learning algorithm
worst case
transition matrix
monte carlo method
undirected graph
graph structures
state space
search algorithm
transition probabilities
stochastic process
stationary distribution
directed acyclic graph
markov processes
maximum flow