Do-it-yourself networks: a novel method of generating weighted networks

被引:6
|
作者
Shanafelt, D. W. [1 ,2 ]
Salau, K. R. [3 ]
Baggio, J. A. [4 ]
机构
[1] CNRS, Ctr Biodivers Theory & Modelling, Theoret & Expt Ecol Stn, F-09200 Moulis, France
[2] Paul Sabatier Univ, F-09200 Moulis, France
[3] Univ Arizona, Dept Math, 617 North Santa Rita Ave, Tucson, AZ 85721 USA
[4] Utah State Univ, Dept Environm & Soc, 5215 Old Main Hill, Logan, UT 84322 USA
来源
ROYAL SOCIETY OPEN SCIENCE | 2017年 / 4卷 / 11期
基金
美国国家科学基金会; 欧洲研究理事会;
关键词
adjacency matrix; network and graph theory; optimization; weighted network; LANDSCAPE CONNECTIVITY; DYNAMICS; HABITAT; MODEL; GRAPH; BIODIVERSITY; CENTRALITY; INSURANCE; STABILITY;
D O I
10.1098/rsos.171227
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Network theory is finding applications in the life and social sciences for ecology, epidemiology, finance and social-ecological systems. While there are methods to generate specific types of networks, the broad literature is focused on generating unweighted networks. In this paper, we present a framework for generating weighted networks that satisfy user- defined criteria. Each criterion hierarchically defines a feature of the network and, in doing so, complements existing algorithms in the literature. We use a general example of ecological species dispersal to illustrate the method and provide open- source code for academic purposes.
引用
收藏
页数:9
相关论文
共 50 条