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

Bar Graph01:07

Bar Graph

A bar graph is also called a bar chart and consists of bars that are separated from each other. It either uses horizontal or vertical bars to show comparisons among categories. The bars can be rectangles, or they can be rectangular boxes (used in three-dimensional plots). One axis of the graph represents the specific categories being compared, and the other axis shows a discrete value. In this graph, the length of the bar for each category is proportional to the number or percent of individuals...
Multiple Bar Graph01:07

Multiple Bar Graph

As the name suggests, a multiple bar graph is the same as a bar graph but has multiple bars to depict relationships between different data values. One can include as many parameters as possible. However, each parameter must have the same unit of measurement.
Each bar or column in the multiple bar graph represents a data value. These graphs are used primarily in interrelating two or more sets of data. The categories of different kinds of data are listed along the horizontal or x-axis, whereas...
Quantifying and Rejecting Outliers: The Grubbs Test01:02

Quantifying and Rejecting Outliers: The Grubbs Test

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 number is...
Comparing the Survival Analysis of Two or More Groups01:20

Comparing the Survival Analysis of Two or More Groups

Survival analysis is a cornerstone of medical research, used to evaluate the time until an event of interest occurs, such as death, disease recurrence, or recovery. Unlike standard statistical methods, survival analysis is particularly adept at handling censored data—instances where the event has not occurred for some participants by the end of the study or remains unobserved. To address these unique challenges, specialized techniques like the Kaplan-Meier estimator, log-rank test, and Cox...
The Mantel-Cox Log-Rank Test01:19

The Mantel-Cox Log-Rank Test

The Mantel-Cox log-rank test is a widely used statistical method for comparing the survival distributions of two groups. It tests whether a statistically significant difference exists in survival times between the groups without assuming a specific distribution for the survival data, making it a non-parametric test. This flexibility makes the log-rank test particularly valuable in medical research and other fields where the timing of an event, such as death or disease recurrence, is of interest.
Methods to Assess Microbial Communities01:19

Methods to Assess Microbial Communities

Microbial communities, comprising bacteria, archaea, and eukaryotic microorganisms, inhabit diverse ecosystems and play crucial roles in environmental and biological processes. Their diversity is defined by three main parameters: species richness (the number of distinct species), species abundance (the relative quantity of each species), and species evenness (how uniformly individual species are distributed in various locations). These factors together shape the structure and ecological balance...

You might also read

Related Articles

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

Sort by
Same author

Network clustering algorithms and preprocessing pipelines for robust cell type identification in single-cell RNA sequencing data.

Scientific reports·2026
Same author

Scale invariance and statistical significance in complex weighted networks.

Physical review. E·2026
Same author

Detectability threshold in weighted modular networks.

Physical review. E·2026
Same author

Shortest-path percolation on scale-free networks.

Physical review. E·2026
Same author

Triadic percolation on multilayer networks.

Physical review. E·2026
Same author

Modeling resource consumption in the US air transportation system via minimum-cost percolation.

Nature communications·2025
Same journal

Tension on dsDNA bound to ssDNA-RecA filaments may play an important role in driving efficient and accurate homology recognition and strand exchange.

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
Same journal

Publisher's Note: Amplitude-phase coupling drives chimera states in globally coupled laser networks [Phys. Rev. E 91, 040901(R) (2015)].

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
Same journal

Erratum: Shapes of sedimenting soft elastic capsules in a viscous fluid [Phys. Rev. E 92, 033003 (2015)].

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
Same journal

Erratum: Attenuation of excitation decay rate due to collective effect [Phys. Rev. E 90, 022142 (2014)].

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
Same journal

Publisher's Note: Role of connectivity and fluctuations in the nucleation of calcium waves in cardiac cells [Phys. Rev. E 92, 052715 (2015)].

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
Same journal

Publisher's Note: Lattice Boltzmann approach for complex nonequilibrium flows [Phys. Rev. E 92, 043308 (2015)].

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
See all related articles

Related Experiment Video

Updated: Jun 28, 2026

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

Benchmark graphs for testing community detection algorithms.

Andrea Lancichinetti1, Santo Fortunato, Filippo Radicchi

  • 1Complex Systems Lagrange Laboratory (CNLL), Institute for Scientific Interchange (ISI), Viale S. Severo 65, 10133, Torino, Italy.

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

This study introduces new benchmark graphs for community detection algorithms. These benchmarks reveal limitations in popular methods like modularity optimization and Potts model clustering not seen in standard tests.

Related Experiment Videos

Last Updated: Jun 28, 2026

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

Area of Science:

  • Network science
  • Data mining
  • Computational social science

Background:

  • Community structure is key to understanding real-world networks.
  • Existing methods for testing community detection algorithms are insufficient.
  • Standard benchmarks do not accurately represent real network properties.

Purpose of the Study:

  • To develop a new class of benchmark graphs for evaluating community detection algorithms.
  • To assess the performance of popular community detection methods using realistic network properties.

Main Methods:

  • Introduction of benchmark graphs accounting for heterogeneous node degrees and community sizes.
  • Testing of modularity optimization and Potts model clustering algorithms.

Main Results:

  • The new benchmark graphs present a more rigorous test for community detection algorithms.
  • Limitations of tested algorithms become apparent with the proposed benchmark.

Conclusions:

  • Current community detection algorithms may not perform as well on real-world networks as previously thought.
  • The developed benchmark graphs are crucial for more accurate algorithm evaluation.