• R. H. J. M. Otten
  • L. P. P. P. van Ginneken
Part of the The Kluwer International Series in Engineering and Computer Science book series (SECS, volume 72)


The inner loop of an annealing algorithm is a markov process, and since the value of t is not changed within this loop the process is also homogeneous. A markov process is called a markov chain when a sequence of events rather than a process defined in continuous time is described. Finally, the fact that the number of states is finite makes the loop a finite homogeneous markov chain. Matrices provide a convenient formalism for discussing these chains, and we therefore describe the inner loop of the annealing algorithm as a sequence of matrix multiplications. Many results are derived using the matrix formulation of the chain, but the central result of this chapter is that under certain mild conditions the frequencies of the states in the loop will tend to a stationary density function, called the equilibrium density of the chain. The equilibrium density depends on t.


Markov Process Transition Matrix Transition Matrice Equilibrium Density Acceptance Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Kluwer Academic Publishers 1989

Authors and Affiliations

  • R. H. J. M. Otten
    • 1
  • L. P. P. P. van Ginneken
    • 2
  1. 1.Delft University of TechnologyThe Netherlands
  2. 2.Eindhoven University of TechnologyThe Netherlands

Personalised recommendations