Graph models of habitat mosaics

被引:443
作者
Urban, Dean L. [1 ]
Minor, Emily S. [1 ]
Treml, Eric A. [1 ]
Schick, Robert S. [1 ]
机构
[1] Duke Univ, Nicholas Sch Environm, Durham, NC 27708 USA
关键词
Connectivity; conservation; graph theory; habitat; landscape; metapopulation; network analysis; LANDSCAPE CONNECTIVITY; METAPOPULATION DYNAMICS; POPULATION CONNECTIVITY; FORESTED LANDSCAPE; CIRCUIT-THEORY; GENE FLOW; CONSERVATION; DISPERSAL; CORRIDORS; SCALE;
D O I
10.1111/j.1461-0248.2008.01271.x
中图分类号
Q14 [生态学(生物生态学)];
学科分类号
071012 ; 0713 ;
摘要
Graph theory is a body of mathematics dealing with problems of connectivity, flow, and routing in networks ranging from social groups to computer networks. Recently, network applications have erupted in many fields, and graph models are now being applied in landscape ecology and conservation biology, particularly for applications couched in metapopulation theory. In these applications, graph nodes represent habitat patches or local populations and links indicate functional connections among populations (i.e. via dispersal). Graphs are models of more complicated real systems, and so it is appropriate to review these applications from the perspective of modelling in general. Here we review recent applications of network theory to habitat patches in landscape mosaics. We consider (1) the conceptual model underlying these applications; (2) formalization and implementation of the graph model; (3) model parameterization; (4) model testing, insights, and predictions available through graph analyses; and (5) potential implications for conservation biology and related applications. In general, and for a variety of ecological systems, we find the graph model a remarkably robust framework for applications concerned with habitat connectivity. We close with suggestions for further work on the parameterization and validation of graph models, and point to some promising analytic insights.
引用
收藏
页码:260 / 273
页数:14
相关论文
共 91 条
[1]   Error and attack tolerance of complex networks [J].
Albert, R ;
Jeong, H ;
Barabási, AL .
NATURE, 2000, 406 (6794) :378-382
[2]  
[Anonymous], 1999, Small Worlds
[3]  
[Anonymous], 1997, Conservation Ecology, DOI DOI 10.5751/ES-00015-010104
[4]   Genetic population differentiation and connectivity among fragmented Moor frog (Rana arvalis) populations in The Netherlands [J].
Arens, Paul ;
van der Sluis, Theo ;
van't Westende, Wendy P. C. ;
Vosman, Ben ;
Vos, Claire C. ;
Smulders, Marinus J. M. .
LANDSCAPE ECOLOGY, 2007, 22 (10) :1489-1500
[5]   Scale-free networks [J].
Barabási, AL ;
Bonabeau, E .
SCIENTIFIC AMERICAN, 2003, 288 (05) :60-69
[6]   Forks in the road: Choices in procedures for designing wildland linkages [J].
Beier, Paul ;
Majka, Daniel R. ;
Spencer, Wayne D. .
CONSERVATION BIOLOGY, 2008, 22 (04) :836-851
[7]   Measuring landscape connectivity:: The challenge of behavioral landscape ecology [J].
Bélisle, M .
ECOLOGY, 2005, 86 (08) :1988-1995
[8]  
BEST B, 2008, CONNMOD CONNECTIVITY
[9]   A network approach for analyzing spatially structured populations in fragmented landscape [J].
Bodin, Orjan ;
Norberg, Jon .
LANDSCAPE ECOLOGY, 2007, 22 (01) :31-44
[10]   Identifying sets of key players in a social network [J].
Borgatti S.P. .
Computational & Mathematical Organization Theory, 2006, 12 (1) :21-34