no code implementations • 1 Apr 2019 • Weiming Feng, Thomas P. Hayes, Yitong Yin
Furthermore, if a natural Lipschitz condition is satisfied by the Metropolis filters, our algorithm can simulate $N$-step Metropolis chains within $O(N/n+\log n)$ rounds of asynchronous communications, where $n$ is the number of variables.
