Related Experiment Video
Updated: Jun 16, 2026

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
Published on: March 18, 2019
Enumerating the decomposable neighbours of a decomposable graph under a simple perturbation scheme
1Department of Biomedical Informatics, University of Utah.
None:
Given a decomposable graph, we characterize and enumerate the set of pairs of vertices whose connection or disconnection results in a new graph that is also decomposable. We discuss the relevance of this results to Markov chain Monte Carlo methods that sample or optimize over the space of decomposable graphical models according to probabilities determined by a posterior distribution given observed multivariate data.
Related Concept Videos
Extended Versions of Green’s Theorem
Woodward–Hoffmann Selection Rules and Microscopic Reversibility
Green’s Theorem
Block Diagram Reduction
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
Graphical Representation of Inequalities
Graphs of Functions