arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.12862cs.DC
收藏

群体协议中的完全图识别

Complete Graph Identification in Population Protocols

Haruki Kanaya, Yuichi Sudo

AI总结:

本文研究群体协议中的完全图识别问题,要求智能体判断通信图是否为团。研究表明在全局公平性下无需先验知识需$O(n^2)$状态,已知$n$时弱公平性下需$O(n)$状态,但仅知上限$P$时弱公平性下不可解。

摘要:

我们考虑群体协议模型,其中不可区分的状态机(称为智能体)成对进行通信。通信图指定了智能体对之间的潜在交互(即通信)。本文解决完全图识别问题,要求智能体判断其通信图是否为团。我们基于以下因素评估各种设置:(i) 对抗性调度器保持的公平性——全局公平性或弱公平性,以及(ii) 预先提供给智能体的知识——确切的人口规模$n$、$n$的公共上限$P$,或无先验信息。积极方面,我们证明在无先验知识的情况下,每个智能体使用$O(n^2)$种状态足以在全局公平性下解决完全图识别问题。在已知$n$的先验知识时,智能体仅需$O(n)$种状态即可在弱公平性下解决该问题。消极方面,我们证明当仅知道人口规模$n$的公共上限$P$时,完全图识别在弱公平性下仍然不可解。

英文摘要:

We consider the population protocol model where indistinguishable state machines, referred to as agents, communicate in pairs. The communication graph specifies potential interactions (\ie communication) between agent pairs. This paper addresses the complete graph identification problem, requiring agents to determine if their communication graph is a clique or not. We evaluate various settings based on: (i) the fairness preserved by the adversarial scheduler -- either global fairness or weak fairness, and (ii) the knowledge provided to agents beforehand -- either the exact population size $n$, a common upper bound $P$ on $n$, or no prior information. Positively, we show that $O(n^2)$ states per agent suffice to solve the complete graph identification problem under global fairness without prior knowledge. With prior knowledge of $n$, agents can solve the problem using only $O(n)$ states under weak fairness. Negatively, we prove that complete graph identification remains unsolvable under weak fairness when only a common upper bound $P$ on the population size $n$ is known.

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

↑