Year: 2026
Type: article
Abstract: This study proposes a Cucker-Smale model incorporating dynamic networks and the discrete p-Laplacian ( ), 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 a finite time and derive a quantitative relationship between the lower bound of the flocking time and graph volume.Results show that imposing sufficiently small flocking time increases the network volume, and that a larger initial velocity variance requires greater volume under the same time constraint.In our experiments, we trained a transformer-based proximal policy optimization 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 the convergence time and average number of connections reflects the theoretical results.This study provides quantitative evidence of the phenomenon that time constraints induce connection mobilization.
Authors: Sooyeon Song, Jea-Hyun Park
Institution: Kunsan National University
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Awards: G548782738, G8442698958
OpenAlex ID: W7166686920
FWCI:
Cites:
Cited by:
Related to: