...
首页> 外文期刊>Annales Henri Poincare >Computer-Assisted Proof of Loss of Ergodicity by Symmetry Breaking in Expanding Coupled Maps
【24h】

Computer-Assisted Proof of Loss of Ergodicity by Symmetry Breaking in Expanding Coupled Maps

机译:在扩展耦合地图中的对称性断开计算机辅助遍及遍幂的证明

获取原文
获取原文并翻译 | 示例
           

摘要

From a dynamical viewpoint, basic phase transitions of statistical mechanics can be regarded as a loss of ergodicity. While many random interacting particle models exhibiting such transitions at the thermodynamics limit exist, finite-dimensional examples with deterministic dynamics on a chaotic attractor are rare, if at all existent. Here, the dynamics of a family of N coupled expanding circle maps is investigated in a parameter regime where absolutely continuous invariant measures are known to exist. At first, empirical evidence is given of symmetry breaking of the ergodic components upon increase in the coupling strength, suggesting that loss of ergodicity should occur for every integer N > 2. Then, a numerical algorithm is proposed which aims to rigorously construct asymmetric ergodic components of positive Lebesgue measure. Due to the explosive growth of the required computational resources, the algorithm successfully terminates for small values of N only. However, this approach shows that phase transitions should be provable for systems of arbitrary number of particles with erratic dynamics, in a purely deterministic setting, without any reference to random processes.
机译:从动态观点来看,统计力学的基本阶段转变可以被认为是遍历的丧失。虽然存在在热力学限制下表现出这种转变的许多随机交互粒子模型存在,但如果在全部存在时,具有混沌吸引子上的确定性动态的有限尺寸示例是罕见的。这里,在已知存在绝对连续的不变措施的参数状态下研究了N个耦合扩展圆形图的动态的动态。首先,在耦合强度的增加时,赋予经验证据在偶联强度增加时对称性断裂,表明每个整数N> 2应该出现遍幂的丧失。然后,提出了一种数值算法,其旨在严格构建不对称的ergodic组件积极的Lebesgue措施。由于所需计算资源的爆炸性增长,该算法成功终止了N的小值。然而,这种方法表明,在纯粹的确定性设置中,应该可用于具有不稳定动态的任意数量粒子的阶段转换,而无需随机过程的任何引用。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号