首页 | 本学科首页   官方微博 | 高级检索  
   检索      


Navigation between initial and desired community states using shortcuts
Authors:Benjamin W Blonder  Michael H Lim  Zachary Sunberg  Claire Tomlin
Institution: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:Ecological 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.
Keywords:coexistence  community assembly  community dynamics  optimal control  state transition
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号