The coauthorship in a paper set can be expressed by a hypergraph, namely a system with heterogeneously multinary relationship. The coauthorship network of that paper set is the simple graph extracted from that hypergraph. We designed a distributed hypergraph model to simulate the dynamics of large coauthorship networks in a full-scale manner. Its assembly mechanism of hyperedges is driven by Lotka’s law and a cooperative game that maximizes a benefit-cost ratio for coauthoring a paper. The model is built on a circle to express the game, expressing the cost by the distance between nodes. The benefit of coauthoring with a productive author or one with many coauthors is expressed by the cumulative degree or hyperdegree of nodes. The model successfully simulates the multimodal features emerged in the evolutions of coauthorship patterns, the clustering of nodes, the degree assortativity of linked nodes, degree and hyperdegree distributions. This model has the potential to be a null model for studying the complexity of the large social networks arising from other specific collaboration behaviors.

论文集中的合著者可以用超图表示，即具有异类多元关系的系统。该论文集的共同作者网络是从该超图中提取的简单图。我们设计了一个分布式超图模型，以大规模方式模拟大型共同作者网络的动态。它的hyperedges组装机制是由洛特卡定律和一个合作博弈驱动的，该博弈最大程度地提高了共同撰写论文的成本效益比。该模型建立在一个圆上来表示游戏，用节点之间的距离表示成本。与生产作者或与许多作者共同创作的好处是通过节点的累积度或超度来表示的。该模型成功地模拟了共同作者模式演变中出现的多模式特征，节点的聚类，链接节点的度分类，度和超度分布。该模型有可能成为无效模型，用于研究由其他特定协作行为引起的大型社交网络的复杂性。