Undirected graph
Definition taught in Graphical models, part of Statistical learning
Undirected graph
| Type | Definition |
| Taught in | Graphical models |
| Part | Statistical learning |
| Questions using it | 3 |
A graph G=(V,E) is a set of vertices, or nodes, V along with a set of edges E\subseteq V\times V joining pairs of vertices. Self-edges are excluded, and only undirected edges are considered: (j,k)\in E implies (k,j)\in E. Edges are listed in any convenient order of the pair, with the reverse understood to be present.
Used in
- Taught in Graphical models, where the derivation and examples are.
- Also used in Classes, recurrence, and reversibility
- Questions that use it (3) — How many graphs? · A tempting wrong turn (answer) · Read a Gaussian graphical model
- All 8 questions on Graphical models
See also
Hammersley–Clifford · A zero precision entry is conditional independence · Maximum likelihood for a known graph · Graphical lasso · Markov graphs · Graph terminology · Conditional independence · Markov properties and factorisation