Author:
Yuan Yelie,Wang Tiandong,Yan Jun,Zhang Panpan
Abstract
Preferential attachment (PA) network models have a wide range of applications in various scientific disciplines. Efficient generation of large-scale PA networks helps uncover their structural properties and facilitate the development of associated analytical methodologies. Existing software packages only provide limited functions for this purpose with restricted configurations and efficiency. We present a generic, user-friendly implementation of weighted, directed PA network generation with R package wdnet. The core algorithm is based on an efficient binary tree approach. The package further allows adding multiple edges at a time, heterogeneous reciprocal edges, and user-specified preference functions. The engine under the hood is implemented in C++. Usages of the package are illustrated with detailed explanation. A benchmark study shows that wdnet is efficient for generating general PA networks not available in other packages. In restricted settings that can be handled by existing packages, wdnet provides comparable efficiency.
Publisher
School of Statistics, Renmin University of China
Subject
Industrial and Manufacturing Engineering
Reference28 articles.
1. Betweenness centrality as a driver of preferential attachment in the evolution of research collaboration networks;Journal of Informatics,2012
2. Efficient network generation under general preferential attachment;Computational Social Networks,2015
3. Emergence of scaling in random networks;Science,1999
4. Weighted evolving networks: Coupling topology and weight dynamics;Physical Review Letters,2004
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献