动态网络 Cucker-Smale 模型中 flocking 时间与图体积的定量关系
Flocking Time and Graph Volume in Nonlinear Cucker-Smale Models with Dynamic Networks
这篇论文把群集运动的时间约束和网络连接数做成了定量关系,还用 transformer 加 PPO 训练策略动态调网络结构。做多智能体系统或分布式控制的人可以看看,阈值效应那部分和理论对得上。
arXiv 论文提出一个结合动态网络与离散 p-Laplacian(p∈(1,2))的 Cucker-Smale 模型,从理论与实验两方面分析 flocking 时间约束与图连通性之间的关系。研究证明该模型可在有限时间内达成 flocking,并推导出 flocking 时间下界与图体积之间的定量关系。
基于这一关系,作者发现足够小的 flocking 时间约束会诱导网络体积增大;在相同时间约束下,初始速度方差越大,所需的图体积也越大。实验部分训练了基于 transformer 的 PPO 策略,在每个时间步选择网络结构,在最严格的时间约束下最大平均连接数急剧上升,呈现明显的阈值效应。
实验中收敛时间与平均连接数之间的负相关与理论结果相符,为“时间约束诱导连接动员”这一现象提供了定量证据。
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 $p$-Laplacian ($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.
本条情报归属 AITOP「论文」核心追踪栏目。涉及核心实体与技术议题包括:Cucker-Smale、p-Laplacian、多智能体系统、PPO,读者可通过下方标签进入对应专题页查阅历史脉络与关联对比。
信源核验说明:本文原始线索采编自「arXiv cs.LG」(@Sooyeon Song, Jea-Hyun Park),经 AITOP 多维评分管线结构化提炼。