Learn R Programming

ggm (version 2.5.1)

Graphical Markov Models with Mixed Graphs

Description

Provides functions for defining mixed graphs containing three types of edges, directed, undirected and bi-directed, with possibly multiple edges. These graphs are useful because they capture fundamental independence structures in multivariate distributions and in the induced distributions after marginalization and conditioning. The package is especially concerned with Gaussian graphical models for (i) ML estimation for directed acyclic graphs, undirected and bi-directed graphs and ancestral graph models (ii) testing several conditional independencies (iii) checking global identification of DAG Gaussian models with one latent variable (iv) testing Markov equivalences and generating Markov equivalent graphs of specific types.

Copy Link

Version

Install

install.packages('ggm')

Monthly Downloads

4,751

Version

2.5.1

License

GPL-2

Issues

Pull Requests

Stars

Forks

Maintainer

Giovanni M Marchetti

Last Published

January 25th, 2024

Functions in ggm (2.5.1)

Max

Maximisation for graphs
Utility Functions

Utility functions
RG

Ribbonless graph
RepMarDAG

Representational Markov equivalence to directed acyclic graphs.
Simple Graph Operations

Simple graph operations
SG

summary graph
UG

Defining an undirected graph (UG)
basiSet

Basis set of a DAG
cmpGraph

The complementary graph
allEdges

All edges of a graph
conComp

Connectivity components
anger

Anger data
blkdiag

Block diagonal matrix
adjMatrix

Adjacency matrix of a graph
binve

Inverts a marginal log-linear parametrization
diagv

Matrix product with a diagonal matrix
blodiag

Block diagonal matrix
edgematrix

Edge matrix of a graph
essentialGraph

Essential graph
checkIdent

Identifiability of a model with one latent variable
drawGraph

Drawing a graph with a simple point and click interface.
fitConGraph

Fitting a Gaussian concentration graph model
fitCovGraph

Fitting of Gaussian covariance graph models
grMAT

Graph to adjacency matrix
findPath

Finding paths
derived

Data on blood pressure body mass and age
fitDag

Fitting of Gaussian DAG models
dSep

d-separation
icf

Iterative conditional fitting
fitAncestralGraph

Fitting of Gaussian Ancestral Graph Models
ggm

The package ggm: summary information
makeMG

Mixed Graphs
bfsearch

Breadth first search
correlations

Marginal and partial correlations
glucose

Glucose control
shipley.test

Test of all independencies implied by a given DAG
marg.param

Link function of marginal log-linear parameterization
cycleMatrix

Fundamental cycles
powerset

Power set
isAcyclic

Graph queries
fitmlogit

Multivariate logistic models
fitDagLatent

Fitting Gaussian DAG models with one latent variable
fundCycles

Fundamental cycles
msep

The m-separation criterion
isADMG

Acyclic directed mixed graphs
isAG

Ancestral graph
rcorr

Random correlation matrix
triDec

Triangular decomposition of a covariance matrix
pcor.test

Test for zero partial association
isGident

G-identifiability of an UG
null

Null space of a matrix
rnormDag

Random sample from a decomposable Gaussian model
surdata

A simulated data set
plotGraph

Plot of a mixed graph
stress

Stress
unmakeMG

Loopless mixed graphs components
rsphere

Random vectors on a sphere
topSort

Topological sort
marks

Mathematics marks
mat.mlogit

Multivariate logistic parametrization
parcor

Partial correlations
swp

Sweep operator
pcor

Partial correlation
transClos

Transitive closure of a graph
InducedGraphs

Graphs induced by marginalization or conditioning
RepMarUG

Representational Markov equivalence to undirected graphs.
RepMarBG

Representational Markov equivalence to bidirected graphs.
MarkEqMag

Markov equivalence of maximal ancestral graphs
MAG

Maximal ancestral graph
MRG

Maximal ribbonless graph
In

Indicator matrix
DAG

Directed acyclic graphs (DAGs)
MarkEqRcg

Markov equivalence for regression chain graphs.
AG

Ancestral graph
DG

Directed graphs
MSG

Maximal summary graph