Sign in
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:
STOC (2017)
Keyphrases
</>
markov chain
directed graph
random walk
transition matrix
worst case
maximum flow
steady state
finite state
stochastic process
learning algorithm
special case
transition probabilities
markov chain monte carlo
markov processes
strongly connected
probabilistic automata