Best Ergodic Averages via Optimal Graph Filters in Reversible Markov Chains (2405.18995v1)
Abstract: In this paper, we address the problem of finding the best ergodic or Birkhoff averages in the ergodic theorem to ensure rapid convergence to a desired value, using graph filters. Our approach begins by representing a function on the state space as a graph signal, where the (directed) graph is formed by the transition probabilities of a reversible Markov chain. We introduce a concept of graph variation, enabling the definition of the graph Fourier transform for graph signals on this directed graph. Viewing the iteration in the ergodic theorem as a graph filter, we recognize its non-optimality and propose three optimization problems aimed at determining optimal graph filters. These optimization problems yield the Bernstein, Chebyshev, and Legendre filters. Numerical testing reveals that while the Bernstein filter performs slightly better than the traditional ergodic average, the Chebyshev and Legendre filters significantly outperform the ergodic average, demonstrating rapid convergence to the desired value.
- S. Sachdeva and N. K. Vishnoi, “Faster algorithms via approximation theory,” Found. Trends Theor. Comput. Sci., vol. 9, pp. 125–210, 2014.
- S. Das and J. Yorke, “Super convergence of ergodic averages for quasiperiodic orbits,” Nonlinearity, vol. 31, pp. 491–501, 01 2018.
- M. R. Hestenes and E. Stiefel, “Methods of conjugate gradients for solving linear systems,” Journal of research of the National Bureau of Standards, vol. 49, pp. 409–435, 1952.
- S. Kaniel, “Estimates for some computational techniques - in linear algebra,” Mathematics of Computation, vol. 20, pp. 369–378, 1966.
- C. Lanczos, “Solution of systems of linear equations by minimized iterations1,” Journal of research of the National Bureau of Standards, vol. 49, p. 33, 1952.
- Y. Saad and H. A. van der Vorst, “Iterative solution of linear systems in the 20th century,” Journal of Computational and Applied Mathematics, vol. 123, no. 1, pp. 1–33, 2000.
- R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf, “Quantum lower bounds by polynomials,” J. ACM, vol. 48, no. 4, p. 778-797, 2001.
- M. Lin and M. Weber, “Weighted ergodic theorems and strong laws of large numbers,” Ergodic Theory and Dynamical Systems, vol. 27, no. 2, p. 511-543, 2007.
- J. R. L. Bellow, Alexandra, “Almost everywhere convergence of weighted averages.” Mathematische Annalen, vol. 293, no. 3, pp. 399–426, 1992.
- A. Bellow and V. Losert, “The weighted pointwise ergodic theorem and the individual ergodic theorem along subsequences,” Transactions of the American Mathematical Society, vol. 288, no. 1, pp. 307–345, 1985.
- F. Durand and D. Schneider, “Ergodic averages with deterministic weights,” Annales de l’Institut Fourier, vol. 52, pp. 561–583, Sep. 2002.
- Z. Tong and Y. Li, “Exponential convergence of weighted birkhoff average,” 2022.
- M. Ruth and D. Bindel, “Finding birkhoff averages via adaptive filtering,” 2024.
- P. Diaconis and D. Stroock, “Geometric Bounds for Eigenvalues of Markov Chains,” The Annals of Applied Probability, vol. 1, no. 1, pp. 36 – 61, 1991.
- V. Totik, “Orthogonal polynomials.” Surveys in Approximation Theory, vol. 1, pp. 70–125, 2005.
- S. Nacu, “Glauber dynamics on the cycle is monotone,” Probability Theory and Related Fields, vol. 127, pp. 177–185, 2003.