The $k$-flip Ising game
Kovalenko Aleksandr, Andrey Leonidov
TL;DR
This work analyzes how partially parallel, k-flip Ising dynamics on a complete graph governs transition times between metastable and stable states. By deriving an exact transition matrix Ω^{(k)} and computing the first two moments of the φ distribution, it uncovers a nontrivial, k-dependent competition between diffusion and restoring forces that can produce a minimum in mean transition time. The authors develop a Markov-chain framework to obtain mean and second moments of first hitting times, examine equilibrium distributions via an effective potential, and validate predictions with simulations showing robust, heavy-tailed transition times. The results illuminate how collective, multi-agent updates influence metastable decay rates in noisy binary-choice systems, with implications for understanding rapid or slow transitions under partial parallelism.
Abstract
A partially parallel dynamical noisy binary choice (Ising) game in discrete time of $N$ players on complete graphs with $k$ players having a possibility of changing their strategies at each time moment called $k$-flip Ising game is considered. Analytical calculation of the transition matrix of game as well as the first two moments of the distribution of $\varphi=N^+/N$, where $N^+$ is a number of players adhering to one of the two strategies, is presented. First two moments of the first hitting time distribution for sample trajectories corresponding to transition from a metastable and unstable states to a stable one are considered. A nontrivial dependence of these moments on $k$ for the decay of a metastable state is discussed. A presence of the minima at certain $k^*$ is attributed to a competition between $k$-dependent diffusion and restoring forces.
