首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Weak KAM methods and ergodic optimal problems for countable Markov shifts
Authors:Rodrigo Bissacot  Eduardo Garibaldi
Institution:1. Departamento Matemática, UFMG, 30161-970, Belo Horizonte, MG, Brazil
2. Departamento de Matemática, UNICAMP, 13083-859, Campinas, SP, Brazil
Abstract:Let σ: Σ → Σ be the left shift acting on Σ, a one-sided Markov subshift on a countable alphabet. Our intention is to guarantee the existence of σ-invariant Borel probabilities that maximize the integral of a given locally Hölder continuous potential A: Σ → ?. Under certain conditions, we are able to show not only that A-maximizing probabilities do exist, but also that they are characterized by the fact their support lies actually in a particular Markov subshift on a finite alphabet. To that end, we make use of objects dual to maximizing measures, the so-called sub-actions (concept analogous to subsolutions of the Hamilton-Jacobi equation), and specially the calibrated sub-actions (notion similar to weak KAM solutions).
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号