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

Random Sampling Method01:09

Random Sampling Method

11.2K
Sampling is a technique to select a portion (or subset) of the larger population and study that portion (the sample) to gain information about the population. Data are the result of sampling from a population. The sampling method ensures that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest. Among the various sampling methods used by...
11.2K
Randomized Experiments01:13

Randomized Experiments

7.0K
The randomization process involves assigning study participants randomly to experimental or control groups based on their probability of being equally assigned. Randomization is meant to eliminate selection bias and balance known and unknown confounding factors so that the control group is similar to the treatment group as much as possible. A computer program and a random number generator can be used to assign participants to groups in a way that minimizes bias.
Simple randomization
Simple...
7.0K
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

66
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
66
Random Variables01:09

Random Variables

12.3K
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...
12.3K
Sequence Networks of Rotating Machines01:24

Sequence Networks of Rotating Machines

110
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...
110
Cluster Sampling Method01:20

Cluster Sampling Method

12.0K
Appropriate sampling methods ensure that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest.
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
12.0K

You might also read

Related Articles

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

Sort by
Same author

Sparse Bayesian multidimensional scaling(s).

Computational statistics·2025
Same author

Quantum Speedups for Multiproposal MCMC.

Bayesian analysis·2025
Same author

Parallel MCMC algorithms: theoretical foundations, algorithm design, case studies.

Transactions of mathematics and its applications : a journal of the IMA·2025
Same author

Tau drives cell specific functional isolation of the hippocampal formation.

bioRxiv : the preprint server for biology·2025
Same author

BEAST X for Bayesian phylogenetic, phylogeographic and phylodynamic inference.

Nature methods·2025
Same author

A SPATIALLY VARYING HIERARCHICAL RANDOM EFFECTS MODEL FOR LONGITUDINAL MACULAR STRUCTURAL DATA IN GLAUCOMA PATIENTS.

The annals of applied statistics·2025
Same journal

A Bayesian method for analyzing combinations of continuous, ordinal, and nominal categorical data with missing values.

Journal of multivariate analysis·2026
Same journal

Hierarchical structure-guided high-dimensional multi-view clustering.

Journal of multivariate analysis·2026
Same journal

Quadratic inference with dense functional responses.

Journal of multivariate analysis·2025
Same journal

Graph-constrained Analysis for Multivariate Functional Data.

Journal of multivariate analysis·2025
Same journal

From multivariate to functional data analysis: fundamentals, recent developments, and emerging areas.

Journal of multivariate analysis·2024
Same journal

Modeling the Cholesky factors of covariance matrices of multivariate longitudinal data.

Journal of multivariate analysis·2024
See all related articles

Related Experiment Video

Updated: Jul 14, 2025

Improving the Success Rate of Protein Crystallization by Random Microseed Matrix Screening
12:24

Improving the Success Rate of Protein Crystallization by Random Microseed Matrix Screening

Published on: August 31, 2013

17.9K

Generating MCMC proposals by randomly rotating the regular simplex.

Andrew J Holbrook1

  • 1Department of Biostatistics, University of California, Los Angeles, CA 90095, USA.

Journal of Multivariate Analysis
|October 6, 2023
PubMed
Summary
This summary is machine-generated.

The simplicial sampler is a novel parallel Markov chain Monte Carlo (MCMC) method. It simplifies proposal selection, offering significant speedups for various target distributions and dimensions.

Keywords:
Haar measureMarkov chain Monte CarloOrthogonal groupParallel MCMC

More Related Videos

Curation of Computational Chemical Libraries Demonstrated with Alpha-Amino Acids
08:21

Curation of Computational Chemical Libraries Demonstrated with Alpha-Amino Acids

Published on: April 13, 2022

2.7K
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.2K

Related Experiment Videos

Last Updated: Jul 14, 2025

Improving the Success Rate of Protein Crystallization by Random Microseed Matrix Screening
12:24

Improving the Success Rate of Protein Crystallization by Random Microseed Matrix Screening

Published on: August 31, 2013

17.9K
Curation of Computational Chemical Libraries Demonstrated with Alpha-Amino Acids
08:21

Curation of Computational Chemical Libraries Demonstrated with Alpha-Amino Acids

Published on: April 13, 2022

2.7K
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.2K

Area of Science:

  • Computational Statistics
  • Markov Chain Monte Carlo (MCMC) Methods

Background:

  • Markov chain Monte Carlo (MCMC) methods are widely used for Bayesian inference and sampling from complex probability distributions.
  • Existing MCMC algorithms can suffer from slow convergence and high computational cost, particularly in high-dimensional spaces.

Purpose of the Study:

  • To introduce a new class of parallel MCMC methods called the simplicial sampler.
  • To develop a simplified acceptance step for multiproposal MCMC algorithms.
  • To demonstrate the theoretical and practical efficiency gains of the simplicial sampler.

Main Methods:

  • The simplicial sampler generates multiple proposals at each iteration by rotating a simplex connected to the current Markov chain state.
  • A multivariate Gaussian-based symmetric multiproposal mechanism is investigated.
  • The acceptance step is simplified by choosing among simplex nodes proportionally to their target density values.

Main Results:

  • The simplicial sampler inherently preserves symmetry between proposals, leading to a simplified acceptance step.
  • A multivariate Gaussian-based symmetric multiproposal mechanism also achieves this simplified acceptance.
  • Both methods demonstrate significant theoretical and practical speedups.
  • Efficiency gains are observed across various dimensions and target distributions using conventional implementations.

Conclusions:

  • The simplicial sampler offers a computationally efficient and parallelizable approach to MCMC sampling.
  • The simplified acceptance step is a key innovation, reducing computational overhead.
  • The method shows promise for accelerating Bayesian inference and other MCMC applications.