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

CardsList
  1. Directional Bounded-Confidence Cucker-Smale Flocking

    Nov 1, 2026Hossein B. JondEmergent Behavior in Multi-Agent SystemsMulti-Agent Consensus

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

    Oct 23, 2026Feiming Wang, Yutong He, Sulaiman Alghunaim +1Decentralized OptimizationStochastic Optimization Convergence

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

    Mar 16, 2026Makoto FukushimaBrain Network Analysis