Ergodic Transport Theory, periodic maximizing probabilities and the twist condition
G. Contreras, A. O. Lopes, E. R. Oliveira

TL;DR
This paper analyzes ergodic transport problems focusing on cases where the maximizing probability is unique and periodic, establishing finiteness of optimal solutions under certain conditions.
Contribution
It provides a detailed analysis of unique periodic maximizing probabilities in ergodic transport, extending previous work with new conditions like the twist condition.
Findings
Under generic conditions, the set of optimal w_x is finite for all x.
The twist condition and uniqueness imply a finite structure of optimal solutions.
The results connect ergodic theory with transport and optimization principles.
Abstract
The present paper is a follow up of another one by A. O. Lopes, E. Oliveira and P. Thieullen which analyze ergodic transport problems. Our main focus will a more precise analysis of case where the maximizing probability is unique and is also a periodic orbit. Consider the shift T acting on the Bernoulli space \Sigma={1, 2, 3,.., d}^\mathbb{N} A:\Sigma \to \mathbb{R} a Holder potential. Denote m(A)=max_{\nu is an invariant probability for T} \int A(x) \; d\nu(x) and, \mu_{\infty,A}, any probability which attains the maximum value. We assume this probability is unique (a generic property). We denote \T the bilateral shift. For a given potential Holder A:\Sigma \to \mathbb{R}, we say that a Holder continuous function W: \hat{\Sigma} \to \mathbb{R} is a involution kernel for A, if there is a Holder function A^*:\Sigma \to \mathbb{R}, such that, A^*(w)= A\circ \T^{-1}(w,x)+ W…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Advanced Thermodynamics and Statistical Mechanics · Markov Chains and Monte Carlo Methods
