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

Extraction: Partition and Distribution Coefficients01:14

Extraction: Partition and Distribution Coefficients

2.4K
The distribution law or Nernst's distribution law is the law that governs the distribution of a solute between two immiscible solvents. This law, also known as the partition law, states that if a solute is added to the mixture of two immiscible solvents at a constant temperature, the solute is distributed between the two solvents in such a way that the ratio of solute concentrations in the solvents remains constant at equilibrium.
For extracting a solute from an aqueous phase into an...
2.4K
Cluster Sampling Method01:20

Cluster Sampling Method

11.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...
11.9K
Vector Algebra: Graphical Method01:10

Vector Algebra: Graphical Method

12.1K
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...
12.1K
Area Computation by the Alternative Coordinate Method01:24

Area Computation by the Alternative Coordinate Method

52
The alternative coordinate method, also known as the Shoelace Formula, is a technique for determining the area of a traverse using Cartesian coordinates. This method relies on the sequential arrangement of x and y coordinates for each point of the shape, ensuring accuracy and ease of application.In this approach, each corner's x and y coordinates are listed as fractions, with the x-coordinate as the numerator and the y-coordinate as the denominator. These coordinates are arranged sequentially...
52
Network Function of a Circuit01:25

Network Function of a Circuit

286
Frequency response analysis in electrical circuits provides vital insights into a circuit's behavior as the frequency of the input signal changes. The transfer function, a mathematical tool, is instrumental in understanding this behavior. It defines the relationship between phasor output and input and comes in four types: voltage gain, current gain, transfer impedance, and transfer admittance. The critical components of the transfer function are the poles and zeros.
286
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation01:24

One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation

487
This lesson introduces two critical methods in pharmacokinetics, the Wagner-Nelson and Loo-Riegelman methods, used for estimating the absorption rate constant (ka) for drugs administered via non-intravenous routes. The Wagner-Nelson method relates ka to the plasma concentration derived from the slope of a semilog percent unabsorbed time plot. However, it is limited to drugs with one-compartment kinetics and can be impacted by factors like gastrointestinal motility or enzymatic degradation.
On...
487

You might also read

Related Articles

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

Sort by
Same author

The exponential distance rule-based network model predicts topology and reveals functionally relevant properties of the <i>Drosophila</i> projectome.

Network neuroscience (Cambridge, Mass.)·2025
Same author

Impossible ecologies: Interaction networks and stability of coexistence in ecological communities.

Cell systems·2025
Same author

Protocol to study brain dynamics of mammals through the hierarchy of complex correlation patterns defining a robust functional architecture.

STAR protocols·2025
Same author

Brain dynamics supported by a hierarchy of complex correlation patterns defining a robust functional architecture.

Cell systems·2024
Same author

Predictability of cortico-cortical connections in the mammalian brain.

Network neuroscience (Cambridge, Mass.)·2024
Same author

The fractal brain: scale-invariance in structure and dynamics.

Cerebral cortex (New York, N.Y. : 1991)·2022

Related Experiment Video

Updated: Jun 29, 2025

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

Community detection in directed weighted networks using Voronoi partitioning.

Botond Molnár1,2,3, Ildikó-Beáta Márton1, Szabolcs Horvát4,5,6

  • 1Faculty of Mathematics and Computer Science, Babeș-Bolyai University, 400084, Cluj-Napoca, Romania.

Scientific Reports
|April 6, 2024
PubMed
Summary

We developed a new algorithm for community detection in directed and weighted networks, outperforming existing methods. This approach efficiently identifies network structures, including hierarchical patterns in brain connectivity.

More Related Videos

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

7.0K

Related Experiment Videos

Last Updated: Jun 29, 2025

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

7.0K

Area of Science:

  • Network analysis
  • Graph theory
  • Computational topology

Background:

  • Community detection is crucial in network analysis but challenging for directed and weighted networks.
  • Existing algorithms struggle with high graph density and diverse link information.
  • Link weights and graph density pose significant challenges for current community detection methods.

Purpose of the Study:

  • To present a novel algorithm for community detection in directed and weighted networks.
  • To generalize Voronoi partitioning for complex network structures.
  • To offer a method that directly uses edge weights representing lengths.

Main Methods:

  • A generalized Voronoi partitioning algorithm applied to directed weighted networks.
  • Direct integration of edge weights, including those representing lengths.
  • Comparative performance analysis against established algorithms on benchmark and real-world networks.

Main Results:

  • The algorithm effectively detects communities in dense graphs where weights are primary.
  • Hierarchical network structures, exemplified by brain connectivity, are successfully identified.
  • Comparable or superior time efficiency to state-of-the-art algorithms was demonstrated.

Conclusions:

  • The proposed Voronoi partitioning algorithm offers an efficient solution for community detection in directed and weighted networks.
  • This method handles complex network data, including length-based weights and hierarchical structures.
  • The algorithm shows promise for applications in neuroscience, transportation, and social network analysis.