Randomized Shortest-Path Problems: Two Related Models

Neural Computation

Volumn 21, Issue 8, 2009, Pages 2363-2404

  Saerens, Marco ^a   Achbany, Youssef ^a   Fouss, François ^a,b   Yen, Luh ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b Facultes Universitaires Catholiques de Mons   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL EFFICIENCY; ITERATIVE METHODS; LINEAR SYSTEMS; MARKOV PROCESSES; STATISTICAL PHYSICS;

CONDITION; DESTINATION NODES; EXPECTED COSTS; FINITE MARKOV CHAIN; OPTIMAL POLICIES; ROUTING POLICIES; SHORTEST PATH PROBLEM; SOURCE NODES; TRANSITION PROBABILITIES; TRAVEL COSTS;

GRAPH THEORY;

ARTICLE; ARTIFICIAL NEURAL NETWORK; COMPUTER SIMULATION; HUMAN; PROBABILITY; STATISTICAL MODEL;

COMPUTER SIMULATION; HUMANS; MODELS, STATISTICAL; NEURAL NETWORKS (COMPUTER); PROBABILITY;

EID: 70249146941     PISSN: 08997667     EISSN: 1530888X     Source Type: Journal    
DOI: 10.1162/neco.2009.11-07-643     Document Type: Article

References (64)

