SearcharxivSearch

arXiv · 2608.11976

Maximally chaotic competition for attention in the cultural domain

Abstract

Memory is a key determinant when cultural items compete for attention and, consequently, for success, as in the case of songs on a music chart. For modeling, one adds memory to Lotka-Volterra models, the reference for Markovian competitive processes. Here we treat memory in terms of an exponential moving average, finding that it leads to an extended region of winnerless chaos characterized by log-normal popularity statistics in trailing top-k charts. Importantly, the observed log-normal behavior collapses to a power-law distribution when the feedback dynamics is fast on the scale of the charting period. This result is in agreement with the observed statistics of real-world music charts (e.g., Billboard and Spotify). In a chaotic state, the size of the largest Lyapunov exponent is a measure of how unpredictable the system is. We find that the largest Lyapunov exponent varies strongly as a function of parameters in the phase where winnerless chaos is stable. Interestingly, the sets of parameters obtained by comparing simulations with real-world cultural-item dynamics extracted from Google Books and Google Trends, movies, Reddit, Wikipedia, Twitter, and scientific publications, are located close to the points in parameter space where the largest Lyapunov exponent reaches its local maximum, namely, close to the point of maximal unpredictability. This result suggests that cultural competitive processes are maximally chaotic when memory is a key determinant.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

András Rusu, Claudius Gros, Bulcsú Sándor. 2026-08-12. Maximally chaotic competition for attention in the cultural domain. https://arxiv.org/abs/2608.11976

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

KEEP EXPLORING

Related papers

Linear Response Predicts Cusp-Pair Births in Networks with a Localized Cubic

Linear response is cheap to measure; the bistability boundaries it organizes are not. For a passive network with one localized cubic, the driving-point receptance $G$ fixes the period-one cusp set at fundamental-harmonic order: cusps lie on a fixed phase contour of $G$, a tangency of that contour under parameter variation creates a pair, and its curvature separates a gap opening from an isolated loop. For a two-mode absorber the linear prediction locates a benchmark birth coupling to $0.3\%$, and to $0.03\%$ once a third-harmonic correction of scale $|G(3\Omega)/G(\Omega)|$ is included.

nlin.CD

Dynamics Creation through Neural Dynamical Transfer Learning

Data-driven machine learning has established a robust foundation for reconstructing nonlinear dynamical systems from observations, primarily for the purposes of forecasting and control. However, most existing efforts focus on recovering specific observed dynamics rather than the generative synthesis of new ones. Inspired by image fusion and style transfer, we introduce a neural network framework termed Neural Dynamical Transfer Learning (NDTL) to create new systems with prescribed dynamics from pairs of parent nonlinear dynamical systems. By computing fundamental dynamical signatures, including the intrinsic dimension, the Kaplan-Yorke dimension, the invariant measure statistics, and the Lyapunov spectrum, we demonstrate that NDTL preserves key features inherited from the parent models while simultaneously generating novel dynamics. Beyond these validation examples, NDTL induces a criterion for dynamics classification, creates stable oscillatory coexistence in the Hastings-Powell food chain model, produces interpretable epidemiological models, and provides a chaotic source for image encryption.

nlin.CD

The Spectral Skeleton of Chaos: Koopman Wave Packets on Poincar\'e Sections

A Poincar\'e section replaces a flow by a return map, but for a chaotic system this map is usually known only from sampled crossings. We show that coarse transport can be read directly from Koopman spectral data, without fitting the map. Measure-preserving EDMD retains the isometric structure; riggedDMD then approximates spectral measures and constructs finite regularized wave packets. Packet phase supplies a finite-resolution transport coordinate; low modulus marks a singular skeleton where the phase becomes ill-conditioned. We demonstrate the idea on the R\"ossler system, a 32-mode Kuramoto--Sivashinsky Galerkin system, and the forced Duffing oscillator. The packets yield coarse symbolic models on sections ranging from an almost one-dimensional curve to a visibly thick set. Their graphs organize observed low-period orbits and guide targeted searches for others. In Duffing Regime~II, a seven-region rule accounts for $91\%$--$94\%$ of filtered one-step transitions, while failures in the lowest retained modulus decile occur at $5.08$--$5.20$ times the overall rate. The packets are not Koopman eigenfunctions, nor are the regions exact Markov partitions. Together these computations show how spectral information beyond isolated eigenpairs can expose chaotic transport directly from trajectories.

nlin.CD