Non-Gaussianity of the Stagnation Law in Particle Swarm Optimization
Abstract
We study one-dimensional particle swarm optimization during stagnation, with two fixed distinct attractors and equal independent uniform acceleration ranges. The position then satisfies a second-order random affine recurrence. For inertia and acceleration range , we prove that throughout the open mean-square stability region no invariant position marginal, and hence no limiting position marginal, can be Gaussian. This solves the open Problem 18 in \cite{ParticleSwarmProblems}. The proof compares the stationary moment equations with the Gaussian moment identities through order eight. A Hermite-polynomial formulation gives explicit fourth- and sixth-order compatibility conditions whose common solutions lie on a degree- polynomial branch. Exact eighth-order equations exclude every point on that branch. The final certificate is verified using arithmetic modulo and independently modulo . A separate raw-moment implementation produces exact polynomials in and verifies the same obstruction over the rational numbers. The fourth- and sixth-order curves have a genuine admissible intersection, but the eighth-order condition removes it, showing why low-order Gaussian diagnostics are insufficient. All code, exact polynomials, logs, and plot-validation data are supplied as online resources.
Keywords
Cite
@article{arxiv.2607.23381,
title = {Non-Gaussianity of the Stagnation Law in Particle Swarm Optimization},
author = {Alexandra - Ionela Andriciuc and David - Corneliu Turturean and Ionel Popescu},
journal= {arXiv preprint arXiv:2607.23381},
year = {2026}
}