Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Block Diagram Reduction

Block Diagram Reduction

The process of deriving the transfer function of a control system often involves reducing its block diagram to a single block. This simplification can be achieved through a series of strategic operations, including relocating branch points and comparators. These operations preserve the overall function of the system while allowing for easier manipulation and combination of blocks.
The first step in this process is the identification and relocation of a branch point. A branch point, where a...

Graphs of Functions

Graphs of Functions

Graphs of functions provide a visual representation of how output values change in response to varying inputs. Each point on the graph corresponds to an ordered pair, where the x-coordinate (independent variable) determines the horizontal position and the y-coordinate (dependent variable) determines the vertical position. Linear functions like y = x give a straight line, indicating a constant rate of change.Nonlinear functions display more complex behaviors. Even power functions generate...

Graphical Representation of Inequalities

Graphical Representation of Inequalities

The graph of the equation where y equals x squared forms a curve known as a parabola. This curve acts as a boundary in the coordinate plane, dividing it into distinct regions based on the relative position of points.When the equality sign in the equation is replaced with an inequality—such as greater than, less than, greater than or equal to, or less than or equal to—the graphical representation changes from a single curve into a broader shaded area that signifies the set of all points...

Graphs of Equations in Two Variables

Graphs of Equations in Two Variables

An equation with two variables, typically written in the form y = f(x) or Ax + By = C, describes a relationship between quantities represented by x and y. Each solution to such an equation is an ordered pair (x, y) that satisfies the equation when substituted. These pairs can be represented graphically to understand the variables' relationship visually.A common technique for constructing the graph of a two-variable equation is to create a value table. Begin by choosing several values for the...

Vector Algebra: Graphical Method

Vector Algebra: Graphical Method

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

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

Electrocyclic reactions, cycloadditions, and sigmatropic rearrangements are concerted pericyclic reactions that proceed via a cyclic transition state. These reactions are stereospecific and regioselective. The stereochemistry of the products depends on the symmetry characteristics of the interacting orbitals and the reaction conditions. Accordingly, pericyclic reactions are classified as either symmetry-allowed or symmetry-forbidden. Woodward and Hoffmann presented the selection criteria for...

You might also read

Related Articles

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

Sort by

Same author

Calculating the Probability that a Previously Susceptible Individual is Infected as a Function of Time Following Exposure to SARS-CoV-2.

Infectious diseases and therapy·2026

Same author

Molecular features unique to circulating tumor DNA enable the tumor-naïve liquid biopsy of glioblastoma.

NPJ precision oncology·2026

Same author

When two plus four does not equal six: Combining computational and functional evidence to classify BRCA1 key domain missense substitutions.

American journal of human genetics·2025

Same author

Conserved noncoding cis elements associated with hibernation modulate metabolic and behavioral adaptations in mice.

Science (New York, N.Y.)·2025

Same author

When Two plus Four Does Not Equal Six: Combining Computational and Functional Evidence to Classify BRCA1 Key Domain Missense Substitutions.

medRxiv : the preprint server for health sciences·2025

Same author

Conserved Noncoding Cis-Elements Associated with Hibernation Modulate Metabolic and Behavioral Adaptations in Mice.

bioRxiv : the preprint server for biology·2024

Search research articles

Related Experiment Video

Updated: Jun 7, 2026

Tree Core Analysis with X-ray Computed Tomography

Tree Core Analysis with X-ray Computed Tomography

Published on: September 22, 2023

Enumerating the junction trees of a decomposable graph.

Alun Thomas¹, Peter J Green

¹Department of Biomedical Informatics, University of Utah.

Journal of Computational and Graphical Statistics : a Joint Publication of American Statistical Association, Institute of Mathematical Statistics, Interface Foundation of North America

|October 29, 2010

Summary

This summary is machine-generated.

This study presents methods for counting junction tree representations of decomposable graphs. It includes an algorithm for randomly generating junction trees, useful for graphical models and conditional independence graphs.

Related Experiment Videos

Last Updated: Jun 7, 2026

Tree Core Analysis with X-ray Computed Tomography

Tree Core Analysis with X-ray Computed Tomography

Published on: September 22, 2023

Area of Science:

Graph theory
Computational statistics
Machine learning

Background:

Junction trees are essential for representing decomposable graphs in probabilistic graphical models.
Efficient enumeration and random sampling of these representations are crucial for advanced statistical inference.

Purpose of the Study:

To develop methods for enumerating distinct junction tree representations of decomposable graphs.
To provide an algorithm for uniformly random generation of junction trees from a given graph.
To explore the application of these methods in estimating conditional independence graphs.

Main Methods:

Derivation of combinatorial methods for enumerating junction trees.
Development of a randomized algorithm for generating junction trees.
Application of these techniques to the domain of graphical models.

Main Results:

Novel methods for enumerating all unique junction tree structures for a given decomposable graph.
An efficient algorithm capable of generating a random junction tree representation from the set of all possible trees for a graph.
Demonstrated relevance to the estimation of conditional independence graphs.

Conclusions:

The developed methods provide a foundational tool for analyzing and manipulating junction tree representations.
The random generation algorithm facilitates sampling-based approaches in graphical model inference.
These advancements contribute to a deeper understanding of graphical model structure and estimation.