Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support

The Chain Graph Markov Property

Morten Frydenberg
Scandinavian Journal of Statistics
Vol. 17, No. 4 (1990), pp. 333-353
Stable URL: http://www.jstor.org/stable/4616181
Page Count: 21
  • Read Online (Free)
  • Download ($12.00)
  • Subscribe ($19.50)
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
The Chain Graph Markov Property
Preview not available

Abstract

A new class of graphs, chain graphs, suitable for modelling conditional independencies are introduced and their Markov properties investigated. This class of graphs, which includes the undirected and directed acyclic graphs, which includes the undirected and directed acyclic graphs, enables modelling recursive models with multivariate response variables. Results concerning the equivalence of different definitions of their Markov properties including a factorization of the density are shown. Finally we give a necessary and sufficient condition for two chain graphs to have the same Markov properties.

Page Thumbnails

  • Thumbnail: Page 
[333]
    [333]
  • Thumbnail: Page 
334
    334
  • Thumbnail: Page 
335
    335
  • Thumbnail: Page 
336
    336
  • Thumbnail: Page 
337
    337
  • Thumbnail: Page 
338
    338
  • Thumbnail: Page 
339
    339
  • Thumbnail: Page 
340
    340
  • Thumbnail: Page 
341
    341
  • Thumbnail: Page 
342
    342
  • Thumbnail: Page 
343
    343
  • Thumbnail: Page 
344
    344
  • Thumbnail: Page 
345
    345
  • Thumbnail: Page 
346
    346
  • Thumbnail: Page 
347
    347
  • Thumbnail: Page 
348
    348
  • Thumbnail: Page 
349
    349
  • Thumbnail: Page 
350
    350
  • Thumbnail: Page 
351
    351
  • Thumbnail: Page 
352
    352
  • Thumbnail: Page 
353
    353