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

Entropy Change in Reversible Processes01:10

Entropy Change in Reversible Processes

2.5K
In the Carnot engine, which achieves the maximum efficiency between two reservoirs of fixed temperatures, the total change in entropy is zero. The observation can be generalized by considering any reversible cyclic process consisting of many Carnot cycles. Thus, it can be stated that the total entropy change of any ideal reversible cycle is zero.
The statement can be further generalized to prove that entropy is a state function. Take a cyclic process between any two points on a p-V diagram.
2.5K
Wald-Wolfowitz Runs Test I01:17

Wald-Wolfowitz Runs Test I

639
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...
639
Entropy02:39

Entropy

29.4K
Salt particles that have dissolved in water never spontaneously come back together in solution to reform solid particles. Moreover, a gas that has expanded in a vacuum remains dispersed and never spontaneously reassembles. The unidirectional nature of these phenomena is the result of a thermodynamic state function called entropy (S). Entropy is the measure of the extent to which the energy is dispersed throughout a system, or in other words, it is proportional to the degree of disorder of a...
29.4K
Randomized Experiments01:13

Randomized Experiments

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

Random Variables

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

Wald-Wolfowitz Runs Test II

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

You might also read

Related Articles

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

Sort by
Same author

Efficient Gillespie algorithms for spreading phenomena in large and heterogeneous higher-order networks.

Nature communications·2026
Same author

Directionality-Induced Jamming in Multiplex Networks.

Physical review letters·2026
Same author

Rumor propagation on hypergraphs.

Nature communications·2026
Same author

Mechanistic interplay between information spreading and opinion polarization.

PNAS nexus·2026
Same author

The interplay between pitch control and top speed in soccer considering the stamina factor.

Scientific reports·2025
Same author

Leveraging knowledge for explainable AI in personalized cancer treatment: challenges and future directions.

Frontiers in digital health·2025

Related Experiment Video

Updated: Jun 23, 2025

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
05:12

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

Published on: January 16, 2019

11.4K

From unbiased to maximal-entropy random walks on hypergraphs.

Pietro Traversa1,2,3, Guilherme Ferraz de Arruda3, Yamir Moreno1,2,3

  • 1Institute for Biocomputation and Physics of Complex Systems (BIFI), University of Zaragoza, 50018 Zaragoza, Spain.

Physical Review. E
|June 22, 2024
PubMed
Summary

This study introduces random walks on hypergraphs, exploring unbiased and maximal entropy types. Analyzing stationary distributions and hitting times reveals key structural and dynamical properties of these complex systems.

More Related Videos

Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks
11:18

Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks

Published on: March 2, 2015

10.3K
Hi-C: A Method to Study the Three-dimensional Architecture of Genomes.
22:27

Hi-C: A Method to Study the Three-dimensional Architecture of Genomes.

Published on: May 6, 2010

408.9K

Related Experiment Videos

Last Updated: Jun 23, 2025

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
05:12

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

Published on: January 16, 2019

11.4K
Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks
11:18

Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks

Published on: March 2, 2015

10.3K
Hi-C: A Method to Study the Three-dimensional Architecture of Genomes.
22:27

Hi-C: A Method to Study the Three-dimensional Architecture of Genomes.

Published on: May 6, 2010

408.9K

Area of Science:

  • Mathematics
  • Network Science
  • Statistical Physics

Background:

  • Random walks are crucial for analyzing pairwise interactions in networks.
  • Real-world processes often involve higher-order relationships better modeled by hypergraphs.
  • Existing random walk models do not fully capture hypergraph complexity.

Purpose of the Study:

  • To investigate random walks on hypergraphs, a structure for higher-order relationships.
  • To define and compare unbiased and maximal entropy random walks on hypergraphs.
  • To analyze the structural and dynamical properties of hypergraphs using these random walk models.

Main Methods:

  • Defining and analyzing two types of random walks: unbiased and maximal entropy.
  • Examining stationary distributions of these random walks.
  • Calculating and comparing associated hitting times.
  • Illustrating with a toy example and analyzing artificial and real hypergraphs.

Main Results:

  • Characterization of unbiased and maximal entropy random walks on hypergraphs.
  • Identification of similarities and differences between the two walk types.
  • Insights into the structural and dynamical properties of hypergraphs derived from random walk analysis.

Conclusions:

  • Random walks on hypergraphs offer a powerful framework for studying complex systems with higher-order interactions.
  • The study provides a foundation for further research into diverse random walk models and applications on hypergraphs.
  • Findings contribute to understanding both the structure and dynamics of systems represented by hypergraphs.