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

Bootstrapping01:24

Bootstrapping

785
The term "bootstrap" originated in the 19th century as a metaphor for self-improvement or achieving something independently, without external assistance. This concept extends to statistical bootstrapping, a self-contained method for estimating population parameters through resampling, even though it can be computationally intensive. Developed by the American statistician Dr. Bradley Efron in 1979, bootstrapping provides a robust way to perform inference when the original sample size is...
785
Entropy Change in Reversible Processes01:10

Entropy Change in Reversible Processes

2.4K
In the Carnot engine, which achieves the maximum efficiency between two reservoirs of fixed temperatures, the total change in entropy is zero. The observation can be generalized by considering any reversible cyclic process consisting of many Carnot cycles. Thus, it can be stated that the total entropy change of any ideal reversible cycle is zero.
The statement can be further generalized to prove that entropy is a state function. Take a cyclic process between any two points on a p-V diagram.
2.4K
Probability in Statistics01:14

Probability in Statistics

18.6K
Probability is the likelihood of an event occurring. The term event is defined as a collection of results of a procedure. An event is a simple event when an outcome cannot be divided into simpler parts.
An example of a simple event is a coin toss. The result of a coin toss is either a head or a tail. Here, head and tail are two simple events. These two simple events make up the sample space. Further, the probability of an event occurring falls within the range of 0 to 1. The probability of an...
18.6K
Binomial Probability Distribution01:15

Binomial Probability Distribution

13.1K
A binomial distribution is a probability distribution for a procedure with a fixed number of trials, where each trial can have only two outcomes.
The outcomes of a binomial experiment fit a binomial probability distribution. A statistical experiment can be classified as a binomial experiment if the following conditions are met:
There are a fixed number of trials. Think of trials as repetitions of an experiment. The letter n denotes the number of trials.
There are only two possible outcomes,...
13.1K
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

438
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...
438
Multimachine Stability01:25

Multimachine Stability

677
Multimachine stability analysis is crucial for understanding the dynamics and stability of power systems with multiple synchronous machines. The objective is to solve the swing equations for a network of M machines connected to an N-bus power system.
In analyzing the system, the nodal equations represent the relationship between bus voltages, machine voltages, and machine currents. The nodal equation is given by:
677

You might also read

Related Articles

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

Sort by
Same author

[Kinase-Glo luminescent kinase assay for in vitro determination of PKA activity].

Xi bao yu fen zi mian yi xue za zhi = Chinese journal of cellular and molecular immunology·2012
Same author

Functional characterization of an arrestin gene on insecticide resistance of Culex pipiens pallens.

Parasites & vectors·2012
Same author

MiR-23a inhibits myogenic differentiation through down regulation of fast myosin heavy chain isoforms.

Experimental cell research·2012
Same author

Let-7b inhibits human cancer phenotype by targeting cytochrome P450 epoxygenase 2J2.

PloS one·2012
Same author

Role of IKK/NF-κB signaling in extinction of conditioned place aversion memory in rats.

PloS one·2012
Same author

Inhibition of poly(ADP-ribose) polymerase attenuates acute kidney injury in sodium taurocholate-induced acute pancreatitis in rats.

Pancreas·2012

Related Experiment Video

Updated: Apr 26, 2026

Structure-Based Simulation and Sampling of Transcription Factor Protein Movements along DNA from Atomic-Scale Stepping to Coarse-Grained Diffusion
09:17

Structure-Based Simulation and Sampling of Transcription Factor Protein Movements along DNA from Atomic-Scale Stepping to Coarse-Grained Diffusion

Published on: March 1, 2022

2.5K

Bootstrapping on undirected binary networks via statistical mechanics.

Hsieh Fushing1, Chen Chen2, Shan-Yu Liu3

  • 1Department of Statistics, University of California, Davis, 1 Shields Ave, Davis, CA 95616 fhsieh@ucdavis.edu.

Journal of Statistical Physics
|July 30, 2014
PubMed
Summary
This summary is machine-generated.

This study introduces a novel statistical mechanics approach to analyze network geometry and community structure. The method extracts network information and generates conforming random networks, estimating their complexity evolution.

Keywords:
BootstrappingParisi matrixbinary network

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.7K
Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline
10:44

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline

Published on: December 7, 2021

1.7K

Related Experiment Videos

Last Updated: Apr 26, 2026

Structure-Based Simulation and Sampling of Transcription Factor Protein Movements along DNA from Atomic-Scale Stepping to Coarse-Grained Diffusion
09:17

Structure-Based Simulation and Sampling of Transcription Factor Protein Movements along DNA from Atomic-Scale Stepping to Coarse-Grained Diffusion

Published on: March 1, 2022

2.5K
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.7K
Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline
10:44

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline

Published on: December 7, 2021

1.7K

Area of Science:

  • Network science
  • Statistical mechanics
  • Complex systems

Background:

  • Extracting geometric information from complex networks is challenging.
  • Understanding multiscale community structure is key to network analysis.

Purpose of the Study:

  • To develop a novel method for extracting geometric information from undirected binary networks.
  • To generate random networks that conform to the extracted geometry.
  • To estimate the evolution of network complexity.

Main Methods:

  • Perceiving networks as thermodynamic systems.
  • Reformulating network information extraction as a combinatorial optimization problem.
  • Applying temperature-regulated Markov chains to establish ultrametric geometry.
  • Utilizing Parisi adjacency matrices for optimization.
  • Generating ensembles of random networks based on macrostate.

Main Results:

  • Established an ultrametric geometry with tree hierarchy capturing multiscale community structure.
  • Developed a method to translate network geometry into an optimized Parisi adjacency matrix.
  • Generated ensembles of random networks conforming to the network's macrostate.
  • Provided a method to compute evolution entropy and estimate network complexity.

Conclusions:

  • The proposed method effectively extracts geometric information and community structure from networks.
  • The approach allows for the generation of representative random networks.
  • The method enables the estimation of network complexity evolution across different scales.