Jove
Visualize
Contact Us

Related Concept Videos

Wald-Wolfowitz Runs Test I01:17

Wald-Wolfowitz Runs Test I

656
The Wald-Wolfowitz test, also known as the runs test, is a nonparametric statistical test used to assess the randomness of a sequence of two different types of elements (e.g., positive/negative values, successes/failures). It examines whether the order of the elements in a sequence is random or if there is a pattern or trend present. This nonparametric test applies to any ordered data despite the population and sample data distribution, even if a higher sample size is available.
The test works...
656
Wald-Wolfowitz Runs Test II01:17

Wald-Wolfowitz Runs Test II

251
The Wald-Wolfowitz runs test, commonly referred to as the runs test, is a nonparametric test used to assess the randomness of ordered data. The test evaluates the number of runs, which are consecutive sequences of similar elements within the data. If the number of runs is significantly higher or lower than expected, the data is considered non-random, indicating a detectable pattern or structure.
For binary data, runs are identified using symbols such as + and −, or equivalently, 1s and...
251
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

57
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...
57
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

You might also read

Related Articles

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

Sort by
Same author

Robustness and classical proxy of entanglement in variants of quantum walks.

Physical review. E·2025
Same author

Structure and scaling of Kitaev chain across a quantum critical point in real space.

Journal of physics. Condensed matter : an Institute of Physics journal·2024
Same author

Geometry-based circulation of local thermal current in quantum harmonic and Bose-Hubbard systems.

Physical review. E·2022
Same author

Custodial Chiral Symmetry in a Su-Schrieffer-Heeger Electrical Circuit with Memory.

Physical review letters·2022
Same author

Topological classifications of quadratic bosonic excitations in closed and open systems with examples.

Journal of physics. Condensed matter : an Institute of Physics journal·2022
Same author

Non-Hermitian generalizations of extended Su-Schrieffer-Heeger models.

Journal of physics. Condensed matter : an Institute of Physics journal·2020
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 Experiment Video

Updated: Jul 13, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

590

Localization of quantum walks with classical randomness: Comparison between manual methods and supervised machine

Christopher Mastandrea1, Chih-Chun Chien1

  • 1Department of Physics, University of California, Merced, California 95343, USA.

Physical Review. E
|October 18, 2023
PubMed
Summary
This summary is machine-generated.

Classical randomness induces a quantum walk transition, altering walker probability distributions. Machine learning methods effectively identify this transition, highlighting potentials and challenges in analyzing mixed quantum-classical systems.

More Related Videos

Author Spotlight: Using the MouseWalker to Quantify Locomotor Dysfunction in a Mouse Model of Spinal Cord Injury
07:28

Author Spotlight: Using the MouseWalker to Quantify Locomotor Dysfunction in a Mouse Model of Spinal Cord Injury

Published on: March 24, 2023

2.9K
Analyzing Mitochondrial Morphology Through Simulation Supervised Learning
12:06

Analyzing Mitochondrial Morphology Through Simulation Supervised Learning

Published on: March 3, 2023

4.1K

Related Experiment Videos

Last Updated: Jul 13, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

590
Author Spotlight: Using the MouseWalker to Quantify Locomotor Dysfunction in a Mouse Model of Spinal Cord Injury
07:28

Author Spotlight: Using the MouseWalker to Quantify Locomotor Dysfunction in a Mouse Model of Spinal Cord Injury

Published on: March 24, 2023

2.9K
Analyzing Mitochondrial Morphology Through Simulation Supervised Learning
12:06

Analyzing Mitochondrial Morphology Through Simulation Supervised Learning

Published on: March 3, 2023

4.1K

Area of Science:

  • Quantum physics
  • Machine learning
  • Complex systems

Background:

  • Quantum walks exhibit unique probability distributions.
  • Classical randomness can influence quantum phenomena.
  • Machine learning is increasingly applied to analyze physical systems.

Purpose of the Study:

  • To investigate the effect of classical randomness on quantum walk probability distributions.
  • To establish the generality of quantum walk localization under random perturbations.
  • To compare manual analysis with supervised machine learning methods for identifying quantum phase transitions.

Main Methods:

  • Simulating quantum walks with classical random rotations and translations.
  • Analyzing probability distributions, momentum of inertia, and inverse participation ratio.
  • Implementing and evaluating Support Vector Machines (SVM), Multilayer Perceptron (MLP), and Convolutional Neural Networks (CNN).

Main Results:

  • A transition from a two-peak to a single-peak distribution occurs above a critical random parameter.
  • Quantum walk localization is observed with both random rotation and translation.
  • Supervised machine learning models successfully identified the transition point.
  • SVM showed minor exponent underestimation; neural networks exhibited deviations with random translation.

Conclusions:

  • Classical randomness can induce localization in quantum walks.
  • Machine learning models demonstrate capability in detecting quantum transitions.
  • Challenges remain in applying machine learning to systems with mixed quantum-classical dynamics and fluctuating distributions.