English

Non-Gaussianity of the Stagnation Law in Particle Swarm Optimization

Probability 2026-07-25 v1

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 ww and acceleration range cc, we prove that throughout the open mean-square stability region 1<w<1,c>0,12(1w2)c(75w)>0, -1<w<1,\qquad c>0,\qquad 12(1-w^2)-c(7-5w)>0, 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-107107 polynomial branch. Exact eighth-order equations exclude every point on that branch. The final certificate is verified using arithmetic modulo 2323 and independently modulo 1,000,0031{,}000{,}003. A separate raw-moment implementation produces exact polynomials Q4,Q6,Q8Q_4,Q_6,Q_8 in (w,c)(w,c) 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}
}