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

Rigid Body Equilibrium Problems - II01:21

Rigid Body Equilibrium Problems - II

8.2K
A rigid body is in static equilibrium when the net force and the net torque acting on the system are equal to zero.
Consider two children sitting on a seesaw, which has negligible mass. The first child has a mass (m1) of 26 kg and sits at point A, which is 1.6 meters (r1) from the pivot point B; the second child has a mass (m2) of 32 kg and sits at point C. How far from the pivot point B should the second child sit (r2) to balance the seesaw?
8.2K
Rigid Body Equilibrium Problems - I00:49

Rigid Body Equilibrium Problems - I

5.7K
A rigid body is said to be in static equilibrium when the net force and the net torque acting on the system is equal to zero. To solve for rigid body equilibrium problems, do the following steps.
5.7K
Virtual Work for a System of Connected Rigid Bodies01:06

Virtual Work for a System of Connected Rigid Bodies

857
Virtual work is a powerful method used to solve problems involving several connected rigid bodies. When the system is in equilibrium, virtual work is zero. This allows the calculation of the resulting forces when a system undergoes a virtual displacement. When attempting to analyze such a system, first, use a free-body diagram, where an independent coordinate represents the configuration of the links, and mark its deflected position resulting from the positive virtual displacement.
Next,...
857
Planar Rigid-Body Motion01:22

Planar Rigid-Body Motion

1.4K
Understanding the movement of a rigid body in planar motion involves recognizing that every particle within this body is traversing a path that maintains a consistent distance from a specific plane. This concept is fundamental in the study of physics and mechanical engineering, and it allows us to comprehend better how objects move in space.
Planar motion is typically divided into three distinct categories. The first is rectilinear translation, demonstrated by a subway train that moves along...
1.4K
Velocity and Position by Graphical Method01:34

Velocity and Position by Graphical Method

11.2K
Velocity and position can be calculated from the known function of acceleration as a function of time. The total area under the acceleration-time graph and the velocity-time graph gives the change in velocity and position, respectively. In the case of an airplane, its acceleration is tracked using the inertial navigation system. The pilot provides the input of the airplane's initial position and velocity before takeoff. The inertial navigation system then uses the acceleration data to...
11.2K
Relation between Poisson's ratio, Modulus of Elasticity and Modulus of Rigidity01:15

Relation between Poisson's ratio, Modulus of Elasticity and Modulus of Rigidity

774
Deformation occurs in axial and transverse directions when an axial load is applied to a slender bar. This deformation impacts the cubic element within the bar, transforming it into either a rectangular parallelepiped or a rhombus, contingent on its orientation. This transformation process induces shearing strain. Axial loading elicits both shearing and normal strains. Applying an axial load instigates equal normal and shearing stresses on elements oriented at a 45° angle to the load axis.
774

You might also read

Related Articles

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

Sort by
Same author

Quantifying the Peripheral Surface Information Entropy from Conformational Ensembles of Globular Protein-Peptide Complexes.

Biophysical journal·2026
Same author

<i>Ab initio</i> gene prediction for protein-coding regions.

Bioinformatics advances·2023
Same author

Protein Function Analysis through Machine Learning.

Biomolecules·2022
Same author

Functional Dynamics of Substrate Recognition in TEM Beta-Lactamase.

Entropy (Basel, Switzerland)·2022
Same author

Victory Tax: A Holistic Income Tax System.

Entropy (Basel, Switzerland)·2021
Same author

JEDi: java essential dynamics inspector - a molecular trajectory analysis toolkit.

BMC bioinformatics·2021
Same journal

Haplotype-aware long-read error correction.

Algorithms for molecular biology : AMB·2026
Same journal

Extension of partial atom-to-atom maps: uniqueness and algorithms.

Algorithms for molecular biology : AMB·2026
Same journal

Lossless pangenome indexing using tag arrays.

Algorithms for molecular biology : AMB·2026
Same journal

Dolphyin: a combinatorial algorithm for identifying 1-Dollo phylogenies in cancer.

Algorithms for molecular biology : AMB·2026
Same journal

Probing transcription factor subsets in gene regulatory networks.

