Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Exchangeable Markov survival processes and weak continuity of predictive distributions.

ABSTRACT: We study exchangeable, Markov survival processes - stochastic processes giving rise to infinitely exchangeable non-negative sequences (T 1, T 2, …). We show how these are determined by their characteristic index {?n}n=1? . We identify the harmonic process as the family of exchangeable, Markov survival processes that compose the natural set of statistical models for time-to-event data. In particular, this two-dimensional family comprises the set of exchangeable, Markov survival processes with weakly continuous predictive distributions. The harmonic process is easy to generate sequentially, and a simple expression exists for both the joint probability distribution and multivariate survivor function. We show a close connection with the Kaplan-Meier estimator of the survival distribution. Embedded within the process is an infinitely exchangeable ordered partition. Aspects of the process, such as the distribution of the number of blocks, are investigated.

SUBMITTER: Dempsey W

PROVIDER: S-EPMC6290900 | biostudies-literature | 2017

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Exchangeable Markov survival processes and weak continuity of predictive distributions.

Dempsey Walter W McCullagh Peter P

Electronic journal of statistics 20171228 2

We study exchangeable, Markov survival processes - stochastic processes giving rise to infinitely exchangeable non-negative sequences (T 1, T 2, …). We show how these are determined by their characteristic index { ζ n } n = 1 ∞ . We identify the harmonic process as the family of exchangeable, Markov survival processes that compose the natural set of statistical models for time-to-event data. In particular, this two-dimensional family comprises the set of exc ...[more]

PMID: 30555616

Similar Datasets

Hierarchical network models for exchangeable structured interaction processes.

Project description:Network data often arises via a series of structured interactions among a population of constituent elements. E-mail exchanges, for example, have a single sender followed by potentially multiple receivers. Scientific articles, on the other hand, may have multiple subject areas and multiple authors. We introduce a statistical model, termed the Pitman-Yor hierarchical vertex components model (PY-HVCM), that is well suited for structured interaction data. The proposed PY-HVCM effectively models complex relational data by partial pooling of local information via a latent, shared population-level distribution. The PY-HCVM is a canonical example of hierarchical vertex components models - a subfamily of models for exchangeable structured interaction-labeled networks, i.e., networks invariant to interaction relabeling. Theoretical analysis and supporting simulations provide clear model interpretation, and establish global sparsity and power law degree distribution. A computationally tractable Gibbs sampling algorithm is derived for inferring sparsity and power law properties of complex networks. We demonstrate the model on both the Enron e-mail dataset and an ArXiv dataset, showing goodness of fit of the model via posterior predictive validation.

| S-EPMC10005504 | biostudies-literature

The entropy rate of Linear Additive Markov Processes.

Project description:This work derives a theoretical value for the entropy of a Linear Additive Markov Process (LAMP), an expressive but simple model able to generate sequences with a given autocorrelation structure. Our research establishes that the theoretical entropy rate of a LAMP model is equivalent to the theoretical entropy rate of the underlying first-order Markov Chain. The LAMP model captures complex relationships and long-range dependencies in data with similar expressibility to a higher-order Markov process. While a higher-order Markov process has a polynomial parameter space, a LAMP model is characterised only by a probability distribution and the transition matrix of an underlying first-order Markov Chain. This surprising result can be explained by the information balance between the additional structure imposed by the next state distribution of the LAMP model, and the additional randomness of each new transition. Understanding the entropy of the LAMP model provides a tool to model complex dependencies in data while retaining useful theoretical results. To emphasise the practical applications, we use the LAMP model to estimate the entropy rate of the LastFM, BrightKite, Wikispeedia and Reuters-21578 datasets. We compare estimates calculated using frequency probability estimates, a first-order Markov model and the LAMP model, also considering two approaches to ensure the transition matrix is irreducible. In most cases the LAMP entropy rates are lower than those of the alternatives, suggesting that LAMP model is better at accommodating structural dependencies in the processes, achieving a more accurate estimate of the true entropy.

| S-EPMC10997120 | biostudies-literature

Effects of Weak Electrolytes on Electric Double Layer Ion Distributions.

Project description:Many common experimental systems have electric double layers containing weak electrolytes, including systems with buffers. The pH at the boundary of the diffuse layer is an important parameter for determining the physicochemical state of the system, including surface charge density. We show that the Boltzmann equilibrium relation can be used as an exact solution for weak electrolyte electric double layers. Using these results, we provide a closed-form relation for the maximum pH change in a buffered electric double layer, in terms of the boundary potential. Importantly, our results suggest that equilibrium electric double layer concepts developed for strong electrolytes can be expanded to include weak electrolytes.

| S-EPMC7780853 | biostudies-literature

Hierarchical Markov State Model Building to Describe Molecular Processes.

Project description:Markov state models can describe ensembles of pathways via kinetic networks but are difficult to create when large free-energy barriers limit unbiased sampling. Chain-of-states simulations allow sampling over large free-energy barriers but are often constructed using a single pathway that is unlikely to thermodynamically average over orthogonal degrees of freedom in complex systems. Here, we combine the advantages of these two approaches in the form of a Markov state model of Markov state models, which we call a Hierarchical Markov state model. In this approach, independent Markov models are constructed in regions of configuration space that are locally well sampled but are separated by large free-energy barriers from other regions. A string method is used to construct an ensemble of pathways connecting the states of these different local Markov models, and the rate through each pathway is then estimated. These rates are then combined with the rate information from the local Markov models in a master equation to predict global rates, fluxes, and populations. By applying this hierarchical approach to tractable systems, a toy potential and dipeptides, we demonstrate that it is more accurate than the conventional single-pathway description. The advantages of this approach are that it (i) is more realistic than the conventional chain-of-states approach, as an ensemble of pathways rather than a single pathway is used to describe processes in high-dimensional systems, and (ii) it resolves the issue of poor sampling in Markov State model building when large free-energy barriers are present. The divide-and-conquer strategy inherent to this approach should make this procedure straightforward to apply to more complex systems.

