Skip to main content Accessibility help
×
Home
Hostname: page-component-5c569c448b-ph4cd Total loading time: 0.239 Render date: 2022-07-01T18:09:15.128Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "useNewApi": true } hasContentIssue true

Balance of Recurrece Order in Time-Inhomogenous Markov Chains with Application to Simulated Annealing

Published online by Cambridge University Press:  27 July 2009

D. P. Connors
Affiliation:
Department of Electrical and Computer Engineering and the Coordinated Science Laboratory University of Illinois, Urbana, Illinois 61801
P. R. Kumar
Affiliation:
Department of Electrical and Computer Engineering and the Coordinated Science Laboratory University of Illinois, Urbana, Illinois 61801

Abstract

We define a notion of order of recurrence for the states and transitions of a general class of time-inhomogeneous Markov chains with transition probabilities proportional to powers of a small vanishing parameter. These orders are shown to satisfy a balance equation across every edge cut in the associated graph. The resulting order balance equations allow computation of the orders of recurrence of the states, and thereby the determination of the asymptotic behavior of the Markov chain.

The method of optimization by simulated annealing is a special case of such Markov processes, and can therefore be treated by means of these balance equations. In particular, in this special situation we show that there holds a detailed balance of order of recurrence across every edge in the graph. Moreover, the sum of the order of recurrence of a state and its cost is shown to be a constant in each connected set of recurrent states. By this approach, we determine the necessary and sufficient condition on the “rate of cooling” to guarantee that a minimum of the optimization problem is hit with probability one. Moreover, the rates of convergence of the probabilities can be deduced from the orders of recurrence.

Type
Articles
Copyright
Copyright © Cambridge University Press 1988

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Kirkpatrick, S., Gelatt, C. D. Jr, & Vecchi, M. P. (1983). Optimization by simulated annealing. Science 220 (4598):671680.CrossRefGoogle ScholarPubMed
Geman, S. & Geman, D. (1984). Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-6. no. 6:721741.Google Scholar
Mitra, D., Romeo, F., & Sangiovanni-Vincentelli, A. (1985). Convergence and finite-time behavior of simulated annealing. Preprint, Electronics Research Laboratory, University of California, Berkeley.Google Scholar
Gidas, B. (1985). Nonstationary Markov chains and convergence of the annealing algorithm. Journal of Statistical Physics 39:73131.CrossRefGoogle Scholar
Hajek, B. (1986). Cooling schedules for optimal annealing. Preprint. Department of Electrical Engineering and the Coordinated Science Laboratory, University of Illinois.Google Scholar
Tsitsiklis, J. N. (1985). Markov chains with rare transitions and simulated annealing. Preprint, Laboratory for Information and Decision Systems, Massachusetts institute of Technology.Google Scholar
Hajek, B. (1985). A tutorial survey of theory and applications of simulated annealing. Proceedings of the 24th IEEE Conference on Decision and Control, Vol. 2, pp. 755760, Ft. Lauderdale.Google Scholar
Gelfand, S. B. & Mitter, S. K. (1985). Analysis of simulated annealing for optimization. Proceedings of the 24th IEEE Conference on Decision and Control, Vol. 2, pp. 779786, Ft. Lauderdale.Google Scholar
Chung, K. L. (1974). A Course in Probability Theory. New York: Academic Press.Google Scholar
Bondy, J. A. & Murty, U. S. R. (1976). Graph Theory with Applications. New York: North-Holland.CrossRefGoogle Scholar
Kelly, F. (1979). Reversibility and Stochastic Networks. John Wiley.Google Scholar
Delebecque, F. (1983). A reduction process for perturbed Markov chains. SIAM Journal on Applied Mathematics 43:325350.CrossRefGoogle Scholar
15
Cited by

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Balance of Recurrece Order in Time-Inhomogenous Markov Chains with Application to Simulated Annealing
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

Balance of Recurrece Order in Time-Inhomogenous Markov Chains with Application to Simulated Annealing
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

Balance of Recurrece Order in Time-Inhomogenous Markov Chains with Application to Simulated Annealing
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *