2016/03/29 by Emilio N. M. Cirillo, Cirillo, Emilio N. M., Francesca R. Nardi +3
Computer Science · Mathematics · Physics and Astronomy · #Cellular Automata and Applications #FOS: Physical sciences #Mathematical Physics (math-ph) #Stochastic processes and statistical mechanics #Theoretical and Computational Physics
paper · pdf · doi:10.48550/arxiv.1603.08792
openalex publication_date 2016/03/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Reversible Probabilistic Cellular Automata are a special class of automata\nwhose stationary behavior is described by Gibbs-like measures. For those models\nthe dynamics can be trapped for a very long time in states which are very\ndifferent from the ones typical of stationarity. This phenomenon can be\nrecasted in the framework of metastability theory which is typical of\nStatistical Mechanics.\n In this paper we consider a model presenting two not degenerate in energy\nmetastable states which form a series, in the sense that, when the dynamics is\nstarted at one of them, before reaching stationarity, the system must\nnecessarily visit the second one. We discuss a rule for combining the exit\ntimes from each of the metastable states.\n