We study the problem of modeling temporal networks constrained by the size of a concurrent set, a characteristic of temporal networks shown to be important in many application areas, e.g., in transportation, social, process, and other networks. We propose a competition-driven model for the generation of such constrained networks. Our method carries out turns of competitions along the timeline where each node in a network is labeled with a probability to gain outgoing edges in competitions. We present a thorough theoretical analysis to investigate the cardinality and degree distributions of the generated networks. Our experimental results demonstrate that our model simulates real-world networks well and generates networks efficiently and at scale.

我们研究了受并发集大小约束的时间网络建模问题，时间网络的一个特征在许多应用领域中很重要，例如，在交通、社会、过程和其他网络中。我们提出了一个竞争驱动的模型来生成这种受约束的网络。我们的方法沿着时间线进行轮流竞争，其中网络中的每个节点都被标记为在竞争中获得输出边的概率。我们提出了一个彻底的理论分析来研究生成网络的基数和度分布。我们的实验结果表明，我们的模型很好地模拟了现实世界的网络，并有效地、大规模地生成了网络。