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

Cluster Sampling Method01:20

Cluster Sampling Method

12.2K
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.2K
Quantifying and Rejecting Outliers: The Grubbs Test01:02

Quantifying and Rejecting Outliers: The Grubbs Test

1.8K
Sometimes, a data set can have a recorded numerical observation that greatly  deviates from the rest of the data. Assuming that the data is normally distributed, a statistical method called the Grubbs test can be used to determine whether the observation is truly an outlier.  To perform a two-tailed Grubbs test, first, calculate the absolute difference between the outlier and the mean. Then, calculate the ratio between this difference and the standard deviation of the sample. This...
1.8K
Critical Region, Critical Values and Significance Level01:16

Critical Region, Critical Values and Significance Level

12.1K
The critical region, critical value, and significance level are interdependent concepts crucial in hypothesis testing.
In hypothesis testing, a sample statistic is converted to a test statistic using z, t, or chi-square distribution. A critical region is an area under the curve in  probability distributions demarcated by the critical value. When the test statistic falls in this region, it suggests that the null hypothesis must be rejected. As this region contains all those values of the...
12.1K
Routh-Hurwitz Criterion II01:19

Routh-Hurwitz Criterion II

333
In the application of the Routh-Hurwitz criterion, two specific scenarios can arise that complicate stability analysis.
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first...
333
Wald-Wolfowitz Runs Test II01:17

Wald-Wolfowitz Runs Test II

295
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...
295
Routh-Hurwitz Criterion I01:15

Routh-Hurwitz Criterion I

305
Consider an electrical power grid, where stability is essential to prevent blackouts. The Routh-Hurwitz criterion is a valuable tool for assessing system stability under varying load conditions or faults. By analyzing the closed-loop transfer function, the Routh-Hurwitz criterion helps determine whether the system remains stable.
To apply the Routh-Hurwitz criterion, a Routh table is constructed. The table's rows are labeled with powers of the complex frequency variable s, starting from the...
305

You might also read

Related Articles

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

Sort by
Same author

Homophily within and across groups.

Nature communications·2025
Same author

Identify structures underlying out-of-equilibrium reaction networks with random graph analysis.

Chemical science·2025
Same author

Resource and location sharing in wireless networks.

PloS one·2024
Same author

Detecting hyperbolic geometry in networks: Why triangles are not enough.

Physical review. E·2022
Same author

Robust subgraph counting with distribution-free random graph analysis.

Physical review. E·2021
Same author

Cluster Tails for Critical Power-Law Inhomogeneous Random Graphs.

Journal of statistical physics·2019
Same journal

Erratum: Low-dimensional model for adaptive networks of spiking neurons [Phys. Rev. E 111, 014422 (2025)].

Physical review. E·2026
Same journal

Disentangling the effects of many-body forces on depletion interactions.

Physical review. E·2026
Same journal

Charge transport and mode transition in dual-energy electron beam diodes.

Physical review. E·2026
Same journal

Optimization of multisite reactions in complex compartmentalized media.

Physical review. E·2026
Same journal

Origin of geometric cohesion in nonconvex granular materials: Interplay between interdigitation and rotational constraints enhancing frictional stability.

Physical review. E·2026
Same journal

Interaction of walkers with a standing Faraday wave.

Physical review. E·2026
See all related articles

Related Experiment Video

Updated: Aug 13, 2025

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
12:27

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Published on: February 15, 2017

7.0K

Sharpest possible clustering bounds using robust random graph analysis.

Judith Brugman1, Johan S H van Leeuwaarden1, Clara Stegehuis2

  • 1Department of Econometrics and Operations Research, Tilburg University, The Netherlands.

Physical Review. E
|January 21, 2023
PubMed
Summary
This summary is machine-generated.

This study introduces a robust method for analyzing complex networks using only basic statistics like mean and range, avoiding difficult degree distribution fitting. This approach reveals new insights into network correlations and clustering, especially for scale-free networks.

More Related Videos

JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics
07:28

JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics

Published on: October 19, 2021

3.2K
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.5K

Related Experiment Videos

Last Updated: Aug 13, 2025

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
12:27

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Published on: February 15, 2017

7.0K
JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics
07:28

JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics

Published on: October 19, 2021

3.2K
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.5K

Area of Science:

  • Complex network theory
  • Network science
  • Statistical graph theory

Background:

  • Complex network analysis heavily relies on accurate degree distribution fitting, which is challenging for scale-free networks.
  • Existing methods often struggle with the nuances of power-law degree distributions.

Purpose of the Study:

  • To develop a robust method for complex network assessment independent of the full degree distribution.
  • To establish tight bounds for correlation and clustering measures using only summary statistics.
  • To derive fundamental laws governing network correlations and clustering evolution.

Main Methods:

  • Utilized summary statistics (mean, range, dispersion) of degree distributions.
  • Solved semi-infinite linear programs to derive bounds for network measures.
  • Identified extremal random graphs with specific three-point degree distributions.

Main Results:

  • Achieved the sharpest possible bounds for correlation and clustering measures.
  • Developed robust laws explaining the evolution of degree-degree correlations and local clustering.
  • Demonstrated that power-law networks with diverging variance exhibit extreme correlation and clustering behaviors.

Conclusions:

  • The proposed method offers a robust alternative for complex network analysis, simplifying assessments.
  • The derived laws provide a theoretical basis for observed phenomena in scale-free networks.
  • Findings deepen the understanding of correlation and clustering in networks, particularly scale-free types.