历史树及其应用
History Trees and Their Applications
AI总结：
本文介绍历史树这一离散结构，回顾其在匿名动态网络中设计最优确定性算法的应用与最新进展，并扩展其理论框架、提出若干开放问题。
摘要：
在分布式通信网络的理论研究中，“历史树”是一种离散结构，它自然地刻画了这样一个概念：匿名智能体在从相邻智能体接收到不同的消息集合后，会变得可区分。通过以系统化的方式方便地组织时间信息，历史树在开发针对既匿名又动态演化的网络的最优确定性算法方面发挥了重要作用。本说明提供了对历史树的易于理解的介绍，将其与现有文献中更传统的结构进行比较，并回顾了历史树应用的最新进展，尤其是在动态网络中的进展。此外，本文还在新的方向上扩展了历史树的理论框架，同时指出了若干有待进一步研究的开放问题。
英文摘要：
In the theoretical study of distributed communication networks, "history trees" are a discrete structure that naturally models the concept that anonymous agents become distinguishable upon receiving different sets of messages from neighboring agents. By conveniently organizing temporal information in a systematic manner, history trees have been instrumental in the development of optimal deterministic algorithms for networks that are both anonymous and dynamically evolving. This note provides an accessible introduction to history trees, drawing comparisons with more traditional structures found in existing literature and reviewing the latest advancements in the applications of history trees, especially within dynamic networks. Furthermore, it expands the theoretical framework of history trees in new directions, also highlighting several open problems for further investigation.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
