跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.22204 · v1

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

首次提交 2026-11-17 12:41
版本更新 2026-11-17 12:41
雷达观测 2026-11-18 19:43
arXiv ↗PDF ↗

摘要

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.

作者备注:14 pages, 3 figures. Accepted manuscript of the article published in J. Inf. Commun. Converg. Eng. 24(2), 155-164 (2026)

期刊信息:J. Inf. Commun. Converg. Eng. 24(2), 155-164 (2026)

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-17 12:41 · 最新观测版本

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

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.

查看此版本解读 →查看此版本原文 ↗