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

Neural Circuits01:25

Neural Circuits

3.0K
Neural circuits and neuronal pools are two of the main structures found in the nervous system. Neural circuits are networks of neurons that work together to carry out a specific task or process. They consist of interconnected neurons and glial cells, which provide structural and metabolic support.
Neuronal pools are collections of nerve cells with similar functions and interact through chemical and electrical signals. These pools include both interneurons (the central neural circuit nodes that...
3.0K
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

1.5K
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...
1.5K
Survival Tree01:19

Survival Tree

498
Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
 Building a Survival Tree
Constructing a...
498
Multi-input and Multi-variable systems01:22

Multi-input and Multi-variable systems

540
Cruise control systems in cars are designed as multi-input systems to maintain a driver's desired speed while compensating for external disturbances such as changes in terrain. The block diagram for a cruise control system typically includes two main inputs: the desired speed set by the driver and any external disturbances, such as the incline of the road. By adjusting the engine throttle, the system maintains the vehicle's speed as close to the desired value as possible.
In the absence of...
540
Multicompartment Models: Overview01:14

Multicompartment Models: Overview

712
Multicompartment models are mathematical constructs that depict how drugs are distributed and eliminated within the body. They segment the body into several compartments, symbolizing various physiological or anatomical areas connected through drug transfer processes such as absorption, metabolism, distribution, and elimination.
These models offer a more comprehensive representation of drug behavior in the body than one-compartment models. They accommodate the complexity of drug distribution,...
712
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

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

You might also read

Related Articles

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

Sort by
Same author

Recommendations for sharing network data and materials.

Network science (Cambridge University Press)·2025
Same author

Implicit models, latent compression, intrinsic biases, and cheap lunches in community detection.

Physical review. E·2023
Same author

Statistical inference links data and theory in network science.

Nature communications·2022
Same author

Ordered community detection in directed networks.

Physical review. E·2022
Same author

Systematic assessment of the quality of fit of the stochastic block model for empirical networks.

Physical review. E·2022
Same author

Null models for multioptimized large-scale network structures.

Physical review. E·2020

Related Experiment Video

Updated: Apr 25, 2026

Author Spotlight: Advancing Alzheimer's Research – Exploring Early Detection and Multi-Omics Approaches
09:47

Author Spotlight: Advancing Alzheimer's Research – Exploring Early Detection and Multi-Omics Approaches

Published on: December 15, 2023

2.0K

Parsimonious module inference in large networks.

Tiago P Peixoto1

  • 1Institut für Theoretische Physik, Universität Bremen, Hochschulring 18, D-28359 Bremen, Germany.

Physical Review Letters
|August 29, 2014
PubMed
Summary
This summary is machine-generated.

This study introduces a method to detect network modules without knowing their count beforehand. The maximum number of detectable modules scales with the square root of the network size (N).

Related Experiment Videos

Last Updated: Apr 25, 2026

Author Spotlight: Advancing Alzheimer's Research – Exploring Early Detection and Multi-Omics Approaches
09:47

Author Spotlight: Advancing Alzheimer's Research – Exploring Early Detection and Multi-Omics Approaches

Published on: December 15, 2023

2.0K

Area of Science:

  • Network science
  • Statistical physics
  • Data mining

Background:

  • Detecting community structures in large networks is challenging, especially when the number of modules is unknown.
  • Traditional methods may struggle with scalability and accuracy in complex network analysis.

Purpose of the Study:

  • To develop a principled approach for identifying network modules irrespective of their quantity.
  • To establish theoretical bounds on module detectability in large networks.
  • To introduce an efficient algorithm for module inference.

Main Methods:

  • Employing the Minimum Description Length (MDL) principle to balance model complexity and data fit, thus preventing overfitting.
  • Deriving general bounds for the detectability of block structures based on network size (N) and number of edges.
  • Developing a multilevel Monte Carlo inference algorithm with computational complexity dependent on whether the number of blocks is known.

Main Results:

  • Established general bounds on the detectability of block structures in networks.
  • Demonstrated that the maximum number of detectable modules scales as the square root of the number of nodes (√N) for a fixed average degree.
  • Developed an efficient inference algorithm with O(τN log N) complexity when the number of blocks is unknown and O(τN) when known.

Conclusions:

  • The MDL principle provides a robust framework for network module detection, even with an unknown number of modules.
  • The derived scaling law (√N) offers crucial insights into the limits of community detection in large-scale networks.
  • The efficient algorithm facilitates practical application in analyzing large, real-world networks.