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

Protein Networks02:26

Protein Networks

3.9K
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,...
3.9K
Cluster Sampling Method01:20

Cluster Sampling Method

11.8K
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...
11.8K
Model Approaches for Pharmacokinetic Data: Distributed Parameter Models01:06

Model Approaches for Pharmacokinetic Data: Distributed Parameter Models

64
Pharmacokinetic models are mathematical constructs that represent and predict the time course of drug concentrations in the body, providing meaningful pharmacokinetic parameters. These models are categorized into compartment, physiological, and distributed parameter models.
The distributed parameter models are specifically designed to account for variations and differences in some drug classes. This model is particularly useful for assessing regional concentrations of anticancer or...
64

You might also read

Related Articles

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

Sort by
Same author

Nature Counts to Three: Universal Mg-Pinch Motif Polarizes the Cleaved Bond in NTP-Processing Enzymes.

Journal of the American Chemical Society·2026
Same author

Correction to "Structural Dynamics and Catalytic Mechanism of ATP13A2 (PARK9) from Simulations".

The journal of physical chemistry. B·2026
Same author

Two-stage bone grafting for nasal correction in late-presenting patients with unilateral cleft: A 3-year comparative study.

Journal of plastic, reconstructive & aesthetic surgery : JPRAS·2026
Same author

Co-occurring polycyclic aromatic hydrocarbons and heavy metals drive bacterial community shifts regulated by soil water content in China's Beiluo River riparian soils.

Ecotoxicology (London, England)·2026
Same author

PuMYB40 and PuWRKY75 synergistically enhance phosphate uptake and organic phosphorus hydrolysis under phosphate deficiency in poplar.

Plant physiology·2026
Same author

Crosstalk of metabolic cell death pathways in colorectal cancer: implications for precision therapy.

Apoptosis : an international journal on programmed cell death·2026

Related Experiment Video

Updated: Jun 16, 2025

Modeling the Functional Network for Spatial Navigation in the Human Brain
05:55

Modeling the Functional Network for Spatial Navigation in the Human Brain

Published on: October 13, 2023

1.0K

Kemeny Constant-Based Optimization of Network Clustering Using Graph Neural Networks.

Sam Alexander Martino1, João Morado1, Chenghao Li1

  • 1Department of Physics and Astronomy, University College London, London WC1E 6BT, U.K.

The Journal of Physical Chemistry. B
|August 15, 2024
PubMed
Summary

Graph neural networks (GNNs) offer a novel solution for graph partitioning (GP) in kinetic networks, optimizing molecular system analysis by maximizing the Kemeny constant. This method efficiently identifies communities and reduces dimensionality for complex biomolecular data.

More Related Videos

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

6.9K
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.1K

Related Experiment Videos

Last Updated: Jun 16, 2025

Modeling the Functional Network for Spatial Navigation in the Human Brain
05:55

Modeling the Functional Network for Spatial Navigation in the Human Brain

Published on: October 13, 2023

1.0K
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

6.9K
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.1K

Area of Science:

  • Computational chemistry and biomolecular modeling
  • Network science and graph theory
  • Machine learning and artificial intelligence

Background:

  • Graph partitioning (GP) is crucial for analyzing complex network data, but traditional methods struggle with graph structures and diverse criteria.
  • Graph neural networks (GNNs) show promise for learning graph representations and addressing GP challenges.
  • Existing GNN approaches for GP have not been applied to Markov chains or kinetic networks, common in molecular systems.

Purpose of the Study:

  • To develop and evaluate Graph Neural Network (GNN) architectures for graph partitioning (GP) of Markov chains represented as kinetic networks.
  • To optimize GP by maximizing the Kemeny constant, a measure reflecting system time scales.
  • To adapt GNNs for biomolecular modeling applications, particularly those involving kinetic networks.

Main Methods:

  • Proposed several GNN-based architectures, including an encoder-decoder model utilizing GraphSAGE.
  • Employed linear layers within GNNs, demonstrating their effectiveness over more complex attention-based models for this specific task.
  • Validated the approach on randomly connected graphs, a 1D free energy profile kinetic network, and molecular dynamics data.

Main Results:

  • GNN-based architectures successfully performed graph partitioning on kinetic networks, outperforming larger models in certain configurations.
  • The method demonstrated effectiveness in clustering random graphs and analyzing molecular dynamics datasets.
  • Compared favorably against established partitioning techniques like PCCA+, highlighting the potential of GNNs in this domain.

Conclusions:

  • GNNs provide a powerful and adaptable framework for solving the graph partitioning problem in kinetic networks.
  • The proposed GNN architectures offer an efficient method for analyzing molecular systems and optimizing the Kemeny constant.
  • This work lays the groundwork for large-scale parallel training of GNNs for advanced graph partitioning tasks in computational chemistry and biomolecular modeling.