Navigation between initial and desired community states using shortcuts

Author:

Blonder Benjamin W.1ORCID,Lim Michael H.2,Sunberg Zachary3,Tomlin Claire2

Affiliation:

1. Department of Environmental Science, Policy, and Management University of California Berkeley Berkeley California USA

2. Department of Electrical Engineering and Computer Science University of California Berkeley Berkeley California USA

3. Aerospace Engineering Sciences Department University of Colorado Boulder Boulder Colorado USA

Abstract

AbstractEcological management problems often involve navigating from an initial to a desired community state. We ask whether navigation without brute‐force additions and deletions of species is possible via: adding/deleting a small number of individuals of a species, changing the environment, and waiting. Navigation can yield direct paths (single sequence of actions) or shortcut paths (multiple sequences of actions with lower cost than a direct path). We ask (1) when is non‐brute‐force navigation possible?; (2) do shortcuts exist and what are their properties?; and (3) what heuristics predict shortcut existence? Using a state diagram framework applied to several empirical datasets, we show that (1) non‐brute‐force navigation is only possible between some state pairs, (2) shortcuts exist between many state pairs; and (3) changes in abundance and richness are the strongest predictors of shortcut existence, independent of dataset and algorithm choices. State diagrams thus unveil hidden strategies for manipulating species coexistence and efficiently navigating between states.

Funder

Defense Advanced Research Projects Agency

National Science Foundation of Sri Lanka

Semiconductor Research Corporation

Publisher

Wiley

Subject

Ecology, Evolution, Behavior and Systematics

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3