Graduate Thesis Or Dissertation

 

Spatial graphical models with discrete and continuous components Public Deposited

Downloadable Content

Download PDF
https://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/9k41zh78v

Descriptions

Attribute NameValues
Creator
Abstract
  • Graphical models use Markov properties to establish associations among dependent variables. To estimate spatial correlation and other parameters in graphical models, the conditional independences and joint probability distribution of the graph need to be specified. We can rely on Gaussian multivariate models to derive the joint distribution when all the nodes of the graph are assumed to be normally distributed. However, when some of the nodes are discrete, the Gaussian model no longer affords an appropriate joint distribution function. We develop methods specifying the joint distribution of a chain graph with both discrete and continuous components, with spatial dependencies assumed among all variables on the graph. We propose a new group of chain graphs known as the generalized tree networks. Constructing the chain graph as a generalized tree network, we partition its joint distributions according to the maximal cliques. Copula models help us to model correlation among discrete variables in the cliques. We examine the method by analyzing datasets with simulated Gaussian and Bernoulli Markov random fields, as well as with a real dataset involving household income and election results. Estimates from the graphical models are compared with those from spatial random effects models and multivariate regression models.
License
Resource Type
Date Available
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Publisher
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Julie Kurtz(julie.kurtz@oregonstate.edu) on 2012-09-18T15:47:02Z (GMT) No. of bitstreams: 3 license_rdf: 23457 bytes, checksum: 4a5c7b919ee3cd4f4b33a0bb0951de6b (MD5) license_text: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) CheXuan2012.pdf: 3434681 bytes, checksum: fc8209c2f956bc7d2399b76a233dcbfb (MD5)
  • description.provenance : Submitted by Xuan Che (chex@onid.orst.edu) on 2012-09-14T18:30:11Z No. of bitstreams: 3 license_rdf: 23457 bytes, checksum: 4a5c7b919ee3cd4f4b33a0bb0951de6b (MD5) license_text: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) CheXuan2012.pdf: 3434681 bytes, checksum: fc8209c2f956bc7d2399b76a233dcbfb (MD5)
  • description.provenance : Approved for entry into archive by Laura Wilson(laura.wilson@oregonstate.edu) on 2012-09-18T20:45:30Z (GMT) No. of bitstreams: 3 license_rdf: 23457 bytes, checksum: 4a5c7b919ee3cd4f4b33a0bb0951de6b (MD5) license_text: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) CheXuan2012.pdf: 3434681 bytes, checksum: fc8209c2f956bc7d2399b76a233dcbfb (MD5)
  • description.provenance : Made available in DSpace on 2012-09-18T20:45:30Z (GMT). No. of bitstreams: 3 license_rdf: 23457 bytes, checksum: 4a5c7b919ee3cd4f4b33a0bb0951de6b (MD5) license_text: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) CheXuan2012.pdf: 3434681 bytes, checksum: fc8209c2f956bc7d2399b76a233dcbfb (MD5) Previous issue date: 2012-08-16

Relationships

Parents:

This work has no parents.

In Collection:

Items