SearcharxivSearch

arXiv · 1806.07339

Topologically robust zero-sum games and Pfaffian orientation -- How network topology determines the long-time dynamics of the antisymmetric Lotka-Volterra equation

Abstract

To explore how the topology of interaction networks determines the robustness of dynamical systems, we study the antisymmetric Lotka-Volterra equation (ALVE). The ALVE is the replicator equation of zero-sum games in evolutionary game theory, in which the strengths of pairwise interactions between strategies are defined by an antisymmetric matrix such that typically some strategies go extinct over time. Here we show that there also exist topologically robust zero-sum games, such as the rock-paper-scissors game, for which all strategies coexist for all choices of interaction strengths. We refer to such zero-sum games as coexistence networks and construct coexistence networks with an arbitrary number of strategies. By mapping the long-time dynamics of the ALVE to the algebra of antisymmetric matrices, we identify simple graph-theoretical rules by which coexistence networks are constructed. Examples are triangulations of cycles characterized by the golden ratio $φ= 1.6180...$, cycles with complete subnetworks, and non-Hamiltonian networks. In graph-theoretical terms, we extend the concept of a Pfaffian orientation from even-sized to odd-sized networks. Our results show that the topology of interaction networks alone can determine the long-time behavior of nonlinear dynamical systems, and may help to identify robust network motifs arising, for example, in ecology.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Philipp M. Geiger, Johannes Knebel, Erwin Frey. 2018-06-19. Topologically robust zero-sum games and Pfaffian orientation -- How network topology determines the long-time dynamics of the antisymmetric Lotka-Volterra equation. https://doi.org/10.1103/physreve.98.062316

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Universal sampling of spin systems across quenched disorder

Statistical physics extracts macroscopic laws by averaging over the many microscopic degrees of freedom of a system. Disordered systems demand a second and far harder average, one over the quenched randomness itself. The classic analytical routes, the replica and cavity methods, become uncontrolled outside mean-field or tree-like limits, and conventional numerical algorithms like parallel tempering require expensive, independent equilibration for every disorder realization. In this work, we introduce a universal neural variational framework that amortizes inference across the disorder ensemble, eliminating both the need for per-instance Markov chain equilibration and the cost of retraining instance-specific variational ansatzes. Built on an encoder-decoder Transformer architecture, after training once, it produces an explicit approximation to the Boltzmann distribution given previously unseen disorder realizations without further optimization. We validate this framework on 2D Edwards-Anderson models, and apply it to the random-bond Ising model, successfully capturing the Binder cumulant crossings near the Nishimori multicritical point. These results shift the object of variational inference from the single instance to the disorder ensemble, opening a route to frustrated many-body systems where instance-by-instance computation is prohibitive.

cond-mat.stat-mech

Information-Theoretic Characterization of Macroscopic Chaos Emerging from the Chemical Master Equation

Open chemical reaction networks exhibit stochastic concentration dynamics at finite system sizes, whereas their macroscopic limit is governed by deterministic rate equations that can display chaos. In this Letter, we show theoretically that a rate of information loss constructed from two-time mutual information recovers the Kolmogorov-Sinai entropy in the deterministic limit. We verify this result through numerical simulations of a Markov jump process for a three-species system involving seven reactions.

cond-mat.stat-mech

Orientational order on non-orientable domains

We study the statistical properties of passive and active many-body systems with orientational degrees of freedom on non-orientable domains. By rephrasing topological constraints as non-local symmetry relations on an orientable double-cover, we show that non-orientability eliminates global rotational soft modes without acting like an external field. In a passive XY model, this results in topological caging, where orientational fluctuations that exhibit conventional diffusive behavior on a torus saturate on a Klein bottle to a finite value that we compute exactly in the thermodynamic limit. In models of active self-propelled particles with orientational degrees of freedom, topological caging persists despite continuously changing interaction neighborhoods. In an active Ising spin model, non-orientability enforces the coexistence of ordered anti-parallel domains with vanishing global polar order, a state that is absent on orientable domains.

cond-mat.stat-mech