Coordination Funds

协调基金

• 批准号: 438507685
• 负责人: Professor Dr. Martin Hoefer
• 金额: --
• 依托单位: Arbeitsgruppe Algorithmen und Komplexität
• 依托单位国家: 德国
• 项目类别: Research Units
• 资助国家: 德国
• 项目状态: 未结题
• 来源: https://gepris.dfg.de/gepris/projekt/438507685?language=en
• 关键词: Coordination; Funds

The focus of this unit remains the analysis of dynamical processes on complex networks, their uses, their equilibria, and their unintended, potentially cataclysmic consequences, by means of the rigorous analytical machinery of the theory of computing. Computer science in the 21st century faces the necessity to cope with complex interactions that, rather than being designed by a purposeful authority, are shaped by natural, economical, or social forces. We urgently require tools to model such complex interactions, the processes that unfold on them, the equilibria that they may attain as well as the algorithmic tools to simulate such processes. The overarching aim of this research group is to develop these tools. In the second phase, the unit will adjust the research efforts to work on a set of timely and challenging directions. It will maintain a mixture of modeling network processes, design and analysis of dynamics and protocols, as well as simulation and experiments. A central aspect explored in the second phase is the temporal evolution of networks. While static random graph models of various types have been the mainstay of network science for nearly three decades, these models have obvious limitations when it comes to modelling, e.g., contact networks, which require a time axis. At present it is far from clear whether the main hypothesis of network science -- that networks across different contexts exhibit similar fundamental properties -- holds true of temporal networks as well. A further new aspect is metastability, i.e., the presence of attractive out-of-equilibrium states that may trap dynamics for an extraordinarily long period of time. A third new aspect is the role of structural network properties, in connection with fine-grained complexity theory. The underlying question is to what extent ideas from structural graph theory can replace probabilistic modelling assumptions.

本单元的重点仍然是通过计算理论的严格分析机制来分析复杂网络上的动态过程、其用途、其平衡以及其意想不到的、潜在的灾难性后果。世纪的计算机科学面临着科普复杂交互的必要性，这些交互不是由有目的的权威设计的，而是由自然、经济或社会力量塑造的。我们迫切需要工具来模拟这种复杂的相互作用，在它们上展开的过程，它们可能达到的平衡以及模拟这种过程的算法工具。该研究小组的首要目标是开发这些工具。在第二阶段，该股将调整研究工作，朝着一系列及时和具有挑战性的方向努力。它将保持网络过程建模，动态和协议的设计和分析，以及仿真和实验的混合。在第二阶段探索的一个中心方面是网络的时间演变。虽然近三十年来各种类型的静态随机图模型一直是网络科学的支柱，但这些模型在建模时具有明显的局限性，例如，联系网络，这需要一个时间轴。目前还不清楚网络科学的主要假设--不同背景下的网络表现出相似的基本属性--是否也适用于时间网络。另一个新的方面是亚稳态，即，存在有吸引力的非平衡态，可能会在很长一段时间内捕获动力学。第三个新的方面是结构网络属性的作用，与细粒度复杂性理论有关。根本的问题是，结构图理论的思想在多大程度上可以取代概率建模假设。