| S-EPMC7322723 | biostudies-literature

Jump-Chain Simulation of Markov Substitution Processes Over Phylogenies.

Project description:We draw attention to an under-appreciated simulation method for generating artificial data in a phylogenetic context. The approach, which we refer to as jump-chain simulation, can invoke rich models of molecular evolution having intractable likelihood functions. As an example, we simulate data under a context-dependent model allowing for CpG hypermutability and show how such a feature can mislead common codon models used for detecting positive selection. We discuss more generally how this method can serve to elucidate the ways by which currently used models for inference are susceptible to violations of their underlying assumptions. Finally, we show how the method could serve as an inference engine in the Approximate Bayesian Computation framework.

| S-EPMC9233627 | biostudies-literature

Nonparametric tests for transition probabilities in nonhomogeneous Markov processes.

Project description:This paper proposes nonparametric two-sample tests for the direct comparison of the probabilities of a particular transition between states of a continuous time non-homogeneous Markov process with a finite state space. The proposed tests are a linear nonparametric test, an L 2-norm-based test and a Kolmogorov-Smirnov-type test. Significance level assessment is based on rigorous procedures, which are justified through the use of modern empirical process theory. Moreover, the L 2-norm and the Kolmogorov-Smirnov-type tests are shown to be consistent for every fixed alternative hypothesis. The proposed tests are also extended to more complex situations such as cases with incompletely observed absorbing states and non-Markov processes. Simulation studies show that the test statistics perform well even with small sample sizes. Finally, the proposed tests are applied to data on the treatment of early breast cancer from the European Organization for Research and Treatment of Cancer (EORTC) trial 10854, under an illness-death model.

| S-EPMC7173284 | biostudies-literature

BATCH POLICY LEARNING IN AVERAGE REWARD MARKOV DECISION PROCESSES.

Project description:We consider the batch (off-line) policy learning problem in the infinite horizon Markov Decision Process. Motivated by mobile health applications, we focus on learning a policy that maximizes the long-term average reward. We propose a doubly robust estimator for the average reward and show that it achieves semiparametric efficiency. Further we develop an optimization algorithm to compute the optimal policy in a parameterized stochastic policy class. The performance of the estimated policy is measured by the difference between the optimal average reward in the policy class and the average reward of the estimated policy and we establish a finite-sample regret guarantee. The performance of the method is illustrated by simulation studies and an analysis of a mobile health study promoting physical activity.

| S-EPMC10072865 | biostudies-literature

NONPARAMETRIC INFERENCE FOR MARKOV PROCESSES WITH MISSING ABSORBING STATE.

Project description:This paper deals with the issue of nonparametric estimation of the transition probability matrix of a non-homogeneous Markov process with finite state space and partially observed absorbing state. We impose a missing at random assumption and propose a computationally efficient nonparametric maximum pseudolikelihood estimator (NPMPLE). The estimator depends on a parametric model that is used to estimate the probability of each absorbing state for the missing observations based, potentially, on auxiliary data. For the latter model we propose a formal goodness-of-fit test based on a residual process. Using modern empirical process theory we show that the estimator is uniformly consistent and converges weakly to a tight mean-zero Gaussian random field. We also provide methodology for simultaneous confidence band construction. Simulation studies show that the NPMPLE works well with small sample sizes and that it is robust against some degree of misspecification of the parametric model for the missing absorbing states. The method is illustrated using HIV data from sub-Saharan Africa to estimate the transition probabilities of death and disengagement from HIV care.

| S-EPMC6740325 | biostudies-literature

Characterization of Weak Protein Domain Structure by Spin-Label Distance Distributions.

Project description:Function of intrinsically disordered proteins may depend on deviation of their conformational ensemble from that of a random coil. Such deviation may be hard to characterize and quantify, if it is weak. We explored the potential of distance distributions between spin labels, as they can be measured by electron paramagnetic resonance techniques, for aiding such characterization. On the example of the intrinsically disordered N-terminal domain 1-267 of fused in sarcoma (FUS) we examined what such distance distributions can and cannot reveal on the random-coil reference state. On the example of the glycine-rich domain 188-320 of heterogeneous nuclear ribonucleoprotein A1 (hnRNP A1) we studied whether deviation from a random-coil ensemble can be robustly detected with 19 distance distribution restraints. We discuss limitations imposed by ill-posedness of the conversion of primary data to distance distributions and propose overlap of distance distributions as a fit criterion that can tackle this problem. For testing consistency and size sufficiency of the restraint set, we propose jack-knife resampling. At current desktop computers, our approach is expected to be viable for domains up to 150 residues and for between 10 and 50 distance distribution restraints.

| S-EPMC8072059 | biostudies-literature

Multi-Objective Markov Decision Processes for Data-Driven Decision Support.

Project description:We present new methodology based on Multi-Objective Markov Decision Processes for developing sequential decision support systems from data. Our approach uses sequential decision-making data to provide support that is useful to many different decision-makers, each with different, potentially time-varying preference. To accomplish this, we develop an extension of fitted-Q iteration for multiple objectives that computes policies for all scalarization functions, i.e. preference functions, simultaneously from continuous-state, finite-horizon data. We identify and address several conceptual and computational challenges along the way, and we introduce a new solution concept that is appropriate when different actions have similar expected outcomes. Finally, we demonstrate an application of our method using data from the Clinical Antipsychotic Trials of Intervention Effectiveness and show that our approach offers decision-makers increased choice by a larger class of optimal policies.

| S-EPMC5179144 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data