Ergodicity in Parametric Nonstationary Markov Chains: An Application to Simulated Annealing Methods

@article{Anily1987ErgodicityIP,
  title={Ergodicity in Parametric Nonstationary Markov Chains: An Application to Simulated Annealing Methods},
  author={Shoshana Anily and Awi Federgruen},
  journal={Operations Research},
  year={1987},
  volume={35},
  pages={867-874}
}
A nonstationary Markov chain is weakly ergodic if the dependence of 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 probabilistic analyses of general search methods for combinatorial optimization problems… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 37 CITATIONS

Convergent Learning Algorithms for Unknown Reward Games

VIEW 7 EXCERPTS
CITES BACKGROUND & RESULTS
HIGHLY INFLUENCED

Quantum annealing learning search for solving QUBO problems

Dynamic Network Formation Game With Social Awareness in D2D Communications

VIEW 1 EXCERPT

Learning for Computation Offloading in Mobile Edge Computing

VIEW 1 EXCERPT
CITES METHODS

Cache policies for linear utility maximization