# Questions tagged [graphical-model]

Also called Probabilistic Graphical Model, used for statistical models expressed via graphs, causal or not. (Nb, "graph" as in graph theory, *not* as in figure or plot).

485 questions
Filter by
Sorted by
Tagged with
7 views

### Inference on a Gaussian random field / undirected graph?

Assume I have an undirected graph with $D$ nodes, and a $D$-by-$D$ matrix with edge strengths between $0$ (implying conditional indepedence given all other nodes), and $1$ (implying complete ...
• 419
1 vote
46 views

### Question about using potential outcomes in DAGs in real world example

I am trying to understand how DAGs and potential outcomes look together. I came across these excellent posts (here and here, but I am trying to understand how this looks in a real world example. ...
• 19
364 views

### Posterior distribution is impossible depending on which prior hyperparameters are used?

Suppose we randomly select one of two coins and flip it. In that situation we have random variables $\alpha$ and $\delta$, where $\alpha$ tells us which coin we select, and $\delta$ tells us whether ...
• 278
19 views

### Conditional independence in EM algorithm

Let $X$, $\theta$ and $Z$ denote observed, parameter and latent nodes in a graphical model. The EM algorithm attempts to find a local maximum likelihood estimate $\theta^\ast$ for the likelihood of ...
• 212
1 vote
9 views

### Parents in a directed acyclic graph vs a partial ancestral graph

In DAGs, parents are defined as follows: A is a parent of B if 'A -> B' edge is in the graph. In PAGs, there are mixed type of edges, so you can have A -> B, A o-> B. Obviously if A -> B,...
• 153
1 vote
16 views

### Good example of a walk-through of the FCI algorithm to ensure all steps are done

The FCI algorithm is a common algorithm used for learning a Markov equivalence class of causal graphs from observational data. I am wondering if there are any good examples that walk through a causal ...
• 153
42 views

### Algorithm to check if there is an inducing path between two nodes - constructing maximal ancestral graph (MAG) given a DAG

In causal inference, one generally learns a Markov equivalence class of causal graphs when trying to reconstruct causal structure from data. This is known as a maximal ancestral graph (MAG). I am ...
• 153
31 views

### Why do I even need DeepWalk and Node2Vec when I can build a visual graph structure?

While studying DeepWalk, I started wondering why I need "DeepWalk" when I can build a graph from data and visualize the structure of a graph. With a visualized graph, I can see which nodes ...
• 2,585
1 vote
15 views

23 views

### Markov networks which are disconnected

I'm reading Kollers book on PGMs. Some of her examples to show the breaking down of theorems around independencies for non positive distributions involve either empty Markov networks or very sparse ...
• 521
43 views

### How are parameters in graphical models learnt?

This is a request of a good reference. I wanted to have a better understanding of graphical models and I am reading "Pattern recognition and machine learning" of Bishop. chap. 8 (Graphical ...
• 663
41 views

40 views

### Intended selection bias

Sampling or selection bias is often presented as something that has to be overcome, avoided, or at least appropriately considered because it's a problem otherwise. I wonder how often situations arise (...
39 views

### Re-generate the exact underlying data from an exact MRF model or any other PGMs

I was wondering if there exist a way to re-generate the actual underlying data (not a sample!) from a given exactly learned MRF. In other words, lets say I have a discrete factorised joint ...
• 1