Evidence map›Paper›PMID 34650314›Full record

ArticleSIAM review. Society for Industrial and Applied Mathematics2018

Trajectory stratification of stochastic dynamics.

Aaron R Dinner, Jonathan C Mattingly, Jeremy O B Tempkin, Brian Van Koten, Jonathan Weare

Abstract read
In one paragraph

Article in SIAM review. Society for Industrial and Applied Mathematics, 2018. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 10 papers.

0numbers the graph read from it
0cells of the map it votes in
10citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

10 citing papers in PubMed.

  1. BAD-NEUS: Rapidly converging trajectory stratification.The Journal of chemical physics · 2024
    Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. OPTIMIZING WEIGHTED ENSEMBLE SAMPLING OF STEADY STATES.Multiscale modeling & simulation : a SIAM interdisciplinary journal · 2020
    Article
  9. Article
  10. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Aaron R DinnerJames Franck Institute, The University of Chicago, Chicago, Illinois 60637, USA.
Jonathan C MattinglyDepartments of Mathematics and Statistical Science, Duke University, Durham, North Carolina 27708, USA.
Jeremy O B TempkinJames Franck Institute, The University of Chicago, Chicago, Illinois 60637, USA.
Brian Van KotenDepartment of Statistics, The University of Chicago, Chicago, Illinois 60637, USA.
Jonathan WeareJames Franck Institute, The University of Chicago, Chicago, Illinois 60637, USA.

Funding

Robust rare event simulation for protein folding and disease-related aggregationR01GM109455 · NIGMS · UNIVERSITY OF CHICAGO · PI DINNER, AARON · 2013 to 2017
$1.7M
NIGMS NIH HHS R01 GM109455
6 · The paper itself

Abstract

We present a general mathematical framework for trajectory stratification for simulating rare events. Trajectory stratification involves decomposing trajectories of the underlying process into fragments limited to restricted regions of state space (strata), computing averages over the distributions of the trajectory fragments within the strata with minimal communication between them, and combining those averages with appropriate weights to yield averages with respect to the original underlying process. Our framework reveals the full generality and flexibility of trajectory stratification, and it illuminates a common mathematical structure shared by existing algorithms for sampling rare events. We demonstrate the power of the framework by defining strata in terms of both points in time and path-dependent variables for efficiently estimating averages that were not previously tractable.

Identifiers

PMID34650314
PMCPMC8514164

What OpenQuestion holds

Textmetadata
LicenceTDM
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.