Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2408.06434

New Coevolution Dynamic as an Optimization Strategy in Group Problem Solving

Francis Ferreira Franco·Paulo Freitas Gomes
View original source ↗Read source document ↗Export metadata ↓

Abstract

Coevolution on social models couples the time evolution of the network with the time evolution of the states of the agents. This paper presents a new coevolution dynamic allowing more than one rewiring on the network. We explore how this coevolution can be employed as an optimization strategy for problem-solving capability of task-forces. We used an agent-based model study how this new coevolution dynamic can help a group of agents whose task is to find the global maxima of NK fitness landscapes. Each agent can replace more than one neighbors, and this quantity is a tunable parameter in the model. These rewirings is a way for the agent to obtain information from individuals that were not previously part of its neighborhood. Our results showed that this tunable coevolution can indeed produce gain on the computational cost under certain circunstances. At low average degree (using a random network to connect the agents) and on easy landscape, more rewirings return lower cost, helping the agents to find the global maximum faster. However, at larger average degree and difficult landscape, the effect is more complex. At medium size systems, the coevolution brings optimal results when 3 or 4 neighbors are replaced.

Explore related subjects

nlin.CDphysics.soc-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Francis Ferreira Franco, Paulo Freitas Gomes. 2024-08-12. New Coevolution Dynamic as an Optimization Strategy in Group Problem Solving. https://doi.org/10.1140/epjb%2Fs10051-024-00828-8

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