Time-continuous and time-discrete SIR models revisited: theory and applications
Ontology highlight
ABSTRACT:
SUBMITTER: Wacker B
PROVIDER: S-EPMC7538854 | biostudies-literature | 2020 Jan
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:Assessing the patterns of wildlife attendance to specific areas is relevant across many fundamental and applied ecological studies, particularly when animals are at risk of being exposed to stressors within or outside the boundaries of those areas. Marine mammals are increasingly being exposed to human activities that may cause behavioral and physiological changes, including military exercises using active sonars. Assessment of the population-level consequences of anthropogenic disturbance requires robust and efficient tools to quantify the levels of aggregate exposure for individuals in a population over biologically relevant time frames. We propose a discrete-space, continuous-time approach to estimate individual transition rates across the boundaries of an area of interest, informed by telemetry data collected with uncertainty. The approach allows inferring the effect of stressors on transition rates, the progressive return to baseline movement patterns, and any difference among individuals. We apply the modeling framework to telemetry data from Blainville's beaked whale (Mesoplodon densirostris) tagged in the Bahamas at the Atlantic Undersea Test and Evaluation Center (AUTEC), an area used by the U.S. Navy for fleet readiness training. We show that transition rates changed as a result of exposure to sonar exercises in the area, reflecting an avoidance response. Our approach supports the assessment of the aggregate exposure of individuals to sonar and the resulting population-level consequences. The approach has potential applications across many applied and fundamental problems where telemetry data are used to characterize animal occurrence within specific areas.
| S-EPMC9786920 | biostudies-literature
Project description:A time-tree is a rooted phylogenetic tree such that all internal nodes are equipped with absolute divergence dates and all leaf nodes are equipped with sampling dates. Such time-trees have become a central object of study in phylogenetics but little is known about the parameter space of such objects. Here we introduce and study a hierarchy of discrete approximations of the space of time-trees from the graph-theoretic and algorithmic point of view. One of the basic and widely used phylogenetic graphs, the [Formula: see text] graph, is the roughest approximation and bottom level of our hierarchy. More refined approximations discretize the relative timing of evolutionary divergence and sampling dates. We study basic graph-theoretic questions for these graphs, including the size of neighborhoods, diameter upper and lower bounds, and the problem of finding shortest paths. We settle many of these questions by extending the concept of graph grammars introduced by Sleator, Tarjan, and Thurston to our graphs. Although time values greatly increase the number of possible trees, we show that 1-neighborhood sizes remain linear, allowing for efficient local exploration and construction of these graphs. We also obtain upper bounds on the r-neighborhood sizes of these graphs, including a smaller bound than was previously known for [Formula: see text]. Our results open up a number of possible directions for theoretical investigation of graph-theoretic and algorithmic properties of the time-tree graphs. We discuss the directions that are most valuable for phylogenetic applications and give a list of prominent open problems for those applications. In particular, we conjecture that the split theorem applies to shortest paths in time-tree graphs, a property not shared in the general [Formula: see text] case.
| S-EPMC5829145 | biostudies-other
Project description:There are several applications in computational biophysics that require the optimization of discrete interacting states, for example, amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of "maximum flow-minimum cut" graph analysis. The interaction energy graph, a graph in which vertices (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered.
| S-EPMC5001885 | biostudies-literature
Project description:Health and development indicators (HDIs) such as vaccination coverage are regularly measured in many low- and middle-income countries using household surveys, often due to the unreliability or incompleteness of routine data collection systems. Recently, the development of model-based approaches for producing subnational estimates of HDIs using survey data, particularly cluster-level data, has been an active area of research. This is mostly driven by the increasing demand for estimates at certain administrative levels, for example, districts, at which many development goals are set and evaluated. In this study, we explore spatial modeling approaches for producing district-level estimates of vaccination coverage. Specifically, we compare discrete spatial smoothing models which directly model district-level data with continuous Gaussian process (GP) models that utilize geolocated cluster-level data. We adopt a fully Bayesian framework, implemented using the INLA and SPDE approaches. We compare the predictive performance of the models by analyzing vaccination coverage using data from two Demographic and Health Surveys (DHS), namely the 2014 Kenya DHS and the 2015-16 Malawi DHS. We find that the continuous GP models performed well, offering a credible alternative to traditional discrete spatial smoothing models. Our analysis also revealed that accounting for between-cluster variation in the continuous GP models did not have any real effect on the district-level estimates. Our results provide guidance to practitioners on the reliability of these model-based approaches for producing estimates of vaccination coverage and other HDIs.
| S-EPMC8638675 | biostudies-literature
Project description:We consider the analysis of longitudinal data of multiple types of events where some of the events are observed on a coarser level (e.g. grouped) at some time points during the follow-up, for example, when certain events, such as disease progression, are only observable during parts of follow-up for some subjects, causing gaps in the data, or when the time of death is observed but the cause of death is unknown. In this case, there is missing data in key characteristics of the event history such as onset, time in state, and number of events. We derive the likelihood function, score and observed information under independent and non-informative coarsening, and conduct a simulation study where we compare bias, empirical standard errors, and confidence interval coverage of estimators based on direct maximum likelihood, Monte Carlo Expectation Maximisation, ignoring the coarsening thus acting as if no event occurred, and artificial right censoring at the first time of coarsening. Longitudinal data on drug prescriptions and survival in men receiving palliative treatment for prostate cancer is used to estimate the parameters of one of the data-generating models. We demonstrate that the performance depends on several factors, including sample size and type of coarsening.
| S-EPMC10119900 | biostudies-literature
Project description:We present a short review of discrete-time quantum walks (DTQW) as a potentially useful and rich formalism to model human decision-making. We present a pedagogical introduction of the underlying formalism and main structural properties. We suggest that DTQW are particularly suitable for combining the two strands of literature on evidence accumulator models and on the quantum formalism of cognition. Due to the additional spin degree of freedom, models based on DTQW allow for a natural modeling of model choice and confidence rating in separate bases. Levels of introspection and self-assessment during choice deliberations can be modeled by the introduction of a probability for measurement of either position and/or spin of the DTQW, where each measurement act leads to a partial decoherence (corresponding to a step towards rationalization) of the deliberation process. We show how quantum walks predict observed probabilistic misperception like S-shaped subjective probability and conjunction fallacy. Our framework emphasizes the close relationship between response times and type of preferences and of responses. In particular, decision theories based on DTQW do not need to invoke two systems ("fast" and "slow") as in dual process theories. Within our DTQW framework, the two fast and slow systems are replaced by a single system, but with two types of self-assessment or introspection. The "thinking fast" regime is obtained with no or little self-assessment, while the "thinking slow" regime corresponds to a strong rate of self-assessment. We predict a trade-off between speed and accuracy, as empirically reported.
| S-EPMC9426940 | biostudies-literature
Project description:When simulating molecular systems using deterministic equations of motion (e.g., Newtonian dynamics), such equations are generally numerically integrated according to a well-developed set of algorithms that share commonly agreed-upon desirable properties. However, for stochastic equations of motion (e.g., Langevin dynamics), there is still broad disagreement over which integration algorithms are most appropriate. While multiple desiderata have been proposed throughout the literature, consensus on which criteria are important is absent, and no published integration scheme satisfies all desiderata simultaneously. Additional nontrivial complications stem from simulating systems driven out of equilibrium using existing stochastic integration schemes in conjunction with recently developed nonequilibrium fluctuation theorems. Here, we examine a family of discrete time integration schemes for Langevin dynamics, assessing how each member satisfies a variety of desiderata that have been enumerated in prior efforts to construct suitable Langevin integrators. We show that the incorporation of a novel time step rescaling in the deterministic updates of position and velocity can correct a number of dynamical defects in these integrators. Finally, we identify a particular splitting (related to the velocity Verlet discretization) that has essentially universally appropriate properties for the simulation of Langevin dynamics for molecular systems in equilibrium, nonequilibrium, and path sampling contexts.
| S-EPMC4065221 | biostudies-literature
Project description:For the modeling of categorical time series, both nominal or ordinal time series, an extension of the basic discrete autoregressive moving-average (ARMA) models is proposed. It uses an observation-driven regime-switching mechanism, leading to the family of RS-DARMA models. After having discussed the stochastic properties of RS-DARMA models in general, we focus on the particular case of the first-order RS-DAR model. This RS-DAR ( 1 ) model constitutes a parsimoniously parameterized type of Markov chain, which has an easy-to-interpret data-generating mechanism and may also handle negative forms of serial dependence. Approaches for model fitting are elaborated on, and they are illustrated by two real-data examples: the modeling of a nominal sequence from biology, and of an ordinal time series regarding cloudiness. For future research, one might use the RS-DAR ( 1 ) model for constructing parsimonious advanced models, and one might adapt techniques for smoother regime transitions.
| S-EPMC7516940 | biostudies-literature
Project description:BackgroundPrediction models for time-to-event outcomes are commonly used in biomedical research to obtain subject-specific probabilities that aid in making important clinical care decisions. There are several regression and machine learning methods for building these models that have been designed or modified to account for the censoring that occurs in time-to-event data. Discrete-time survival models, which have often been overlooked in the literature, provide an alternative approach for predictive modeling in the presence of censoring with limited loss in predictive accuracy. These models can take advantage of the range of nonparametric machine learning classification algorithms and their available software to predict survival outcomes.MethodsDiscrete-time survival models are applied to a person-period data set to predict the hazard of experiencing the failure event in pre-specified time intervals. This framework allows for any binary classification method to be applied to predict these conditional survival probabilities. Using time-dependent performance metrics that account for censoring, we compare the predictions from parametric and machine learning classification approaches applied within the discrete time-to-event framework to those from continuous-time survival prediction models. We outline the process for training and validating discrete-time prediction models, and demonstrate its application using the open-source R statistical programming environment.ResultsUsing publicly available data sets, we show that some discrete-time prediction models achieve better prediction performance than the continuous-time Cox proportional hazards model. Random survival forests, a machine learning algorithm adapted to survival data, also had improved performance compared to the Cox model, but was sometimes outperformed by the discrete-time approaches. In comparing the binary classification methods in the discrete time-to-event framework, the relative performance of the different methods varied depending on the data set.ConclusionsWe present a guide for developing survival prediction models using discrete-time methods and assessing their predictive performance with the aim of encouraging their use in medical research settings. These methods can be applied to data sets that have continuous time-to-event outcomes and multiple clinical predictors. They can also be extended to accommodate new binary classification algorithms as they become available. We provide R code for fitting discrete-time survival prediction models in a github repository.
| S-EPMC9316420 | biostudies-literature
Project description:Copula is an important tool for modeling neural dependence. Recent work on copula has been expanded to jointly model mixed time series in neuroscience ("Hu et al., 2016, Joint Analysis of Spikes and Local Field Potentials using Copula" [1]). Here we present further data for joint analysis of spike and local field potential (LFP) with copula modeling. In particular, the details of different model orders and the influence of possible spike contamination in LFP data from the same and different electrode recordings are presented. To further facilitate the use of our copula model for the analysis of mixed data, we provide the Matlab codes, together with example data.
| S-EPMC4845150 | biostudies-literature