arXiv subjects

David L. Alderson

Publications and source records attributed to David L. Alderson.

7 recordsLinked to original sources

arXiv2024

Forecasting and decisions in the birth-death-suppression Markov model for wildfires

As changing climates transform the landscape of wildfire management and suppression, agencies are faced with difficult resource allocation decisions. We analyze trade-offs in temporal resource allocation using a simple but robust Markov model of a wildfire under suppression: the birth-death-suppression process. Though the model is not spatial, its stochastic nature and rich temporal structure make it broadly applicable in describing the dynamic evolution of a fire including ignition, the effect of adverse conditions, and the effect of external suppression. With strong analytical and numerical control of the probabilities of outcomes, we construct classes of processes which analogize common wildfire suppression scenarios and determine aspects of optimal suppression allocations. We model problems which include resource management in changing conditions, the effect of resource mobilization delay, and allocation under uncertainty about future events. Our results are consistent with modern resource management and suppression practices in wildland fire.

physics.soc-ph↗

arXiv2023

Birth-death-suppression Markov process and wildfires

Birth and death Markov processes can model stochastic physical systems from percolation to disease spread and, in particular, wildfires. We introduce and analyze a birth-death-suppression Markov process as a model of controlled culling of an abstract, dynamic population. Using analytic techniques, we characterize the probabilities and timescales of outcomes like absorption at zero (extinguishment) and the probability of the cumulative population (burned area) reaching a given size. The latter requires control over the embedded Markov chain: this discrete process is solved using the Pollazcek orthogonal polynomials, a deformation of the Gegenbauer/ultraspherical polynomials. This allows analysis of processes with bounded cumulative population, corresponding to finite burnable substrate in the wildfire interpretation, with probabilities represented as spectral integrals. This technology is developed in order to lay the foundations for a dynamic decision support framework. We devise real-time risk metrics and suggest future directions for determining optimal suppression strategies, including multi-event resource allocation problems and potential applications for reinforcement learning.

nlin.AO↗

arXiv2022

Finding shortest and nearly shortest path nodes in large substantially incomplete networks

Dynamic processes on networks, be it information transfer in the Internet, contagious spreading in a social network, or neural signaling, take place along shortest or nearly shortest paths. Unfortunately, our maps of most large networks are substantially incomplete due to either the highly dynamic nature of networks, or high cost of network measurements, or both, rendering traditional path finding methods inefficient. We find that shortest paths in large real networks, such as the network of protein-protein interactions (PPI) and the Internet at the autonomous system (AS) level, are not random but are organized according to latent-geometric rules. If nodes of these networks are mapped to points in latent hyperbolic spaces, shortest paths in them align along geodesic curves connecting endpoint nodes. We find that this alignment is sufficiently strong to allow for the identification of shortest path nodes even in the case of substantially incomplete networks. We demonstrate the utility of latent-geometric path-finding in problems of cellular pathway reconstruction and communication security.

physics.soc-ph↗

arXiv2018

Stability of a Giant Connected Component in a Complex Network

We analyze the stability of the network's giant connected component under impact of adverse events, which we model through the link percolation. Specifically, we quantify the extent to which the largest connected component of a network consists of the same nodes, regardless of the specific set of deactivated links. Our results are intuitive in the case of single-layered systems: the presence of large degree nodes in a single-layered network ensures both its robustness and stability. In contrast, we find that interdependent networks that are robust to adverse events have unstable connected components. Our results bring novel insights to the design of resilient network topologies and the reinforcement of existing networked systems.

physics.soc-ph↗

arXiv2014

Optimal vaccination in a stochastic epidemic model of two non-interacting populations

Developing robust, quantitative methods to optimize resource allocations in response to epidemics has the potential to save lives and minimize health care costs. In this paper, we develop and apply a computationally efficient algorithm that enables us to calculate the complete probability distribution for the final epidemic size in a stochastic Susceptible-Infected-Recovered (SIR) model. Based on these results, we determine the optimal allocations of a limited quantity of vaccine between two non-interacting populations. We compare the stochastic solution to results obtained for the traditional, deterministic SIR model. For intermediate quantities of vaccine, the deterministic model is a poor estimate of the optimal strategy for the more realistic, stochastic case.

q-bio.QM↗

arXiv2013

Measuring and Modeling Behavioral Decision Dynamics in Collective Evacuation

Identifying and quantifying factors influencing human decision making remains an outstanding challenge, impacting the performance and predictability of social and technological systems. In many cases, system failures are traced to human factors including congestion, overload, miscommunication, and delays. Here we report results of a behavioral network science experiment, targeting decision making in a natural disaster. In each scenario, individuals are faced with a forced "go" versus "no go" evacuation decision, based on information available on competing broadcast and peer-to-peer sources. In this controlled setting, all actions and observations are recorded prior to the decision, enabling development of a quantitative decision making model that accounts for the disaster likelihood, severity, and temporal urgency, as well as competition between networked individuals for limited emergency resources. Individual differences in behavior within this social setting are correlated with individual differences in inherent risk attitudes, as measured by standard psychological assessments. Identification of robust methods for quantifying human decisions in the face of risk has implications for policy in disasters and other threat scenarios.

physics.soc-ph↗

arXiv2012

Collective Decision Dynamics in the Presence of External Drivers

We develop a sequence of models describing information transmission and decision dynamics for a network of individual agents subject to multiple sources of influence. Our general framework is set in the context of an impending natural disaster, where individuals, represented by nodes on the network, must decide whether or not to evacuate. Sources of influence include a one-to-many externally driven global broadcast as well as pairwise interactions, across links in the network, in which agents transmit either continuous opinions or binary actions. We consider both uniform and variable threshold rules on the individual opinion as baseline models for decision-making. Our results indicate that 1) social networks lead to clustering and cohesive action among individuals, 2) binary information introduces high temporal variability and stagnation, and 3) information transmission over the network can either facilitate or hinder action adoption, depending on the influence of the global broadcast relative to the social network. Our framework highlights the essential role of local interactions between agents in predicting collective behavior of the population as a whole.

physics.soc-ph↗