A distributed dynamical scheme for fastest mixing markov chains

Proceedings of the American Control Conference

Volumn , Issue , 2009, Pages 1436-1441

  Zavlanos, Michael M ^a   Koditschek, Daniel E ^a   Pappas, George J ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CENTRALIZED OPTIMIZATION; CONVEX COMBINATIONS; CROSS PRODUCT; DISTRIBUTED CONSENSUS; DISTRIBUTED CONTROL; INITIAL STATE; LAW OF LARGE NUMBERS; MARKOV CHAIN; MIXING RATES; NETWORK OF AGENTS; PROBLEM FORMULATION; RANDOM MATRIX; SPARSITY PATTERNS; STOCHASTIC MATRICES;

COMPUTER SIMULATION; DISTRIBUTED PARAMETER CONTROL SYSTEMS; DYNAMICAL SYSTEMS; MARKOV PROCESSES; PROBABILITY DISTRIBUTIONS; STOCHASTIC SYSTEMS;

MATRIX ALGEBRA;

EID: 70449659249     PISSN: 07431619     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACC.2009.5160197     Document Type: Conference Paper

References (29)

1. L. Billera, and P. Diaconis. A Geometric Interpretation of the Metropolis-Hastings Algorithm, Statistical Science, vol. 16, pp. 335-339, Nov. 2001.
2. W. Hastings. Monte Carlo Sampling Methods using Markov Chains and their Applications, Biometrika, vol. 57, pp. 97-109, 1970.
3. W. R. Gilks, S. Richardson, and D. Spiegelhalter. Markov Chain Monte Carlo in Practice: Interdisciplinary Statistics, Chapman and Hall, 1996.
4. G. Casella, and E. I. George. Explaining the Gibbs Sampler, The American Statistician, vol. 46(3), pp. 167-174, 1992.
5. S. Chib, and E. Greenberg. Markov Chain Monte Carlo Simulation Methods in Econometrics, Econometric Theory, vol. 12(3), pp. 409-431, 1996.
6. Z. Yang, and B. Rannala. Bayesian Phylogenetic Inference using DNA Sequences: A Markov Chain Monte Carlo Method, Molecular Biology and Evolution, vol. 14, pp. 717-724, 1997.
7. C. J. Geyer, and E. A. Thompson. Annealing Markov Chain Monte Carlo with Applications to Ancestral Inference, Journal of American Statistical Association, vol. 90(431), pp. 909-920, 1995.
8. S. Thrun, D. Fox, W. Burgard, and F. Dellaert. Robust Monte Carlo Localization for Mobile Robots, Artificial Intelligence, vol. 128(1-2), pp. 99-141, May 2001.
9. C. Hue, J.-P. Le Cadre, and P. Perez. Sequential Monte Carlo Methods for Multiple Target Tracking and Data Fusion, IEEE Transactions on Signal Processing, vol. 50(2), pp. 309-325, Feb. 2002.
10. M. Kaess, and F. Dellaert. A Markov Chain Monte Carlo Approach to Closing the Loop in SLAM, Proc. of the IEEE Conference on Robotics and Automation, Barcelona, Spain, April 2005, pp. 643-648.
11. D. Marinakis, G. Dudek, D. J. Fleet. Learning Sensor Network Topology through Monte Carlo Expectation Maximization, Proc. of the IEEE Conference on Robotics and Automation, Barcelona, Spain, April 2005, pp. 4581-4587.
12. A. Ranganathan, and F. Dellaert. Inference in the Space of Topological Maps: An MCMC-Based Approach, Proc. of the IEEE/RSJ International Conference on Intelligent Robots and Systems, Sendai, Japan, Sept. 2004, pp. 1518-1523.
13. C.-X. Shi, B.-R. Hong, and Y.-Q. Wang. Cooperative Exploration by Multi-Robots without Global Localization, International Journal of Advanced Robotic Systems, vol. 5(2), pp. 129-138, 2008.
14. J. Liu. Monte Carlo Strategies in Scientific Computing. Springer Series in Statistics. Springer-Verlag, New York, 2001.
15. P. Bremaud. Markov Chains, Gibbs Fields, Monte Carlo Simulation and Queues. Texts in Applied Mathematics. Springer-Verlag, Berlin-Heidelberg, 1999.
16. C. J. Geyer. Practical Markov Chain Monte Carlo. Statistical Science, vol. 7(4), pp. 473-483, Nov. 1992.
17. S. Chib, and E. Greenberg. Understanding the Metropolis-Hastings Algorithm, The American Statistician, vol. 49(4), pp. 327-335, Nov. 1995.
18. S. Boyd, P. Diaconis, and L. Xiao. Fastest Mixing Markov Chain on a Graph. SIAM Review, vol. 46(4), pp. 667-689, Dec. 2004.
19. D. Aldous. Random Walk on Finite Groups and Rapidly Mixing Markov Chains. In Seminaire de Probabilities XVII, volume 986 of Lecture Notes in Mathematics, pp. 243-297. Springer, New York, 1983.
20. P. Diaconis. Group Representations in Probability and Statistics. IMS, Hayward, CA, 1988.
21. M. Jerrum, and A. Sinclair. Approximating the Permanent. SIAM Journal on Computing, vol. 18, pp. 1149-1178, 1989.
22. P. Diaconis, and D. Stroock. Geometric Bounds for Eigenvalues of Markov Chains. The Annals of Applied Probability, vol. 1(1), pp. 36-61, 1991.
23. A. Sinclair. Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow. Combinatorics, Probability and Computing, vol. 1, pp. 351-370, 1992.
24. N. Kahale. A Semidefinite Bound for Mixing Rates of Markov Chains. Proc. of the 5th Integer Programming and Combinatorial Optimization Conference, Springer Lecture Notes in Computer Science, vol. 1084, pp. 190-203, 1996.
25. G. Grimmett, and D. Stirzaker. Probability and Random Processes. Oxford University Press, New York, 2003 (third edition).
26. W. Feller. An Introduction to Probability Theory and its Applications, Vol. 1. John Wiley & Sons, 1968 (third edition).
27. A. Berman, and R. J. Plemmons. Nonnegative Matrices in the Mathematical Sciences. SIAM Classics in Applied Mathematics, Philadelphia, 1994.
28. C. Godsil, and G. Royle. Algebraic Graph Theory, Springer-Verlag, New York, 2001.
29. R. G. Laha, and V. K. Rohatgi. Probability Theory, pp. 446-451, John Wiley and Sons, 1979.