Sustained Heterogeneity: an emergent collective mechanism in LLM-driven traffic

Yujun Qi; Yangyang Guan

Home/Archive/arXiv

arXiv · 2608.29174

Sustained Heterogeneity: an emergent collective mechanism in LLM-driven traffic

Yujun Qi·Yangyang Guan

View original source ↗Read source document ↗Export metadata ↓

Abstract

Large language models (LLMs) are increasingly adopted as closed-loop controllers in physical multi-agent systems, yet their emergent collective dynamics remain incompletely characterised. We deploy 22 LLM agents as direct, real-time target-speed controllers (per 0.5 s cycle, with IDM as collision-avoidance clamp) on a 230 m ring road under the Sugiyama 2008 paradigm, reproducing human-like stop-and-go waves. Six matched controls spanning stochasticity (white noise, OU noise, temperature), population variance, and dynamical instability (delay, OV model) are systematically excluded. The surviving phenomenon, termed Sustained Heterogeneity (SH), is the persistent, approximately temperature-insensitive (approx. 8 percent across a 6x T sweep), per-cycle divergence in LLM-chosen target-speed adjustments, propagating through a three-stage cascade of drift, gap erosion, and nonlinear braking. Across four traffic densities, the critical LLM penetration fraction p_c decreases monotonically from no transition at density 43.5 veh/km to p_c approx 0.23 at density 95.7 veh/km, consistent with an initiation-threshold model governed by trigger distance, stochasticity, and fleet size. Chain-of-thought analysis of 39,600 decisions across three seeds shows agents engage in multi-factor safety reasoning, yet systematic divergence persists, implying stability must be enforced at the dynamics layer. This is the first study to identify a previously uncharacterised collective mechanism in LLM-controlled traffic and map a density-dependent phase boundary p_c(rho).

Explore related subjects

physics.soc-ph cs.MA nlin.AO

Keep this discovery

BibTeX RIS

Yujun Qi, Yangyang Guan. 2026-08-29. Sustained Heterogeneity: an emergent collective mechanism in LLM-driven traffic. https://arxiv.org/abs/2608.29174

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

Discover connections

cs.MA subject nlin.AO subject physics.soc-ph subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related discoveries

arXiv2026

Emergent aggregation from collective foraging

Collective behaviour in living systems is usually modelled as the outcome of a \emph{direct} social drive: agents are rewarded, or hard-wired, to align with or approach their neighbours. Here we show that aggregation can instead emerge from an \emph{indirect} objective. We let reinforcement learning foragers, initially performing a random walk, optimize their dynamics from a purely individual reward for finding replenishable targets, while perceiving only their conspecifics and never the targets themselves. As the visual range grows, the agents undergo a sharp crossover from an environment-tuned individual search to a scale-agnostic collective one, and this crossover coincides with the onset of spatial aggregation. Thus a collective phase arises as a by-product of optimal foraging, without any direct reward for grouping. A minimal analytical first-passage model reproduces the transition as a crossover between the two search strategies. Our results identify indirect, resource-driven reward as a generic route to emergent collective phenomena.

cond-mat.stat-mech↗

arXiv2025

Complexity of Activity Patterns in a Bio-Inspired Hopfield-Type Network in Different Topologies

Neural network models capable of storing memory have been extensively studied in computer science and computational neuroscience. The Hopfield network is a prototypical example of a model designed for associative, or content-addressable, memory and has been analyzed in many forms. Further, ideas and methods from complex network theory have been incorporated into artificial neural networks and learning, emphasizing their structural properties. Nevertheless, the temporal dynamics also play a vital role in biological neural networks, whose temporal structure is a crucial feature to examine. Biological neural networks display complex intermittency and, thus, can be studied through the lens of the temporal complexity (TC) theory. The TC approach look at the metastability of self-organized states, characterized by a power-law decay in the inter-event time distribution and in the total activity distribution or a scaling behavior in the corresponding event-driven diffusion processes. In this study, we present a temporal complexity (TC) analysis of a biologically-inspired Hopfield-type neural network model. We conducted a comparative assessment between scale-free and random network topologies, with particular emphasis on their global activation patterns. Our parametric analysis revealed comparable dynamical behaviors across both neural network architectures. Furthermore, our investigation into temporal complexity characteristics uncovered that seemingly distinct dynamical patterns exhibit similar temporal complexity behaviors. In particular, similar power-law decay in the activity distribution and similar complexity levels are observed in both topologies, but with a much reduced noise in the scale-free topology. Notably, most of the complex dynamical profiles were consistently observed in scale-free network configurations, thus confirming the crucial role of hubs in neural network dynamics.

q-bio.NC↗

arXiv2026

ButterMamba: Butterworth-Enhanced Spatial-Temporal Mamba for Efficient Traffic Flow Prediction

Accurate traffic flow prediction is fundamental to intelligent transportation systems, playing a pivotal role in urban mobility optimization and smart city development. While Graph Neural Networks (GNNs) integrated with time series forecasting have emerged as promising solutions, two critical limitations persist: (1) the quadratic complexity of attention-based architectures hinders real-time deployment in large-scale networks, and (2) high-frequency noise in sensor data significantly degrades prediction reliability. These challenges are particularly acute in metropolitan scenarios where both computational efficiency and noise robustness are paramount. To address these limitations, we introduce \textbf{ButterMamba}, a novel and efficient framework based on State Space Models (SSMs). ButterMamba consists of two key components: (1) a Butterworth Spectral Filtering module that preprocesses the data by removing high-frequency noise, allowing the model to focus on significant underlying trends, and (2) a Spatial-Temporal State Mixer that uses a parallel Mamba architecture to efficiently capture both long-range temporal dependencies and complex spatial correlations across the road network. By decoupling noise filtering from spatial-temporal modeling, ButterMamba achieves superior predictive accuracy with linear computational complexity. Extensive experiments on three public datasets demonstrate that ButterMamba not only outperforms existing state-of-the-art models in terms of prediction accuracy but also considerably reduces training time and memory usage.

physics.soc-ph↗