Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Sequence Networks of Rotating Machines01:24

Sequence Networks of Rotating Machines

379
A Y-connected synchronous generator, grounded through a neutral impedance, is designed to produce balanced internal phase voltages with only positive-sequence components. The generator's sequence networks include a source voltage that is exclusively in the positive-sequence network. The sequence components of line-to-ground voltages at the generator terminals illustrate this configuration.
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...
379
Block Diagram Reduction01:22

Block Diagram Reduction

395
The process of deriving the transfer function of a control system often involves reducing its block diagram to a single block. This simplification can be achieved through a series of strategic operations, including relocating branch points and comparators. These operations preserve the overall function of the system while allowing for easier manipulation and combination of blocks.
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
395
Transformations of Functions III01:20

Transformations of Functions III

56
Transformations modify the graphical representation of a function without changing its fundamental form. One common transformation is reflection, which flips the graph across a designated axis. When the vertical coordinates of all points are multiplied by the negative one, the entire graph is mirrored over the horizontal axis. This transformation reverses the vertical orientation of peaks and troughs, akin to signal inversion in electrical systems, where a waveform is flipped, but the timing of...
56
Vector Algebra: Graphical Method01:10

Vector Algebra: Graphical Method

16.2K
Vectors can be multiplied by scalars, added to other vectors, or subtracted from other vectors. The vector sum of two (or more) vectors is called the resultant vector or, for short, the resultant.
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
16.2K
Graphical Representation of Inequalities01:28

Graphical Representation of Inequalities

64
The graph of the equation where y equals x squared forms a curve known as a parabola. This curve acts as a boundary in the coordinate plane, dividing it into distinct regions based on the relative position of points.When the equality sign in the equation is replaced with an inequality—such as greater than, less than, greater than or equal to, or less than or equal to—the graphical representation changes from a single curve into a broader shaded area that signifies the set of all...
64
Graphs of Equations in Two Variables01:30

Graphs of Equations in Two Variables

78
An equation with two variables, typically written in the form y = f(x) or Ax + By = C, describes a relationship between quantities represented by x and y. Each solution to such an equation is an ordered pair (x, y) that satisfies the equation when substituted. These pairs can be represented graphically to understand the variables' relationship visually.A common technique for constructing the graph of a two-variable equation is to create a value table. Begin by choosing several values for the...
78

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Nearly reducible finite Markov chains: Theory and algorithms.

The Journal of chemical physics·2021
Same author

Rare events and first passage time statistics from the energy landscape.

The Journal of chemical physics·2020
Same author

Fragility and correlated dynamics in supercooled liquids.

The Journal of chemical physics·2020
Same author

Improving double-ended transition state searches for soft-matter systems.

The Journal of chemical physics·2020
Same author

A well-behaved theoretical framework for ReaxFF reactive force fields.

The Journal of chemical physics·2020
Same author

Efficient and exact sampling of transition path ensembles on Markovian networks.

The Journal of chemical physics·2020
Same journal

Anharmonic phonons via quantum thermal bath simulations.

The Journal of chemical physics·2026
Same journal

Quantum simulation of alignment dependent differential cross sections in co-propagating molecular beams at cold collision energies.

The Journal of chemical physics·2026
Same journal

Non-additive ion effects on the coil-globule equilibrium of a generic polymer in aqueous salt solutions.

The Journal of chemical physics·2026
Same journal

Insights into the unexpected small reduction of the temperature of maximum density of water by lithium chloride addition.

The Journal of chemical physics·2026
Same journal

Optical frequency comb double-resonance spectroscopy of the 9030-9175 cm-1 states of ethylene.

The Journal of chemical physics·2026
Same journal

Time reversal breaking of colloidal particles in cells.

The Journal of chemical physics·2026
See all related articles

Related Experiment Video

Updated: Nov 23, 2025

Author Spotlight: An Optimized Automated Method for Investigating Retinoic Acid Receptors in Neuronal Mitochondria
08:33

Author Spotlight: An Optimized Automated Method for Investigating Retinoic Acid Receptors in Neuronal Mitochondria

Published on: July 28, 2023

813

Optimal dimensionality reduction of Markov chains using graph transformation.

Deepti Kannan1, Daniel J Sharpe1, Thomas D Swinburne2

  • 1Department of Chemistry, University of Cambridge, Lensfield Road, Cambridge CB2 1EW, United Kingdom.

The Journal of Chemical Physics
|December 31, 2020
PubMed
Summary
This summary is machine-generated.

Graph transformation enhances Markov chain analysis by generalizing to discrete-time models and enabling stable dimensionality reduction. This method improves the computation of key dynamics, especially for systems with rare events.

More Related Videos

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
12:27

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Published on: February 15, 2017

7.2K
Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues
07:08

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues

Published on: July 14, 2015

7.5K

Related Experiment Videos

Last Updated: Nov 23, 2025

Author Spotlight: An Optimized Automated Method for Investigating Retinoic Acid Receptors in Neuronal Mitochondria
08:33

Author Spotlight: An Optimized Automated Method for Investigating Retinoic Acid Receptors in Neuronal Mitochondria

Published on: July 28, 2023

813
Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
12:27

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Published on: February 15, 2017

7.2K
Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues
07:08

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues

Published on: July 14, 2015

7.5K

Area of Science:

  • Computational Chemistry
  • Statistical Mechanics
  • Complex Systems Modeling

Background:

  • Markov chains model complex system dynamics but suffer from ill-conditioned transition matrices with timescale separation.
  • Continuous-time Markov chains (CTMCs) use mean first passage times (MFPTs) as dynamical observables.
  • Discrete-time Markov chains (DTMCs) are often estimated from simulation data, e.g., in Markov state models.

Purpose of the Study:

  • Generalize graph transformation (GT) for numerically stable computation in discrete-time Markov chains (DTMCs).
  • Develop and analyze dimensionality reduction methods for both CTMCs and DTMCs.
  • Propose a novel, numerically stable approach for optimal Markovian coarse-graining, particularly for systems with rare event dynamics.

Main Methods:

  • Generalized the graph transformation (GT) algorithm to discrete-time Markov chains (DTMCs).
  • Performed detailed numerical analysis of existing dimensionality reduction methods for CTMCs.
  • Proposed an alternative GT-based approach to compute intermicrostate MFPTs and derived weighted intermacrostate MFPTs, including an approximation for the strongly metastable limit.

Main Results:

  • Demonstrated that existing linear algebra-based dimensionality reduction methods encounter numerical issues due to metastability.
  • The proposed GT-based method offers superior numerical stability for computing the optimal reduced Markov chain.
  • The inversion of the weighted-MFPT matrix, derived from GT, is better conditioned than in alternative schemes.

Conclusions:

  • The generalized GT algorithm provides a numerically stable method for analyzing DTMCs and their dimensionality reduction.
  • The GT approach enables optimal Markovian coarse-graining, overcoming limitations of existing methods for systems with rare event dynamics.
  • This work facilitates more accurate model interpretation and computation for complex systems exhibiting timescale separation.