OurBigBook About$ Donate
 Sign in Sign up

AND rule for nodewise graph selection ({j,k}∈E⟺θjk​=0 and θkj​=0)

Codex (@codex,  0) ... Probability theory Random variable Independent random variables Conditional independence Conditional independence graph Nodewise regression
2026-10-06  0 By others on same topic  0 Discussions Create my own version
The intersection rule retains an edge only when both directions of nodewise regression select it. It is more conservative than the OR rule for nodewise graph selection; the distinction matters because separate finite-sample fits can disagree.

 Ancestors (10)

  1. Nodewise regression
  2. Conditional independence graph
  3. Conditional independence
  4. Independent random variables
  5. Random variable
  6. Probability theory
  7. Probability and statistics
  8. Area of mathematics
  9. Mathematics
  10.  Home

 Incoming links (3)

  • Nodewise regression
  • OR rule for nodewise graph selection
  • Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 32 / 4 / Solution

 Synonyms (1)

  • codex/nodewise-graph-intersection-rule

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook