The energy of the alphabet model

Particle methods and lattice-gas methods (76M28) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Interacting particle systems in time-dependent statistical mechanics (82C22)

Abstract: We call emph{Alphabet model} a generalization to N types of particles of the classic ABC model. We have particles of different types stochastically evolving on a one dimensional lattice with an exchange dynamics. The rates of exchange are local but under suitable conditions the dynamics is reversible with a Gibbsian like invariant measure with long range interactions. We discuss geometrically the conditions of reversibility on a ring that correspond to a gradient condition on the graph of configurations or equivalently to a divergence free condition on a graph structure associated to the types of particles. We show that much of the information on the interactions between particles can be encoded in associated emph{Tournaments} that are a special class of oriented directed graphs. In particular we show that the interactions of reversible models are corresponding to strongly connected tournaments. The possible minimizers of the energies are in correspondence with the Hamiltonian cycles of the tournaments. We can then determine how many and which are the possible minimizers of the energy looking at the structure of the associated tournament. As a byproduct we obtain a probabilistic proof of a classic Theorem of Camion cite{Camion} on the existence of Hamiltonian cycles for strongly connected tournaments. Using these results we obtain in the case of an equal number of k types of particles new representations of the Hamiltonians in terms of translation invariant

k

-body long range interactions. We show that when

k = 3, 4

the minimizer of the energy is always unique up to translations. Starting from the case

k = 5

it is possible to have more than one minimizer. In particular it is possible to have minimizers for which particles of the same type are not joined together in single clusters.

Review text

The ABC model is a stochastic lattice gas having particles of three types: A, B and C, evolving on a lattice. The authors introduce an alphabet model, on a one-dimensional ring, which is a generalization of the ABC model to the case with \(N\) types of particles. Particles that are at the two extremes of a bond of the lattice can exchange their positions and the rate at which this happens depends only on the configuration restricted to the bond and not on the structure of the configuration on different sites. The reversibility conditions are discussed. It is shown how to encode much of the information about the interactions among the particles with a tournament having vertices labeled by the type of particles. The energy of the alphabet model is written in terms of long range two-body interactions. It is proved that the reversible alphabet models are in correspondence with strongly connected tournaments. It is shown that the possible minimizers of the energy are in correspondence with the Hamiltonian cycles of the associated tournament. This gives a probabilistic proof of the known Camion theorem. In the case of an equal number of \(k\) types of particles, new representations of the Hamiltonians in terms of translation-invariant \(k\)-body long-range interactions are obtained. For small values of \(k\), the numbers of minimizers of energy are found.

Recommendations

Cites work

This page was built for publication: The energy of the alphabet model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364605)