arXiv subjects

Sebastian Zimper

Publications and source records attributed to Sebastian Zimper.

5 recordsLinked to original sources

arXiv2026

Clustering in co-evolving opinion dynamics: reduced SPDE models

Clustering is a fundamental collective phenomenon in agent-based models (ABMs) of opinion dynamics. To study clustering in systems with co-evolving social and opinion variables, we derive stochastic partial differential equation (SPDE) models that describe the evolution of clusters on a reduced state space. We consider two settings: one in which opinions do not affect social interactions, and another one in which a feedback mechanism couples the two. Our approach extends reduced PDE modelling to a stochastic framework, which is essential for capturing long-term cluster behaviour. Numerical experiments demonstrate that the proposed reduced SPDEs substantially decrease computational cost compared to full-state SPDE models, such as the Dean-Kawasaki equation, while still accurately reproducing the clustering behaviour of the underlying ABM. As a result, these reduced models provide an efficient tool for studying systems with large populations, including those arising in the analysis of real-world data: in particular, we provide an application related to the large-scale General Social Survey (GSS), which comprises opinion and social data of the US population since 1972.

physics.soc-ph↗

arXiv2025

Mean-field optimal control with stochastic leaders

We consider interacting agent systems with a large number of stochastic agents influenced by a fixed number of external stochastic lead agents. Such settings arise, for example in models of opinion dynamics, where a small number of leaders can steer the behaviour of a large population of followers. In this context, we study a partial mean-field limit where the number of followers tends to infinity, while the number of leaders stays constant. The partial mean-field limit dynamics is then given by a McKean-Vlasov stochastic differential equation (SDE) for the followers, coupled to a controlled It\^o-SDE governing the dynamics of the lead agents. For a given cost functional that the lead agents seek to minimise, we show that the unique optimal control of the finite agent system converges to the optimal control of the limiting system. This establishes that the low-dimensional control of the partial (mean-field) system provides an effective approximation for controlling the high-dimensional finite agent system. In addition, we propose a stochastic gradient descent algorithm that can efficiently approximate the mean-field control. Our theoretical results are illustrated on opinion dynamics model with lead agents, where the control objective is to drive the followers to reach consensus.

math.OC↗

arXiv2024

On reduced inertial PDE models for Cucker-Smale flocking dynamics

In particle systems, flocking refers to the phenomenon where particles' individual velocities eventually align. The Cucker-Smale model is a well-known mathematical framework that describes this behavior. Many continuous descriptions of the Cucker-Smale model use PDEs with both particle position and velocity as independent variables, thus providing a full description of the particles mean-field limit (MFL) dynamics. In this paper, we introduce a novel reduced inertial PDE model consisting of two equations that depend solely on particle position. In contrast to other reduced models, ours is not derived from the MFL, but directly includes the model reduction at the level of the empirical densities, thus allowing for a straightforward connection to the underlying particle dynamics. We present a thorough analytical investigation of our reduced model, showing that: firstly, our reduced PDE satisfies a natural and interpretable continuous definition of flocking; secondly, in specific cases, we can fully quantify the discrepancy between PDE solution and particle system. Our theoretical results are supported by numerical simulations.

math.AP↗

arXiv2023

Performance of chaos diagnostics based on Lagrangian descriptors. Application to the 4D standard map

We investigate the ability of simple diagnostics based on Lagrangian descriptor (LD) computations of initially nearby orbits to detect chaos in conservative dynamical systems with phase space dimensionality higher than two. In particular, we consider the recently introduced methods of the difference ($D_L^n$) and the ratio ($R_L^n$) of the LDs of neighboring orbits, as well as a quantity ($S_L^n$) related to the finite-difference second spatial derivative of the LDs, and use them to determine the chaotic or regular nature of ensembles of orbits of a prototypical area-preserving map model, the 4-dimensional (4D) symplectic standard map. Using the distributions of the indices' values we determine appropriate thresholds to discriminate between regular and chaotic orbits, and compare the obtained characterization against that achieved by the Smaller Alignment Index (SALI) method of chaos detection, by recording the percentage agreement $P_A$ between the two classifications. We study the influence of various factors on the performance of these indices, and show that the increase of the final number of orbit iterations T and the order n of the indices (i.e. the dimensionality of the space where the considered nearby orbits lie), as well as the decrease of the distance $\sigma$ of neighboring orbits, increase the $P_A$ values along with the required computational effort. Balancing between these two factors we find appropriate T, n and $\sigma$ values, which allow the efficient use of the $D_L^n$, $R_L^n$ and $S_L^n$ indices as short time and computationally cheap chaos diagnostics achieving $P_A \gtrsim 90 \%$, with $D_L^n$ and $S_L^n$ having larger $P_A$ values than $R_L^n$. Our results show that the three LDs-based indices perform better for systems with large percentages of chaotic orbits.

astro-ph.EP↗

arXiv2022

Quantifying chaos using Lagrangian descriptors

We present and validate simple and efficient methods to estimate the chaoticity of orbits in low dimensional dynamical systems from computations of Lagrangian descriptors (LDs) on short time scales. Two quantities are proposed for determining the chaotic or regular nature of orbits in a system's phase space, which are based on the values of the LDs of these orbits and of nearby ones: The difference (DNLD) and ratio (RNLD) of neighboring orbits' LDs. We find that, typically, these indicators are able to correctly characterize the chaotic or regular nature of orbits to better than 90 % agreement with results obtained by implementing the Smaller Alignment Index (SALI) method, which is a well established chaos detection technique. Further investigating the performance of the two introduced quantities we discuss the effects of the total integration time and of the spacing between the used neighboring orbits on the accuracy of the methods, finding that even typical short time, coarse grid LD computations are sufficient to provide a reliable quantification of a system's chaotic component, using less CPU time than the SALI. In addition to quantifying chaos, the introduced indicators have the ability to reveal details about the systems' local and global chaotic phase space structure. Our findings clearly suggest that LDs can also be used to quantify and investigate chaos in continuous and discrete low dimensional dynamical systems.

nlin.CD↗