Abstract

A nonstationary Markov chain is weakly ergodic if the dependence on the state distribution on the starting state vanishes as time tends to infinity. A chain is strongly ergodic if it is weakly ergodic and converges in distribution. In this paper we show that the two ergodicity concepts are equivalent for finite chains under rather general (and widely verifiable) conditions. We discuss applications to probabalistic analyses of general search methods for combinatorial optimization problems (simulated annealing).

Download PDF

Citation

Anily, Shoshana, and Awi Federgruen. "Ergodicity in parametric nonstationary Markov chains: An application to simulated annealing methods." Operations Research 35, no. 6 (1987): 867-874.

Each author name for a Columbia Business School faculty member is linked to a faculty research page, which lists additional publications by that faculty member.

Each topic is linked to an index of publications on that topic.