TY - Journal Article
T1 - SPACETIME DISCOUNTED VALUE OF NETWORK CONNECTIVITY
JF - Advances in complex systems
VL - 21
IS - 8
SP - 1850018
EP - 1850051
A1 - DRAGICEVIC, ARNAUD Z
CY - SINGAPORE
PB - World Scientific Publishing Company
PY - 2018
UR - https://bonnus.ulb.uni-bonn.de/SummonRecord/FETCH-LOGICAL-c3972-13bcdf5b18955009ca7c8971c6021893a93d4899b3d37d058bba3409a96cd9480
N2 - In order to unveil the value of network connectivity, discounted both in space and time, we formalize the construction of networks as an optimal control dynamic graph-theoretic problem. The network is based on a set of leaders and followers linked through edges. The node dynamics, built upon the consensus protocol, form a time evolutive Mahalanobis distance weighted by the opportunity costs. The results show that the network equilibrium depends on the influence of leader nodes, while the network connectivity depends on the cohesiveness among followers. Through numerical simulations, we find that — past a threshold level of opportunity costs — the values of shadow prices become stationary. Likewise, the model outputs show that, at a fixed level of foregone gains, agents value the safeguard of connections less in time than in space.
KW - Computer simulation
KW - Environmental Sciences
KW - Graph theory
KW - Mathematical models
KW - Mathematics
KW - Mathematics, Interdisciplinary Applications
KW - Multidisciplinary Sciences
KW - Opportunity costs
KW - Optimal control
KW - Physical Sciences
KW - Science & Technology
KW - Science & Technology - Other Topics
KW - Shadow prices
KW - spacetime discounting
KW - Bioeconomics
KW - optimal control
KW - connectivity value
KW - graph theory
KW - ROBUSTNESS
KW - DESIGN
KW - STABILITY
KW - CONSERVATION
KW - OPPORTUNITY COST
KW - SYSTEMS
KW - ECONOMICS
KW - CORRIDORS
KW - SPACETIME DISCOUNTING
KW - CONNECTIVITY VALUE
KW - OPTIMAL CONTROL
KW - GRAPH THEORY
ER -