Papers for

complex systems modelers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Random payoff games reveal how stable strategies appear in multi group settings

Equilibrium Statistics and Stability in Random Two-Population and Three-Population Evolutionary Games

Abstract: Multi-population matrix evolutionary games provide a framework for studying adaptation and strategic interactions among heterogeneous agents. When payoffs are uncertain, however, analysing a specified game does not reveal how frequently different evolutionary outcomes occur or how their probabilities depend on modelling assumptions. We study two- and three-population games with two strategies per population and both within- and between-population pairwise interactions, with payoffs fixed during each evolutionary trajectory. For two populations, we derive equilibrium-existence probabilities and analytical stability results for generic games and three structured classes: diversity, exclusive, and avoidance games. For generic two-population games, independent Gaussian sampling of payoff entries and of replicator coefficients produces different equilibrium statistics. Interaction structure further distinguishes coexistence from attraction: diversity and exclusive games share the same interior-existence probability, but only exclusive games admit asymptotically stable interior equilibria. Avoidance games admit transversely attracting equilibrium families without locally asymptotically stable individual points. For generic three-population games under independent payoff sampling, we obtain existence probabilities for all equilibrium types and joint existence-and-stability probabilities for boundary equilibria. Monte Carlo simulations support the analytical predictions and quantify multistability, while phase portraits illustrate initial-condition dependence. Under the same Gaussian payoff-sampling protocol, simulations show a lower frequency of fully mixed equilibria but a higher frequency of multistability for three populations than for two.

Tue 17 NovComputer Science and Game Theory
The gist
This paper looks at how different groups of individuals with unknown payoffs adapt and settle into strategies over time. The authors study games where two or three groups each choose between two strategies, and analyze how often stable patterns of behavior appear. They find that the structure of interactions and how payoffs are randomly assigned strongly affect which outcomes are common and stable. Their results also show that adding more groups tends to increase the number of stable outcomes and makes predicting final behavior more complex.
Open → 2611.23223v1

Mathematics reveals hidden links between scientific fields and hierarchy

The Logic of Emergence

Abstract: ``Emergence'' refers to the fact that different mathematical languages and theories seem to be required to describe scientific theories that operate at different spatial and temporal scales. Highly circumscribed, special cases of emergence have been investigated using many different formal tools, including coarse-graining (over space and / or time), renormalization, dimension reduction, broken symmetry, and various formulations of causality. Here we extend the mathematics of model theory to unify and extend these earlier investigations. As a preliminary application of our framework, we investigate canonical examples of emergence, including the emergence of genetics from chemistry, of psychology from neurobiology, and of different forms of collective behavior from the laws governing their constituent parts. By exploiting the power of model theory we also uncover many aspects of emergence that were previously obscured. In particular, we uncover some of the rich hierarchical structure that relates different scientific fields. For example, we show that scientific fields can be related via a collection of multiple partial orders, all defined over the same set. On the other hand, under an alternative relation among scientific fields, one which allows cycles, we show that it is possible that the set of all of scientific fields must collapse into a single scientific field. Going forward, these investigations point to the formal tools that might need to be developed in order to arrive at a deeper understanding of this emergent hierarchy of scientific reality.

Wed 4 NovLogic in Computer Science
The gist
Different sciences use different kinds of math to describe things at different sizes or speeds, like chemistry for molecules and psychology for behavior. The authors use a branch of mathematics called model theory to bring these ideas together into one framework. They look at examples like how genetics comes from chemistry and how psychology arises from brain biology. Their work shows new connections and how scientific fields fit together, sometimes in surprising ways.
Open → 2611.06641v1

Rapid convergence of Glauber dynamics in Ising models with large spin majority

Rapid mixing within a phase for Ising models

Abstract: We study Glauber dynamics for Ising measures conditioned to have a sufficiently large majority of $+1$ spins. Under a sparse spectral width condition on the interaction matrix, we derive a Poincaré inequality for the conditioned measures from a magnetization drift condition, and a modified logarithmic Sobolev inequality from a stronger, entropy weighted condition. As applications, we obtain approximate posterior sampling in total variation distance for $\mathbb{Z}_2$ synchronization at high enough signal-to-noise ratio using $O(n\log n)$ Glauber updates from a spectral initialization. For ferromagnetic Ising models on random $d$-regular graphs, we prove rapid phase ordering down to inverse temperatures of order $1/d$, extending the temperature range of Gheissari, Sly, and Sohn (2025). Finally, we extend these inequalities to unconditioned Ising measures under an inward drift condition outside the conditioned region. This yields $O(n\log n)$ mixing of Glauber dynamics for the Sherrington-Kirkpatrick model at every fixed inverse temperature when the external field is sufficiently large.

Fri 16 OctData Structures and Algorithms
The gist
This work looks at how quickly a certain process called Glauber dynamics mixes or settles down in Ising models, which are mathematical ways to study interacting spins (values that can be +1 or -1). The authors focus on cases where there is already a large majority of +1 spins, showing conditions under which the system mixes rapidly within this phase. They also extend their results to important models like the Sherrington-Kirkpatrick model when an external field is large enough. These findings help improve methods for sampling and understanding spin systems in statistical physics and related data problems.
Open → 2610.23777v1

Neural networks replicate themselves on pixel grids showing evolving diversity

Self-Replicating Neural Cellular Automata: Quantifying Emergent Phenotypic and Genotypic Diversity in an OpenEnded Substrate

Abstract: We study an in-silico substrate in which every pixel of a two-channel cellular-automata grid carries a tiny neural network (an agent) that senses its Moore neighborhood. A cell persists only by self-replication: a living neighbor is cloned and its weights are mutated by a uniform perturbation, so that phenotype (cell state) is driven entirely by genotype (network weights). From a handful of seeded founders the system grows into a spatially organized ecosystem of coexisting, competing and dominating species. Our main contribution is a battery of coarse-grained diversity metrics that make such growth measurable at two scales: four phenotypic tools based on cellular-type frequency, entropy and cell variance, and two genotypic tools that colour each agent by a hash of its full weight vector versus a sparse random-weight probe. Across a five-fold sweep of 1680 small runs and 24 long (1000-generation, 200 x 200) runs, the substrate is persistent and self-maintaining in 20 of the 24 long configurations and exposes a clear phenotype-genotype diversity trade-off: raising phenotypic diversity collapses genotypic diversity and vice versa. Full-genome hash colouring further reveals lineage structure that a random-weight probe systematically misses. Code, data and animations are released as supplementary material.

Thu 17 SeptMachine LearningNeural and Evolutionary Computing
The gist
The paper studies a digital system where each pixel on a grid contains a tiny neural network that represents a cell. These cells survive only by copying themselves to neighboring pixels with slight changes, making their state entirely determined by their internal 'genetic code' (network weights). Starting from a few initial cells, complex patterns and different cell types emerge and compete like species in an ecosystem. The authors introduce new ways to measure how diverse these cells are both in behavior and genetics, finding that increasing one often reduces the other. Their work helps understand complexity and diversity in self-replicating digital life.
Open → 2609.19902v1