Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Sequence Networks of Rotating Machines

Sequence Networks of Rotating Machines

A Y-connected synchronous generator, grounded through a neutral impedance, is designed to produce balanced internal phase voltages with only positive-sequence components. The generator's sequence networks include a source voltage that is exclusively in the positive-sequence network. The sequence components of line-to-ground voltages at the generator terminals illustrate this configuration.
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...

Vector Algebra: Graphical Method

Vector Algebra: Graphical Method

Vectors can be multiplied by scalars, added to other vectors, or subtracted from other vectors. The vector sum of two (or more) vectors is called the resultant vector or, for short, the resultant.
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...

Protein Networks

Protein Networks

An organism can have thousands of different proteins, and these proteins must cooperate to ensure the health of an organism. Proteins bind to other proteins and form complexes to carry out their functions. Many proteins interact with multiple other proteins creating a complex network of protein interactions.
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

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

Subviral Agents

Subviral Agents

Subviral agents are infectious entities that resemble viruses but lack one or more viral components, such as a capsid or essential replication machinery. These agents include viroids, prions, and satellites, each possessing distinct structural and functional characteristics that influence their mode of infection and replication.Viroids are the simplest subviral agents, consisting of circular, single-stranded RNA molecules without a protein coat. They exclusively infect plants, relying entirely...

Block Diagram Reduction

Block Diagram Reduction

The process of deriving the transfer function of a control system often involves reducing its block diagram to a single block. This simplification can be achieved through a series of strategic operations, including relocating branch points and comparators. These operations preserve the overall function of the system while allowing for easier manipulation and combination of blocks.
The first step in this process is the identification and relocation of a branch point. A branch point, where a...

You might also read

Related Articles

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

Sort by

Same author

Conformity to popular, not average, opinions: Models, data, and evolution.

Proceedings of the National Academy of Sciences of the United States of America·2026

Same author

Endogenous iron biomineralization in the mouse spleen of metabolic diseases.

Fundamental research·2026

Same author

Current-induced creation and dynamics of embedded magnetic skyrmion bags.

Nature communications·2026

Same author

Probing the Meissner Effect in Microscale Two-Dimensional van der Waals Superconductors.

Advanced materials (Deerfield Beach, Fla.)·2026

Same author

Highly Enantioselective Hydrogenation of Imines Catalyzed by Chiral Macrocyclic Boranes.

Organic letters·2026

Same author

Peer Effects on Academic Performance of High School Students in a County-Level Context of Western China: Empirical Evidence from Large-Scale Social Network Survey.

Behavioral sciences (Basel, Switzerland)·2026

Search research articles

Related Experiment Video

Updated: Aug 13, 2025

Evidence-based Knowledge Synthesis and Hypothesis Validation: Navigating Biomedical Knowledge Bases via Explainable AI and Agentic Systems

Evidence-based Knowledge Synthesis and Hypothesis Validation: Navigating Biomedical Knowledge Bases via Explainable AI and Agentic Systems

Published on: June 13, 2025

A memetic algorithm for finding multiple subgraphs that optimally cover an input network.

Xiaochen He¹, Yang Wang¹, Haifeng Du¹

¹Center for Administration and Complexity Science of Xi'an Jiaotong University, Xi'an, Shaanxi Province, China.

|January 20, 2023

Summary

This summary is machine-generated.

This study introduces a new method for finding multiple dense subgraphs to improve network coverage. The proposed memetic algorithm effectively identifies dense subgraphs for better data analysis.

More Related Videos

Author Spotlight: An Optimized Automated Method for Investigating Retinoic Acid Receptors in Neuronal Mitochondria

Author Spotlight: An Optimized Automated Method for Investigating Retinoic Acid Receptors in Neuronal Mitochondria

Published on: July 28, 2023

Modeling the Functional Network for Spatial Navigation in the Human Brain

Modeling the Functional Network for Spatial Navigation in the Human Brain

Published on: October 13, 2023

Related Experiment Videos

Last Updated: Aug 13, 2025

Evidence-based Knowledge Synthesis and Hypothesis Validation: Navigating Biomedical Knowledge Bases via Explainable AI and Agentic Systems

Evidence-based Knowledge Synthesis and Hypothesis Validation: Navigating Biomedical Knowledge Bases via Explainable AI and Agentic Systems

Published on: June 13, 2025

Author Spotlight: An Optimized Automated Method for Investigating Retinoic Acid Receptors in Neuronal Mitochondria

Author Spotlight: An Optimized Automated Method for Investigating Retinoic Acid Receptors in Neuronal Mitochondria

Published on: July 28, 2023

Modeling the Functional Network for Spatial Navigation in the Human Brain

Modeling the Functional Network for Spatial Navigation in the Human Brain

Published on: October 13, 2023

Area of Science:

Graph mining
Network analysis
Computational social science

Background:

Dense subgraph discovery is crucial for analyzing complex networks in various fields.
Existing methods primarily focus on finding a single densest subgraph, neglecting the coverage of the entire network.
Systematic exploration of methods for finding multiple dense subgraphs to maximize network coverage is lacking.

Purpose of the Study:

To address the gap in finding multiple dense subgraphs for optimal network coverage.
To propose a mathematical model for maximizing the total coverage of a network through subgraph extraction.
To develop and evaluate an effective and efficient algorithm for this purpose.

Main Methods:

A variant of the densest subgraph problem is formulated.
A mathematical model is presented to optimize the total coverage by extracting multiple subgraphs.
A memetic algorithm is developed and implemented to maximize network coverage.

Main Results:

The proposed memetic algorithm demonstrates effectiveness and efficiency in finding dense subgraphs.
The method successfully maximizes the total coverage of real-world networks.
Empirical analysis provides insights into the meaning of the optimal sampling method.

Conclusions:

The study successfully extends the densest subgraph problem to optimize network coverage using multiple subgraphs.
The developed memetic algorithm offers an effective and efficient solution for this problem.
The findings have implications for various network analysis applications, enhancing understanding through optimal sampling.