math.DSNov 17, 2026

Flocking Time and Graph Volume in Nonlinear Cucker-Smale Models with Dynamic Networks

Authors: Sooyeon Song, Jea-Hyun Park

Organizations: Department of Mathematics, Kunsan National University, 558 Daehak-ro, Gunsan-si, Jeollabuk-do 54150, Republic of Korea

Abstract

This study proposes a Cucker-Smale model incorporating dynamic networks and the discrete pp-Laplacian (p∈(1,2)p \in (1,2)) and analyzes the relationship between flocking time constraints and graph connectivity from both theoretical and experimental perspectives. We establish that this model achieves flocking within finite time and derive a quantitative relationship between the lower bound of flocking time and graph volume. Based on these results, we observe that imposing sufficiently small flocking time induces an increase in network volume, and that larger initial velocity variance requires greater volume under the same time constraint. In our experiments, we trained a transformer-based PPO policy to select network structures at each time step. Under the most stringent time constraint, the maximum average number of connections increased sharply, confirming a threshold effect. The negative correlation between convergence time and average number of connections reflects the theoretical results well. This study provides quantitative evidence for the phenomenon that time constraints induce connection mobilization.

Figures & tables

Explore similar work

Nov 1, 2026

Directional Bounded-Confidence Cucker-Smale Flocking

This paper introduces a directional bounded-confidence extension of the Cucker--Smale (CS) flocking model that decomposes pairwise relative velocities into independent radial and tangential channels within the instantaneous line-of-sight frame. Gating these components via compactly supported kernels creates a time-varying, state-dependent, matrix-weighted interaction that strictly generalizes classical scalar CS alignment. We establish an exact energy-dissipation identity with conserved mean velocity and prove exponential velocity consensus under a sliding-window persistent excitation (PE) condition formulated directly on the disagreement subspace. Furthermore, we derive a CS bounded-diameter criterion separating metric decay from aggregate directional coercivity, along with a cluster convergence guarantee. Simulations validate the exact dissipation balance and demonstrate that directional gating successfully restores global alignment in scenarios where traditional isotropic tied-confidence laws remain polarized.
Oct 23, 2026

On the Limits of Stochastic Push-Pull over Time-Varying Digraphs

Stochastic Push-Pull achieves linear speedup with respect to the network size nn on static strongly connected digraphs, but whether this speedup persists on time-varying networks remains unclear. In this work, we construct a quadratic decentralized problem on period-two networks showing that stochastic Push-Pull may fail to attain linear speedup over time-varying digraphs. For pp-periodic networks, we identify an effective node count neff≤nn_{\mathrm{eff}}\le n that governs the leading stochastic term. Specifically, for smooth nonconvex objectives, we establish convergence upper bounds and matching lower bounds for stochastic Push-Pull with constant stepsizes, both exhibiting the leading-order dependence Θ(1/neffT)Θ(1/\sqrt{n_{\mathrm{eff}} T}). When p=1p=1, the identity neff=nn_{\mathrm{eff}}=n recovers the usual linear speedup for static digraphs. However, periodic networks can have neff=o(n)n_{\mathrm{eff}}=o(n), demonstrating the loss of linear speedup under temporal variation. Numerical experiments illustrate effective-count scaling and the separation between static and periodic networks, consistent with our theoretical findings.
Mar 16, 2026

Analytically tractable model of synaptic crowding explains emergent small-world structure and network dynamics

Neural circuits must balance local connectivity constraints against the need for global integration. Here we introduce a minimal wiring rule motivated by synaptic crowding: as a neuron accumulates incoming connections, each additional synapse becomes progressively harder to form. This single-parameter model admits an exact finite-size solution for the induced in-degree distribution and yields simple scaling laws: mean connectivity grows only logarithmically with network size while variance remains bounded -- consistent with homeostatic regulation of synaptic density. When candidates are encountered in order of spatial proximity, the crowding rule produces a broad, approximately power-law distribution of connection lengths without prescribing any explicit distance-dependent wiring law; combined with shortcut rewiring, this yields networks with small-world characteristics. We further show that the induced degree statistics largely determine attractor basin boundaries in threshold network dynamics, while local clustering primarily modulates the prevalence of long-lived non-absorbing outcomes near these boundaries. The model provides testable predictions linking local developmental constraints to macroscopic network organization and dynamics.