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

Transformations of Functions II01:29

Transformations of Functions II

94
Transformations in mathematics alter the position or orientation of a function’s graph while preserving its fundamental shape. One important type of transformation is the horizontal shift, which involves modifying the input variable within a function’s equation. This operation affects where outputs occur along the horizontal axis but does not alter the function’s overall structure.A horizontal shift is achieved by replacing the input variable x with either x + c or x - c,...
94
Transformations of Functions III01:20

Transformations of Functions III

107
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...
107
Transformations of Functions I01:29

Transformations of Functions I

118
A function's graph can be modified by changing its position or size without altering its overall shape. These transformations allow the graph to be moved across the coordinate plane while preserving its pattern and structure. One of the most common transformations is shifting, which repositions the graph without distorting it.When the output of a function is adjusted by adding or subtracting a constant, the graph shifts vertically. A positive value moves the graph upward, while a negative value...
118
Transformation01:26

Transformation

581
Microbial communities are dynamic environments where cell lysis releases free DNA into the surroundings. Other cells can take up this extracellular DNA through a process known as transformation.When a cell incorporates this foreign DNA into its genome, resulting in genetic modification, the process is known as transformation. Cells capable of this process are termed competent. Competence can be natural, as observed in certain bacteria and archaea, or artificially induced in the...
581
Woodward–Hoffmann Selection Rules and Microscopic Reversibility01:34

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

3.7K
Electrocyclic reactions, cycloadditions, and sigmatropic rearrangements are concerted pericyclic reactions that proceed via a cyclic transition state. These reactions are stereospecific and regioselective. The stereochemistry of the products depends on the symmetry characteristics of the interacting orbitals and the reaction conditions. Accordingly, pericyclic reactions are classified as either symmetry-allowed or symmetry-forbidden. Woodward and Hoffmann presented the selection criteria for...
3.7K
Random Variables01:09

Random Variables

17.1K
A random variable is a single numerical value that indicates the outcome of a procedure. The concept of random variables is fundamental to the probability theory and was introduced by a Russian mathematician, Pafnuty Chebyshev, in the mid-nineteenth century.
Uppercase letters such as X or Y denote a random variable. Lowercase letters like x or y denote the value of a random variable. If X is a random variable, then X is written in words, and x is given as a number.
For example, let X = the...
17.1K

You might also read

Related Articles

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

Sort by
Same author

Engineering an Optogenetic pH-Modulator in Bacteria.

Advanced science (Weinheim, Baden-Wurttemberg, Germany)·2026
Same author

Day-to-day fluctuations in cognitive precision predict the domain-general intention-behavior gap.

Science advances·2026
Same author

Nicotinamide-based Sirtuin 2 inhibitors as anti-HCMV agents.

Antiviral research·2026
Same author

Contrasting Features of Papillary and Chromophobe Renal Cell Carcinoma Revealed by Whole-Genome Sequencing.

Molecular cancer research : MCR·2026
Same author

Identifying direct risk factors in UK Biobank via simultaneous Bayesian-frequentist model-averaged hypothesis testing using Doublethink.

Proceedings of the National Academy of Sciences of the United States of America·2026
Same author

Machine learning and statistical inference in microbial population genomics.

Genome biology·2025
Same journal

Neural posterior estimation on exponential random graph models: evaluating bias and implementation challenges.

Statistics and computing·2026
Same journal

Subgroup Analysis of Differential Networks with Latent Variables.

Statistics and computing·2026
Same journal

Non-negative matrix factorization algorithms generally improve topic model fits.

Statistics and computing·2026
Same journal

Approximating evidence via bounded harmonic means.

Statistics and computing·2026
Same journal

Efficient Inference in First Passage Time Models.

Statistics and computing·2026
Same journal

Optimal <i>F</i>-score Matching for Bipartite Record Linkage.

Statistics and computing·2026
See all related articles

Related Experiment Video

Updated: Dec 27, 2025

