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

Fast Decoupled and DC Powerflow01:24

Fast Decoupled and DC Powerflow

The fast decoupled power flow method addresses contingencies in power system operations, such as generator outages or transmission line failures. This method provides quick power flow solutions, essential for real-time system adjustments. Fast decoupled power flow algorithms simplify the Jacobian matrix by neglecting certain elements, leading to two sets of decoupled equations:
Cluster Sampling Method01:20

Cluster Sampling Method

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...
Ziegler–Natta Chain-Growth Polymerization: Overview01:17

Ziegler–Natta Chain-Growth Polymerization: Overview

Ziegler–Natta polymerization is another form of addition or chain‐growth polymerization used for synthesizing linear polymers over branched polymers. The catalyst used for polymerization is the Ziegler–Natta catalyst, named after Karl Ziegler and Giulio Natta, who developed it in 1953. This catalyst is an organometallic complex of titanium tetrachloride and triethyl aluminum, with the active form of the catalyst being an alkyl titanium compound. Using the Ziegler–Natta catalyst, high molecular...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Uniform Depth Channel Flow: Problem Solving01:18

Uniform Depth Channel Flow: Problem Solving

To calculate the flow rate for a trapezoidal channel, first, identify the bottom width, side slope, and flow depth of the channel. The cross-sectional area (A) corresponding to the depth of flow (y), channel bottom width (B), and side slope (θ) is determined by:Next, calculate the wetted perimeter, which includes the bottom width and the sloped side lengths in contact with the water. Using the values of the cross-sectional area and the wetted perimeter, determine the hydraulic radius by...
Cyclic Processes And Isolated Systems01:19

Cyclic Processes And Isolated Systems

A thermodynamic system with zero heat exchange and work is an isolated system. For these systems, the internal energy remains constant.
In the case of a non-isolated system, the change in the internal energy is zero only if the process is cyclic. A thermodynamic process is considered cyclic if the system undergoes a series of changes and returns to its initial state. 
Consider a cyclic process that returns to its initial state, undergoing a four-step process. The heat transfer along each path...

You might also read

Related Articles

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

Sort by
Same author

Strengthening military preparedness and public safety through research and collaboration on infectious disease transmission epidemiological systems.

BMJ military health·2026
Same author

Differences in Shared T Cell receptor α Repertoire Associated with Recognition of Viral Antigens.

Immunological investigations·2026
Same author

Homophily within and across groups.

Nature communications·2025
Same author

Temporal social network modeling of mobile connectivity data with graph neural networks.

PloS one·2025
Same author

Block-corrected modularity for community detection.

Physical review. E·2025
Same author

Interactive AI annotation of medical images in a virtual reality environment.

International journal of computer assisted radiology and surgery·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 29, 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

Sequential algorithm for fast clique percolation.

Jussi M Kumpula1, Mikko Kivelä, Kimmo Kaski

  • 1Department of Biomedical Engineering and Computational Science, Helsinki University of Technology, P.O. Box 9203, FIN-02015 HUT, Finland. jkumpula@lce.hut.fi

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

A new sequential clique percolation algorithm (SCP) offers fast community detection in complex networks. This method efficiently identifies overlapping communities and hierarchical structures in both weighted and unweighted networks.

Related Experiment Videos

Last Updated: Jun 29, 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:

  • Complex network analysis
  • Community detection algorithms

Background:

  • Clique percolation is a deterministic community detection method for complex networks.
  • Existing methods can be computationally intensive and may not efficiently handle overlapping communities or hierarchical structures.

Purpose of the Study:

  • To introduce a sequential clique percolation algorithm (SCP) for fast community detection.
  • To enable the detection of k-clique communities at multiple weight thresholds in a single run.
  • To provide a dendrogram representation of hierarchical community structure.

Main Methods:

  • The sequential clique percolation algorithm (SCP) is based on sequentially inserting links into the network.
  • It tracks the emerging community structure in real-time.
  • The algorithm's computational time scales linearly with the number of k-cliques.

Main Results:

  • The SCP method allows for fast community detection in weighted and unweighted networks.
  • It can detect k-clique communities at multiple weight thresholds simultaneously.
  • The algorithm reveals nested community structures, as demonstrated on a product association network.

Conclusions:

  • The SCP algorithm provides an efficient and versatile tool for community detection in complex networks.
  • It supports the identification of overlapping and hierarchical community structures.
  • The method is applicable to both weighted and unweighted networks, including sparse weighted networks for weighted clique percolation.