In the population protocol model, many problems cannot be solved in a self-stabilizing way. However, global knowledge, such as the number of nodes in a network, sometimes allows us to design a self-stabilizing protocol for such problems. In this paper, we investigate the effect of global knowledge on the possibility of self-stabilizing population protocols in arbitrary graphs. Specifically, we clarify the solvability of the leader election problem, the ranking problem, the degree recognition problem, and the neighbor recognition problem by self-stabilizing population protocols with knowledge of the number of nodes and/or the number of edges in a network.

中文翻译：

---

自稳定人口协议的全球知识的力量

在种群协议模型中，很多问题无法通过自稳定的方式解决。然而，全局知识，例如网络中的节点数量，有时允许我们为此类问题设计自稳定协议。在本文中，我们研究了全局知识对任意图中自稳定种群协议的可能性的影响。具体来说，我们通过了解网络中节点数和/或边数的自稳定种群协议来阐明领导者选举问题、排序问题、度识别问题和邻居识别问题的可解性。