Related references
Note: Only part of the references are listed.Tuning continual exploration in reinforcement learning: An optimality property of the Boltzmann strategy
Youssef Achbany et al.
NEUROCOMPUTING (2008)
Clustering and embedding using commute times
Huaijun John Qiu et al.
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE (2007)
Characteristic functions of directed graphs and applications to stochastic equilibrium problems
Yu. Nesterov
OPTIMIZATION AND ENGINEERING (2007)
Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation
Francois Fouss et al.
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING (2007)
The fastest mixing Markov process on a graph and a connection to a maximum variance unfolding problem
Jun Sun et al.
SIAM REVIEW (2006)
Entropy rate and maximum entropy methods for countable semi-Markov chains
V Girardin et al.
COMMUNICATIONS IN STATISTICS-THEORY AND METHODS (2004)
Entropy maximization for Markov and semi-Markov processes
V Girardin
METHODOLOGY AND COMPUTING IN APPLIED PROBABILITY (2004)
Fastest mixing Markov chain on a graph
S Boyd et al.
SIAM REVIEW (2004)
Share Paper
