arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2003.00736cs.DScs.SI
收藏

可扩展网络生成的最新进展

Recent Advances in Scalable Network Generation

Manuel Penschuck, Ulrik Brandes, Michael Hamann, Sebastian Lamm, Ulrich Meyer, Ilya Safro, Peter Sanders, Christian Schulz

摘要:

随机图模型经常被用作各种研究领域实验活动的可控和通用数据源。大规模生成这样的数据集是一项重要的任务,因为它需要通常跨越多个专业领域的设计决策。挑战开始于识别相关的特定领域的网络功能,继续与如何将这些功能编译成一个易于处理的模型的问题,并最终在算法的细节,同时实现相关的模型。在本调查中,我们将探索随机图模型与已知的可扩展生成器的关键方面。我们首先简要介绍了这种模型所考虑的网络特征,然后讨论随机图及其生成算法。我们的重点在于建模技术和算法原语,已被证明是成功的,在获得大量的图形。我们考虑各种领域(如社交网络,基础设施,生态学和数值模拟)的概念和图形模型,并讨论不同计算模型(包括共享内存并行,并行GPU和分布式系统)的生成器。

英文摘要:

Random graph models are frequently used as a controllable and versatile data source for experimental campaigns in various research fields. Generating such data-sets at scale is a non-trivial task as it requires design decisions typically spanning multiple areas of expertise. Challenges begin with the identification of relevant domain-specific network features, continue with the question of how to compile such features into a tractable model, and culminate in algorithmic details arising while implementing the pertaining model. In the present survey, we explore crucial aspects of random graph models with known scalable generators. We begin by briefly introducing network features considered by such models, and then discuss random graphs alongside with generation algorithms. Our focus lies on modelling techniques and algorithmic primitives that have proven successful in obtaining massive graphs. We consider concepts and graph models for various domains (such as social network, infrastructure, ecology, and numerical simulations), and discuss generators for different models of computation (including shared-memory parallelism, massive-parallel GPUs, and distributed systems).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