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

Wald-Wolfowitz Runs Test I01:17

Wald-Wolfowitz Runs Test I

821
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...
821
Wald-Wolfowitz Runs Test II01:17

Wald-Wolfowitz Runs Test II

406
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 0s. In...
406
The Distance Formula01:20

The Distance Formula

435
In geometry, measuring the direct distance between two points on a plane is essential in various practical and theoretical applications. Whether in navigation, engineering, or computer graphics, determining the shortest path between two locations involves using the distance formula. This formula is derived from the Pythagorean Theorem, which relates the lengths of the sides of a right triangle. On a coordinate plane, the horizontal and vertical distances between two points serve as the legs of...
435
Nodal Analysis with Voltage Sources01:11

Nodal Analysis with Voltage Sources

1.7K
Nodal analysis is a remarkably effective method used in electrical engineering to simplify the analysis of complex circuits, including those with dependent or independent voltage sources. Its strength lies in its systematic approach to breaking down circuits into manageable components, making it easier for engineers to understand and solve.
Consider a circuit that contains four resistors and two voltage sources, as shown in Figure 1. One of these voltage sources is connected between a...
1.7K
Fast Decoupled and DC Powerflow01:24

Fast Decoupled and DC Powerflow

439
The fast decoupled power flow method addresses contingencies in power system operations, such as generator outages or transmission line failures. This method provides quick power flow solutions, essential for real-time system adjustments. Fast decoupled power flow algorithms simplify the Jacobian matrix by neglecting certain elements, leading to two sets of decoupled equations:
439
Nodal Analysis01:10

Nodal Analysis

1.6K
Nodal analysis is a fundamental method in electrical engineering used to simplify the process of circuit analysis. This method revolves around the concept of using node voltages as the primary variables for circuit analysis. The objective is to determine the voltage at each node in a circuit, which can then be used to find other quantities of interest, such as currents through specific components.
Consider, for instance, a simple circuit composed of three nodes and three resistors, as shown in...
1.6K

You might also read

Related Articles

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

Sort by
Same author

Perceived organizational support as a mediator between role clarity and work engagement among neurology specialist nurses: a cross-sectional study.

BMC nursing·2026
Same author

Frequency and risk factors of psychological distress among individuals with epilepsy before and during the outbreak of the SARS-CoV-2 Omicron variant in China: an online questionnaire survey.

Acta epileptologica·2025
Same author

Differences and potential mechanisms of theta oscillation and temporoparietal and temporal-central networks in temporal lobe epilepsy patients with unilateral hippocampal sclerosis.

Acta epileptologica·2025
Same author

Frustrated random walks: A fast method to compute node distances on hypergraphs.

Physical review. E·2024
Same author

NH<sub>4</sub> <sup>+</sup> Pre-Intercalation and Mo Doping VS<sub>2</sub> to Regulate Nanostructure and Electronic Properties for High Efficiency Sodium Storage.

Small (Weinheim an der Bergstrasse, Germany)·2023
Same author

Severe psychological distress among patients with epilepsy during the COVID-19 outbreak in southwest China.

Epilepsia·2020

Related Experiment Video

Updated: Nov 25, 2025

Modeling the Functional Network for Spatial Navigation in the Human Brain
05:55

Modeling the Functional Network for Spatial Navigation in the Human Brain

Published on: October 13, 2023

1.4K

Frustrated random walks: A faster algorithm to evaluate node distances on connected and undirected graphs.

Enzhi Li1, Zhengyi Le1

  • 1Suning R&D Center, Palo Alto, California 94304, USA.

Physical Review. E
|December 17, 2020
PubMed
Summary

A new random walk algorithm significantly accelerates graph node distance calculations, outperforming existing methods for large datasets. This faster approach offers robust results without extensive parameter tuning.

More Related Videos

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

947
Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline
10:44

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline

Published on: December 7, 2021

2.5K

Related Experiment Videos

Last Updated: Nov 25, 2025

Modeling the Functional Network for Spatial Navigation in the Human Brain
05:55

Modeling the Functional Network for Spatial Navigation in the Human Brain

Published on: October 13, 2023

1.4K
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

947
Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline
10:44

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline

Published on: December 7, 2021

2.5K

Area of Science:

  • Computer Science
  • Graph Theory
  • Data Mining

Background:

  • Existing graph node distance algorithms like random walks, DeepWalk, and personalized PageRank are computationally expensive for large-scale graphs.
  • These methods often underperform or are too time-consuming for the massive datasets prevalent in the big data era.

Purpose of the Study:

  • To develop a faster and more efficient algorithm for measuring distances between graph nodes.
  • To address the limitations of current algorithms in terms of speed and applicability to huge graphs.

Main Methods:

  • Proposed an improved random walk algorithm for graph node distance measurement.
  • Derived an analytical formula to rapidly compute expected hitting times for the enhanced random walk.
  • The algorithm features a single parameter (power expansion order) with robust performance across its variations.

Main Results:

  • Achieved over 10 times acceleration compared to the DeepWalk algorithm.
  • Demonstrated superior performance over existing methods on large graph datasets.
  • Results are robust, requiring no fine-tuning of model parameters.

Conclusions:

  • The novel random walk algorithm offers a significantly faster and effective solution for graph node distance computation.
  • Its efficiency and robustness make it suitable for various big data applications.
  • Potential applications include fraud detection, targeted advertising, recommendation systems, and topic-sensitive search.