ggm

Ancestral graph

Directed acyclic graphs (DAGs)

Directed graphs

Indicator matrix

Graphs induced by marginalization or conditioning

Maximal ancestral graph

Maximal ribbonless graph

Maximal summary graph

Markov equivalence of maximal ancestral graphs

Markov equivalence for regression chain graphs.

Maximisation for graphs

Ribbonless graph

Representational Markov equivalence to bidirected graphs.

Representational Markov equivalence to directed acyclic graphs.

Representational Markov equivalence to undirected graphs.

summary graph

Simple graph operations

Defining an undirected graph (UG)

Utility functions

Adjacency matrix of a graph

All edges of a graph

Anger data

Basis set of a DAG

Breadth first search

Inverts a marginal log-linear parametrization

Block diagonal matrix

Block diagonal matrix

Identifiability of a model with one latent variable

The complementary graph

Connectivity components

Marginal and partial correlations

Fundamental cycles

d-separation

Data on blood pressure body mass and age

Matrix product with a diagonal matrix

Drawing a graph with a simple point and click interface.

Edge matrix of a graph

Essential graph

Finding paths

Fitting of Gaussian Ancestral Graph Models

Fitting a Gaussian concentration graph model

Fitting of Gaussian covariance graph models

Fitting of Gaussian DAG models

Fitting Gaussian DAG models with one latent variable

Multivariate logistic models

Fundamental cycles

The package ggm: summary information

Glucose control

Graph to adjacency matrix

Iterative conditional fitting

Acyclic directed mixed graphs

Ancestral graph

Graph queries

G-identifiability of an UG

Mixed Graphs

Link function of marginal log-linear parameterization

Mathematics marks

Multivariate logistic parametrization

The m-separation criterion

Null space of a matrix

Partial correlations

Partial correlation

Test for zero partial association

Plot of a mixed graph

Power set

Random correlation matrix

Random sample from a decomposable Gaussian model

Random vectors on a sphere

Test of all independencies implied by a given DAG

Stress

A simulated data set

Sweep operator

Topological sort

Transitive closure of a graph

Triangular decomposition of a covariance matrix

Loopless mixed graphs components