This question is about the advantages of ensuring a limiting distribution in the Metropolis algorithm.
According to Wikipedia ,
uniqueness of stationary distribution: the stationary distribution $\pi(x)$ must be unique. This is guaranteed by ergodicity of the Markov process, which requires that every state must (1) be aperiodic—the system does not return to the same state at fixed intervals; and (2) be positive recurrent—the expected number of steps for returning to the same state is finite.
In the article is stated that ergodic implies aperiodic. It seems that there is not agreenment about this, like in this SE question is shown.
According to this answer an unique stationary distribution exists if all states of an irreducible Markov chain are positive recurrent. In the same reference it is said that the limiting probabilities cannot converge.
I think that the requirement of aperiodicity is done to ensure that the chain is ergodic acording to this definition, which ensures a limiting distribution.
Question: In the application of the Metropolis algorithm one take the average value of some property of each state in the realization of the Markov chain. Why convergence to a limiting distribution would be an advantage? It seems to me that ensuring that the MC is irreducible and positive recurrent should be enough.
Any clarification of incorrect statements in this question is very welcome.