Structure-Based Simulation and Sampling of Transcription Factor Protein Movements along DNA from Atomic-Scale Stepping to Coarse-Grained Diffusion
09:17

Structure-Based Simulation and Sampling of Transcription Factor Protein Movements along DNA from Atomic-Scale Stepping to Coarse-Grained Diffusion

Published on: March 1, 2022

3.5K

Sequential Monte Carlo with transformations.

Richard G Everitt1, Richard Culliford2, Felipe Medina-Aguayo2

  • 11Department of Statistics, University of Warwick, Coventry, CV4 7AL UK.

Statistics and Computing
|March 3, 2020
PubMed
Summary
This summary is machine-generated.

This study introduces a novel sequential Monte Carlo method for Bayesian inference across different dimensional spaces. This flexible algorithm enhances Bayesian model comparison, especially when reversible jump Markov chain Monte Carlo methods show low acceptance rates.

Keywords:
Bayesian model comparisonCoalescentTrans-dimensional Monte Carlo

More Related Videos

Surrogate Model Development for Digital Experiments in Welding
09:17

Surrogate Model Development for Digital Experiments in Welding

Published on: March 28, 2025

1.7K
A Rapid Method for Modeling a Variable Cycle Engine
04:58

A Rapid Method for Modeling a Variable Cycle Engine

Published on: August 13, 2019

7.9K

Related Experiment Videos

Last Updated: Dec 27, 2025

Structure-Based Simulation and Sampling of Transcription Factor Protein Movements along DNA from Atomic-Scale Stepping to Coarse-Grained Diffusion
09:17

Structure-Based Simulation and Sampling of Transcription Factor Protein Movements along DNA from Atomic-Scale Stepping to Coarse-Grained Diffusion

Published on: March 1, 2022

3.5K
Surrogate Model Development for Digital Experiments in Welding
09:17

Surrogate Model Development for Digital Experiments in Welding

Published on: March 28, 2025

1.7K
A Rapid Method for Modeling a Variable Cycle Engine
04:58

A Rapid Method for Modeling a Variable Cycle Engine

Published on: August 13, 2019

7.9K

Area of Science:

  • Computational Statistics and Bayesian Inference
  • Sequential Monte Carlo Methods
  • Bayesian Model Comparison

Background:

  • Traditional Bayesian inference can be computationally intensive, especially for complex models and large datasets.
  • Sequential updating of posterior distributions is crucial for real-time data analysis and adaptive modeling.
  • Challenges exist in performing inference on probability distributions residing in spaces of varying dimensions.

Purpose of the Study:

  • To develop a novel methodology for sequential Bayesian inference on a sequence of posteriors in spaces of different dimensions.
  • To introduce an efficient particle transition mechanism using deterministic transformations for inter-dimensional posterior movement.
  • To create a flexible and general algorithm for Bayesian model comparison applicable in low-acceptance rate scenarios.

Main Methods:

  • Sequential Monte Carlo (SMC) samplers are employed as the core algorithmic framework.
  • Deterministic transformations are innovatively used to facilitate particle movement between target distributions of differing dimensions.
  • Adaptive methods are integrated to enhance the algorithm's efficiency and generality.

Main Results:

  • A highly flexible and general algorithm for Bayesian model comparison is presented.
  • The proposed method demonstrates effectiveness in applications where reversible jump Markov chain Monte Carlo (RJMCMC) exhibits low acceptance rates.
  • Successful application of the methodology to model comparison for mixture models and sequential inference of coalescent trees.

Conclusions:

  • The developed sequential Monte Carlo approach offers a powerful alternative for Bayesian inference and model comparison, particularly in high-dimensional or complex scenarios.
  • The use of deterministic transformations provides an effective means for particle propagation across differing dimensional spaces, overcoming a key limitation.
  • The algorithm's adaptability and demonstrated success in mixture models and phylogenetic inference highlight its broad applicability in data-driven scientific research.