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

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

Wald-Wolfowitz Runs Test II

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...
Random Variables01:09

Random Variables

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...
Random Error01:04

Random Error

Random or indeterminate errors originate from various uncontrollable variables, such as variations in environmental conditions, instrument imperfections, or the inherent variability of the phenomena being measured. Usually, these errors cannot be predicted, estimated, or characterized because their direction and magnitude often vary in magnitude and direction even during consecutive measurements. As a result, they are difficult to eliminate. However, the aggregate effect of these errors can be...
Poisson Probability Distribution01:09

Poisson Probability Distribution

A Poisson probability distribution is a discrete probability distribution. It gives the probability of a number of events occurring in a fixed interval of time or space if these events happen at a known average rate and independently of the time since the last event. For example, a book editor might be interested in the number of words spelled incorrectly in a particular book. It might be that, on average, there are five words spelled incorrectly in 100 pages. The interval is 100 pages.
The...
Randomized Experiments01:13

Randomized Experiments

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

You might also read

Related Articles

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

Sort by
Same author

Kernel shape renormalization explains output-output correlations in finite Bayesian one-hidden-layer networks.

Physical review. E·2025
Same author

Local kernel renormalization as a mechanism for feature learning in overparametrized convolutional neural networks.

Nature communications·2025
Same author

Predictive Power of a Bayesian Effective Action for Fully Connected One Hidden Layer Neural Networks in the Proportional Limit.

Physical review letters·2024
Same author

Regularization, early-stopping and dreaming: A Hopfield-like setup to address generalization and overfitting.

Neural networks : the official journal of the International Neural Network Society·2024
Same author

COVID-19 Vaccine Hesitancy and Early Adverse Events Reported in a Cohort of 7,881 Italian Physicians.

Annali di igiene : medicina preventiva e di comunita·2021
Same author

Role and potential therapeutic use of antibodies against herpetic infections.

Clinical microbiology and infection : the official publication of the European Society of Clinical Microbiology and Infectious Diseases·2017

Related Experiment Video

Updated: Jun 18, 2026

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

Random walks on deterministic scale-free networks: exact results.

E Agliari1, R Burioni

  • 1Dipartimento di Fisica, Università degli Studi di Parma, viale Usberti 7/A, 43100 Parma, Italy.

Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics
|November 13, 2009
PubMed
Summary
This summary is machine-generated.

This study analyzes random walks on scale-free networks, finding efficient first-passage times to the main hub. The research provides exact calculations for reaching the hub, crucial for understanding network dynamics.

More Related Videos

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

Related Experiment Videos

Last Updated: Jun 18, 2026

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

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

Area of Science:

  • Network Science
  • Statistical Physics
  • Complex Systems

Background:

  • Random walks are fundamental processes on networks.
  • Scale-free networks exhibit unique topological properties, including hubs.
  • Understanding first-passage times is key to network dynamics and information diffusion.

Purpose of the Study:

  • To investigate the random walk problem on deterministic scale-free networks.
  • To derive exact analytical results for first-passage phenomena, specifically first return to the main hub.
  • To determine the mean time to reach the main hub and analyze its scaling behavior.

Main Methods:

  • Analysis of random walks on a specific class of deterministic scale-free networks.
  • Calculation of first-passage probabilities and mean first-passage times.
  • Derivation of an exact analytical expression for the mean time to reach the main hub.

Main Results:

  • Exact results for first-passage phenomena, including first return probability to the main hub.
  • The leading behavior of the mean time to reach the main hub is tau approximately V^(1-1/gamma).
  • The random walk process on these networks is found to be particularly efficient.

Conclusions:

  • The study provides precise analytical insights into random walk dynamics on scale-free networks.
  • The derived mean first-passage time scaling offers a quantitative understanding of hub accessibility.
  • The findings highlight the efficiency of navigation and process spread in these network structures.