Algorithms for molecular biology : AMB·2026
Same journal

Comparing the ability of embedding methods on metabolic hypergraphs for capturing taxonomy-based features.

Algorithms for molecular biology : AMB·2026
See all related articles

Related Experiment Video

Updated: Apr 14, 2026

Soft Pneumatic Robot Modulates Graph Theory Metrics of Brain Network for Hand Rehabilitation After Stroke
05:30

Soft Pneumatic Robot Modulates Graph Theory Metrics of Brain Network for Hand Rehabilitation After Stroke

Published on: October 10, 2025

622

A virtual pebble game to ensemble average graph rigidity.

Luis C González1, Hui Wang2, Dennis R Livesay3

  • 1Department of Bioinformatics and Genomics, University of North Carolina at Charlotte, Charlotte, NC 28223 USA ; Current address: Facultad de Ingeniería, Universidad Autónoma de Chihuahua, Circuito No. 1, Campus Universitario 2, Chihuahua, Chih, CP 31125 Mexico.

Algorithms for Molecular Biology : AMB
|April 24, 2015
PubMed
Summary
This summary is machine-generated.

The Virtual Pebble Game (VPG) algorithm offers a faster and pragmatic approach to analyzing protein and polymer network rigidity. It accurately estimates average network properties, bridging the gap between speed and accuracy in computational methods.

Keywords:
Constraint countingConstraint topologiesEffective mediumGraph rigidityMean field approximationPebble gameProbability flowProtein flexibilityProtein stability

More Related Videos

Calculating Heart Rate Variability from ECG Data from Youth with Cerebral Palsy During Active Video Game Sessions
08:12

Calculating Heart Rate Variability from ECG Data from Youth with Cerebral Palsy During Active Video Game Sessions

Published on: June 5, 2019

20.7K
Generating Strictly Controlled Stimuli for Figure Recognition Experiments
05:39

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

5.7K

Related Experiment Videos

Last Updated: Apr 14, 2026

Soft Pneumatic Robot Modulates Graph Theory Metrics of Brain Network for Hand Rehabilitation After Stroke
05:30

Soft Pneumatic Robot Modulates Graph Theory Metrics of Brain Network for Hand Rehabilitation After Stroke

Published on: October 10, 2025

622
Calculating Heart Rate Variability from ECG Data from Youth with Cerebral Palsy During Active Video Game Sessions
08:12

Calculating Heart Rate Variability from ECG Data from Youth with Cerebral Palsy During Active Video Game Sessions

Published on: June 5, 2019

20.7K
Generating Strictly Controlled Stimuli for Figure Recognition Experiments
05:39

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

5.7K

Area of Science:

  • Computational chemistry and biophysics
  • Materials science and polymer physics

Background:

  • The Pebble Game (PG) algorithm is standard for protein and polymer network rigidity analysis.
  • Current methods average PG results over many simulations to capture fluctuating interactions.
  • Maxwell Constraint Counting (MCC) offers a fast but less accurate approximation.

Purpose of the Study:

  • Introduce the Virtual Pebble Game (VPG) algorithm as a novel method for network rigidity analysis.
  • Develop a computationally efficient alternative to ensemble averaging in PG calculations.
  • Provide a more accurate rigidity estimation than MCC while maintaining computational feasibility.

Main Methods:

  • The VPG algorithm is a Mean Field Approximation (MFA) that preserves spatial inhomogeneity of constraints.
  • It replaces discrete constraint realizations with probabilities, mapping PG's integer counts to continuous probabilities.
  • VPG is isomorphic to PG, with edges assigned capacities and pebble movement as probability flow.

Main Results:

  • VPG quantitatively estimates ensemble-averaged PG results effectively across proteins and disordered lattices.
  • The algorithm successfully suppresses network fluctuations by using constraint probabilities.
  • VPG demonstrates strong correlation with average PG outcomes.

Conclusions:

  • VPG is approximately 20% faster than a single PG run.
  • It serves as a practical alternative to computationally intensive ensemble averaging of PG rigidity.
  • VPG's accuracy and speed position it between MCC and full ensemble averaging.