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

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

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

Model Approaches for Pharmacokinetic Data: Distributed Parameter Models

151
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...
151
Exponential Equations for Modeling Growth02:33

Exponential Equations for Modeling Growth

12
Exponential models are essential for describing rapid, multiplicative changes in natural systems, such as population growth. When a population doubles at regular intervals, the process can be modeled using a suitable base. For instance, a bacterial culture that doubles every three hours follows the model n(t)=n0⋅2t/3, where n(t) is the population at the time t.A more general model uses the natural base e, especially for continuous growth. This takes the form n(t)=n0⋅ert, where r is...
12
Parametric Survival Analysis: Weibull and Exponential Methods01:14

Parametric Survival Analysis: Weibull and Exponential Methods

729
Parametric survival analysis models survival data by assuming a specific probability distribution for the time until an event occurs. The Weibull and exponential distributions are two of the most commonly used methods in this context, due to their versatility and relatively straightforward application.
Weibull Distribution
The Weibull distribution is a flexible model used in parametric survival analysis. It can handle both increasing and decreasing hazard rates, depending on its shape parameter...
729
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

824
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...
824
Poisson Probability Distribution01:09

Poisson Probability Distribution

10.4K
A Poisson probability distribution is a discrete probability distribution. It gives the probability of a number of events occurring in a fixed interval of time or space if these events happen at a known average rate and independently of the time since the last event. For example, a book editor might be interested in the number of words spelled incorrectly in a particular book. It might be that, on average, there are five words spelled incorrectly in 100 pages. The interval is 100 pages.
The...
10.4K

You might also read

Related Articles

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

Sort by
Same author

Emerging robotic platforms in gynecologic surgery: a systematic review.

Journal of robotic surgery·2026
Same author

ASO Visual Abstract: Predictive Features Specific to FIGO IIIA1 Ovarian Cancer: What Drives Prognosis.

Annals of surgical oncology·2026
Same author

Predictive Features Specific to FIGO IIIA1 Ovarian Cancer: What Drives Prognosis.

Annals of surgical oncology·2026
Same author

Gynecologic Malignancies in Obstructed Hemivagina and Ipsilateral Renal Anomaly (OHVIRA) Syndrome: A Systematic Review.

Journal of clinical medicine·2026
Same author

Inferring firm-level supply chain networks with realistic systemic risk from industry sector-level data.

Scientific reports·2026
Same author

Use of uterine manipulators in endometrial cancer surgery: Balancing benefits and uncertainties.

European journal of surgical oncology : the journal of the European Society of Surgical Oncology and the British Association of Surgical Oncology·2026

Related Experiment Video

Updated: Oct 26, 2025

A Simple Stimulatory Device for Evoking Point-like Tactile Stimuli: A Searchlight for LFP to Spike Transitions
07:34

A Simple Stimulatory Device for Evoking Point-like Tactile Stimuli: A Searchlight for LFP to Spike Transitions

Published on: March 25, 2014

10.0K

Fast and scalable likelihood maximization for Exponential Random Graph Models with local constraints.

Nicolò Vallarano1, Matteo Bruno1, Emiliano Marchese1

  • 1IMT School for Advanced Studies Lucca, P.zza San Francesco 19, 55100, Lucca, Italy.

Scientific Reports
|July 28, 2021
PubMed
Summary

Exponential Random Graph Models (ERGMs) are crucial for network analysis. A new fixed-point recipe offers faster, scalable solutions for large networks compared to traditional methods like Newton's.

More Related Videos

Using Three-color Single-molecule FRET to Study the Correlation of Protein Interactions
11:22

Using Three-color Single-molecule FRET to Study the Correlation of Protein Interactions

Published on: January 30, 2018

10.3K
A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types
12:39

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types

Published on: December 10, 2012

11.5K

Related Experiment Videos

Last Updated: Oct 26, 2025

A Simple Stimulatory Device for Evoking Point-like Tactile Stimuli: A Searchlight for LFP to Spike Transitions
07:34

A Simple Stimulatory Device for Evoking Point-like Tactile Stimuli: A Searchlight for LFP to Spike Transitions

Published on: March 25, 2014

10.0K
Using Three-color Single-molecule FRET to Study the Correlation of Protein Interactions
11:22

Using Three-color Single-molecule FRET to Study the Correlation of Protein Interactions

Published on: January 30, 2018

10.3K
A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types
12:39

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types

Published on: December 10, 2012

11.5K

Area of Science:

  • Network Science
  • Statistical Physics
  • Computational Statistics

Background:

  • Exponential Random Graph Models (ERGMs) are increasingly popular for network reconstruction and pattern detection.
  • ERGMs are rooted in statistical physics and involve two optimization steps: maximizing Shannon entropy and then likelihood.
  • Solving ERGMs involves complex systems of non-linear equations, facing challenges in accuracy, speed, and scalability.

Purpose of the Study:

  • To address the accuracy, speed, and scalability issues in solving Exponential Random Graph Models.
  • To compare the performance of three distinct algorithms for ERGM parameter estimation.
  • To identify the most efficient algorithm for different network sizes.

Main Methods:

  • Comparison of Newton's method, a quasi-Newton method, and a novel fixed-point recipe.
  • Application of algorithms to various ERGMs with binary and weighted constraints (directed and undirected).
  • Evaluation of algorithm performance based on accuracy, speed, and scalability for different network sizes.

Main Results:

  • Newton's method is effective for smaller networks.
  • The fixed-point recipe demonstrates superior performance for large-scale networks.
  • The fixed-point recipe achieves convergence within seconds for networks with hundreds of thousands of nodes.

Conclusions:

  • The fixed-point recipe is the preferred method for analyzing large, complex networks using ERGMs.
  • Algorithm choice significantly impacts the efficiency of ERGM analysis.
  • The study provides practical insights and accompanying code for efficient ERGM computation.