1. Achbany, Y., Fouss, F., Yen, L., Pirotte, A., & Saerens, M. (2006). Optimal tuning of continual exploration in reinforcement learning. In Proceedings of the 16th International Conference on Artificial Neural Networks (ICANN 06) (pp. 734–749). Berlin: Springer-Verlag.
2. Achbany, Y., Fouss, F., Yen, L., Pirotte, A., & Saerens, M. (2008). Tuning continual exploration in reinforcement learning: An optimality property of the Boltzmann strategy. Neurocomputing, 71, 2507–2520.
3. Adelson-Velsky, G. M., Arlazarov, V. L., & Donskoy, M. V. (1988). Algorithms for games. Berlin: Springer-Verlag.
4. Akamatsu, T. (1996). Cyclic flows, Markov process and stochastic traffic assignment. Transportation Research B, 30(5), 369–386.
5. Akamatsu, T. (1997). Decomposition of path choice entropy in general transport networks. Transportation Science, 31(4), 349–362.
6. Bather, J. (2000). Decision theory: An introduction to dynamic programming and sequential decisions. Hoboken, NJ: Wiley.
7. Bertsekas, D. P. (1998). Network optimization: Continuous and discrete models. Belmont, MA: Athena Scientific.
8. Bertsekas, D. P. (1999). Nonlinear programming (2nd ed.). Belmont, MA: Athena Scientific.
9. Bertsekas, D. P. (2000). Dynamic programming and optimal control. Belmont, MA: Athena Scientific.
10. Bertsekas, D. P., & Gallager, R. (1992). Data networks (2nd ed.). Upper Saddle River, NJ: Prentice Hall.
11. Bertsekas, D. P., & Tsitsiklis, J. (1996). Neuro-dynamic programming. Belmont, MA: Athena Scientific.
12. Boyd, S., Diaconis, P., & Xiao, L. (2004). Fastest mixing Markov chain on a graph. SIAM Review, 46, 667–689.
13. Bronson, R. (1989). Matrix operations. New York: McGraw-Hill.
14. Carre, B. (1979). Graphs and networks. New York: Oxford University Press.
15. Christofides, N. (1975). Graph theory: An algorithmic approach. Orlando, FL: Academic Press.
16. Cover, T. M., & Thomas, J. A. (2006). Elements of information theory (2nd ed.). Hoboken, NJ: Wiley.
17. Davis, T. A. (2006). Direct methods for sparse linear systems. Philadelphia, PA: SIAM.
18. Delvenne, J.-C. (2005). Pagerank, entropy and free energy. Manuscript submitted for publication.
19. Dial, R. (1971). A probabilistic multipath assignment model that obviates path enumeration. Transportation Research, 5, 83–111.
20. Dorigo, M., & Stutzle, T. (2004). Ant colony optimization. Cambridge, MA: MIT Press.
21. Durbin, R., Eddy, S. R., Krogh, A., & Mitchison, G. (1998). Biological sequence analysis: Probabilistic models of proteins and nucleic acids. Cambridge: Cambridge University Press.
22. Ekroot, L., & Cover, T. (1993). The entropy of Markov trajectories. IEEE Transactions on Information Theory, 39(4), 1418–1421.
23. Feynman, R. (1948). Space-time approach to non-relativistic quantum mechanics. Reviews of Modern Physics, 20(2), 367–387.
24. Fouss, F., Pirotte, A., Renders, J.-M., & Saerens, M. (2007). Random-walk computation of similarities between nodes of a graph, with application to collaborative recommendation. IEEE Transactions on Knowledge and Data Engineering, 19(3), 355–369.
25. Ghallab, M., Nau, D., & Traverso, P. (2004). Automated planning: Theory and practice. San Francisco: Morgan Kaufmann.
26. Girardin, V. (2004). Entropy minimization for markov and semi-Markov processes. Methodology and Computing in Applied Probability, 6, 109–127.
27. Girardin, V., & Limnios, N. (2004). Entropy rate and maximum entropy methods for countable semi-Markov chains. Communications in Statistics, 33(3), 609–622.
28. Gondran, M., & Minoux, M. (1984). Graphs and algorithms. Hoboken, NJ: Wiley.
29. Gusfield, D. (1997). Algorithms on strings, trees and sequences. Cambridge: Cambridge University Press.
30. Harville, D. A. (1997). Matrix algebra from a statistician’s perspective. Berlin: Springer-Verlag.
31. Jaynes, E. T. (1957). Information theory and statistical mechanics. Physical Review, 106, 620–630.
32. Jelinek, F. (1997). Statistical methods for speech recognition. Cambridge, MA: MIT Press.
33. Jungnickel, D. (2004). Graphs, networks and algorithms (2nd ed.). Berlin: Springer-Verlag.
34. Kapur, J. N., & Kesavan, H. K. (1992). Entropy optimization principles with applications. Orlando, FL: Academic Press.
35. Kemeny, J. G., & Snell, J. L. (1976). Finite Markov chains (rev. ed.). Berlin: Springer-Verlag.
36. Klein, D. J., & Randic, M. (1993). Resistance distance. Journal of Mathematical Chemistry, 12, 81–95.
37. Lafferty, J., McCallum, A., & Pereira, F. (2001). Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proceedings of the 18th International Conference on Machine Learning (ICML) (pp. 282–289). San Francisco: Morgan Kaufmann.
38. LaValle, S. (2006). Planning algorithms. Cambridge: Cambridge University Press.
39. Littman, M. L. (1994). Markov games as a framework for multi-agent reinforcement learning. In Proceedings of the 11th International Conference on Machine Learning (ICML-94) (pp. 157–163). San Francisco: Morgan Kaufmann.
40. Mohri, M. (2002). Semiring frameworks and algorithms for shortest-distance problems. Journal of Automata, Languages and Combinatorics, 7(3), 321–350.
41. Motwani, R., & Raghavan, P. (1995). Randomized algorithms. Cambridge: Cambridge University Press.
42. Nadler, B., Lafon, S., Coifman, R., & Kevrekidis, I. (2006). Diffusion maps, spectral clustering and eigenfunctions of Fokker-Planck operators. In Y. Weiss, B. Schölkopf, & J. Platt (Eds.), Advances in neural information processing systems, 18 (pp. 955–962). Cambridge, MA: MIT Press.
43. Nesterov, Y. (2007). Characteristic functions of directed graphs and applications to stochastic equilibrium problems. Optimization and Engineering, 8(2), 193–214.
44. Norris, J. (1997). Markov chains. Cambridge: Cambridge University Press.
45. Osborne, M. J. (2004). An introduction to game theory. New York: Oxford University Press.
46. Powell, W. (2007).Approximate dynamic programming. Hoboken, NJ: Wiley.
47. Puterman, M. (1994). Markov decision processes: Discrete stochastic programming. Hoboken, NJ: Wiley.
48. Qiu, H., & Hancock, E. R. (2007). Clustering and embedding using commute times. IEEE Transactions on Pattern Analysis and Machine Intelligence, 29(11), 1873–1890.
49. Rabiner, L., & Juang, B.-H. (1993). Fundamentals of speech recognition. Upper Saddle River, NJ: Prentice Hall.
50. Raiffa, H. (1970). Decision analysis. Reading, MA: Addison-Wesley.
51. Reichl, L. (1998). A modern course in statistical physics (2nd ed.). Hoboken, NJ: Wiley.
52. Rue, H., & Held, L. (2005). Gaussian Markov random fields. London: Chapman & Hall.
53. Saerens, M., Fouss, F., Yen, L., & Dupont, P. (2004). The principal components analysis of a graph, and its relationships to spectral clustering. In Proceedings of the 15th European Conference on Machine Learning (ECML 2004) (pp. 371–383). Berlin: Springer-Verlag.
54. Schrödinger, E. (1952). Statistical thermodynamics (2nd ed.). Cambridge: Cambridge University Press.
55. Sedgewick, R. (1990). Algorithms in C. Reading, MA: Addison-Wesley.
56. Shannon, C. (1948). A mathematical theory of communication. Bell System Technical Journal, 27, 379–423, 623–656.
57. Sun, J., Boyd, S., Xiao, L., & Diaconis, P. (2006). The fastest mixing Markov process on a graph and a connection to a maximum variance unfolding problem. SIAM Review, 48, 681–699.
58. Sutton, R. S., & Barto, A. G. (1998). Reinforcement learning: An introduction. Cambridge, MA: MIT Press.
59. Tahbaz, A., & Jadbabaie, A. (2006). A one-parameter family of distributed consensus algorithms with boundary: From shortest paths to mean hitting times. In Proceedings of IEEE Conference on Decision and Control (pp. 4664–4669). Piscataway, NJ: IEEE Press.
60. Taylor, H. M., & Karlin, S. (1998). An introduction to stochastic modeling (3th ed.). Orlando, FL: Academic Press.
61. Todorov, E. (2006). Linearly-solvable Markov decision problems. In B. Schölkopf, J. Platt, & T. Hoffman (Eds.), Advances in neural information processing systems, 19 (pp. 1369–1375). Cambridge, MA: MIT Press.
62. Tomlin, J. (2003). A new paradigm for ranking pages on the World Wide Web. In Proceedings of the International World Wide Web Conference (WWW2003) (pp. 350– 355). New York: ACM Press.
63. Wasserman, S., & Faust, K. (1994). Social network analysis: Methods and applications. Cambridge: Cambridge University Press.
64. Yen, L., Mantrach, A., Shimbo, M., & Saerens, M. (2008). A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances. In Proceedings of the 14th SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2008) (pp. 785–793). New York: ACM Press.