Draw an undirected graph based on presicion matrix to present connection among variables.

1 2 3 | ```
graph.pattern(mat, main = NULL, edge.color = "gray50",
vertex.color = "red", vertex.size = 3, vertex.label = NA,
thres = 1e-05)
``` |

`mat` |
precision matrix that encodes information of graph struture. |

`main` |
main title of graph. Default is |

`edge.color` |
color of edge. Default is |

`vertex.color` |
color of vertex. Default is |

`vertex.size` |
size of vertex. Default is 3. |

`vertex.label` |
label of vertex. Default is |

`thres` |
thresholding level of substituting entry with zero,
set entry to zero if its absolute value equals or is less than |

This function generates an udirected graph based on precision matrix. If an entry is zero, then no edge connects corresponding pair of nodes.

A plot of undirected graph.

Will Wei Sun, Zhaoran Wang, Xiang Lyu, Han Liu, Guang Cheng.

1 2 3 | ```
graph.pattern(ChainOmega(5, sd = 13))
# a triangle graph
``` |

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

All documentation is copyright its authors; we didn't write any of that.