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

Comparing the Survival Analysis of Two or More Groups01:20

Comparing the Survival Analysis of Two or More Groups

533
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...
533
Cluster Sampling Method01:20

Cluster Sampling Method

13.9K
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...
13.9K
What are Populations and Communities?00:30

What are Populations and Communities?

36.9K
Overview
36.9K
Comparing Copy Number Variations and SNPs02:26

Comparing Copy Number Variations and SNPs

18.5K
Sequencing of the human genome has opened up several best-kept secrets of the genome. Scientists have identified thousands of genome variations that exist within a population. These variations can be a single nucleotide or a larger chromosomal variation.
Copy number variations or CNVs are the structural variations that cover more than 1kb of DNA sequence. The single nucleotide polymorphism (SNP), on the other hand, is a single nucleotide change or a point mutation that is found in more than 1%...
18.5K
Evolutionary Relationships through Genome Comparisons02:54

Evolutionary Relationships through Genome Comparisons

6.8K
Genome comparison is one of the excellent ways to interpret the evolutionary relationships between organisms. The basic principle of genome comparison is that if two species share a common feature, it is likely encoded by the DNA sequence conserved between both species. The advent of genome sequencing technologies in the late 20th century enabled scientists to understand the concept of conservation of domains between species and helped them to deduce evolutionary relationships across diverse...
6.8K
Quantifying and Rejecting Outliers: The Grubbs Test01:02

Quantifying and Rejecting Outliers: The Grubbs Test

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

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

Modeling the amplification of epidemic spread by individuals exposed to misinformation on social media.

Npj complexity·2025
Same author

Parallel median consensus clustering in complex networks.

Scientific reports·2025
Same author

Cell Type Differentiation Using Network Clustering Algorithms.

bioRxiv : the preprint server for biology·2024
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: Jan 9, 2026

Author Spotlight: Enhancement of Salient Object Detection for Smart Grid Applications
03:31

Author Spotlight: Enhancement of Salient Object Detection for Smart Grid Applications

Published on: December 15, 2023

991

Community detection algorithms: a comparative analysis.

Andrea Lancichinetti1, Santo Fortunato

  • 1Complex Networks and Systems, Institute for Scientific Interchange, Viale S. Severo 65, 10133 Torino, Italy.

Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics
|April 7, 2010
PubMed
Summary
This summary is machine-generated.

Identifying community structures in complex networks is vital. Three algorithms show excellent performance and efficiency on diverse network benchmarks, enabling analysis of large systems.

More Related Videos

Divergence of Root Microbiota in Different Habitats based on Weighted Correlation Networks
09:49

Divergence of Root Microbiota in Different Habitats based on Weighted Correlation Networks

Published on: September 25, 2021

4.8K
Characterizing Microbiome Dynamics – Flow Cytometry Based Workflows from Pure Cultures to Natural Communities
09:57

Characterizing Microbiome Dynamics – Flow Cytometry Based Workflows from Pure Cultures to Natural Communities

Published on: July 12, 2018

12.4K

Related Experiment Videos

Last Updated: Jan 9, 2026

Author Spotlight: Enhancement of Salient Object Detection for Smart Grid Applications
03:31

Author Spotlight: Enhancement of Salient Object Detection for Smart Grid Applications

Published on: December 15, 2023

991
Divergence of Root Microbiota in Different Habitats based on Weighted Correlation Networks
09:49

Divergence of Root Microbiota in Different Habitats based on Weighted Correlation Networks

Published on: September 25, 2021

4.8K
Characterizing Microbiome Dynamics – Flow Cytometry Based Workflows from Pure Cultures to Natural Communities
09:57

Characterizing Microbiome Dynamics – Flow Cytometry Based Workflows from Pure Cultures to Natural Communities

Published on: July 12, 2018

12.4K

Area of Science:

  • Network science
  • Complex systems analysis
  • Graph theory

Background:

  • Understanding complex systems requires identifying community structures beyond local organization.
  • Existing community detection algorithms lack rigorous performance evaluation on realistic network models.
  • Previous tests often used small or artificial networks, not reflecting real-world complexity.

Purpose of the Study:

  • To rigorously evaluate the performance of various community detection algorithms.
  • To assess algorithms using novel benchmark graphs with heterogeneous degree and community size distributions.
  • To compare algorithm performance against established benchmarks and random graphs.

Main Methods:

  • Testing multiple community detection algorithms, including recent methods by Rosvall & Bergstrom, Blondel, and Ronhovde & Nussinov.
  • Utilizing a new class of benchmark graphs with realistic heterogeneous properties.
  • Benchmarking against the Girvan-Newman algorithm and random graphs.

Main Results:

  • Three algorithms (Rosvall & Bergstrom, Blondel, Ronhovde & Nussinov) demonstrated excellent performance.
  • These top-performing algorithms possess low computational complexity.
  • The chosen benchmark graphs effectively challenge and differentiate algorithm capabilities.

Conclusions:

  • The evaluated algorithms provide reliable community detection for complex networks.
  • Low computational complexity makes these methods suitable for analyzing large-scale systems.
  • This study provides a robust framework for assessing network community detection algorithms.