arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1604.08381math.OCcs.MAmath.DSnlin.AO
收藏

树上脉冲耦合振子的全局同步

Global synchronization of pulse-coupled oscillators on trees

Hanbaek Lyu

摘要:

考虑有限简单图$G=(V,E)$上的分布式网络,其直径为$d$,最大度为$Δ$,其中每个节点都有一个相位振荡器以单位速度在$S^{1}=\mathbb{R}/\mathbb{Z}$上旋转。脉冲耦合是受生物振荡器的启发而提出的一种网络化相位振荡器的分布式时间演化规则,它只依赖于事件触发的局部脉冲通信。本文提出了一种新的抑制脉冲耦合,证明了当$G$是树和$Δ\le 3$时,$G$上的任意相位结构都可以被时间$51d$所取代.我们通过让每个振荡器根据辅助状态变量调节输入来扩展这种脉冲耦合。我们证明了,如果$G$是一棵树,那么所得到的自适应脉冲耦合将通过时间$83d$来逼近$G$上的任意初始配置。作为应用,我们得到了一个通用的随机分布式时钟同步算法,它使用每个节点的$O(\log Δ)$内存,并收敛于任何$G$,预期最坏情况下的运行时间为$O(|V|+(d^{5}+Δ^{2})\log |V|)$。

英文摘要:

Consider a distributed network on a finite simple graph $G=(V,E)$ with diameter $d$ and maximum degree $Δ$, where each node has a phase oscillator revolving on $S^{1}=\mathbb{R}/\mathbb{Z}$ with unit speed. Pulse-coupling is a class of distributed time evolution rule for such networked phase oscillators inspired by biological oscillators, which depends only upon event-triggered local pulse communications. In this paper, we propose a novel inhibitory pulse-coupling and prove that arbitrary phase configuration on $G$ synchronizes by time $51d$ if $G$ is a tree and $Δ\le 3$. We extend this pulse-coupling by letting each oscillator throttle the input according to an auxiliary state variable. We show that the resulting adaptive pulse-coupling synchronizes arbitrary initial configuration on $G$ by time $83d$ if $G$ is a tree. As an application, we obtain a universal randomized distributed clock synchronization algorithm, which uses $O(\log Δ)$ memory per node and converges on any $G$ with expected worst case running time of $O(|V|+(d^{5}+Δ^{2})\log |V|)$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