1. NCCU Academic Hub
  2. 學術產出
  3. 商學院
  4. 期刊論文
  5. Item

學術產出-期刊論文

文章檢視/開啟

書目匯出

Google ScholarTM

政大圖書館

引文資訊

TAIR相關學術產出

題名 On compatibility of discrete full conditional distributions: A graphical representation approach
作者 姚怡慶;陳世傑;王紹宣
Yao, Yi-Ching ; Chen, Shih-chieh ; Wang, Shao-Hsuan
貢獻者 統計系
關鍵詞 Connected graph; Full conditional; Graph theory; Spanning tree
日期 2014.02
上傳時間 21-三月-2014 16:39:48 (UTC+8)
摘要 To deal with the compatibility issue of full conditional distributions of a (discrete) random vector, a graphical representation is introduced where a vertex corresponds to a configuration of the random vector and an edge connects two vertices if and only if the ratio of the probabilities of the two corresponding configurations is specified through one of the given full conditional distributions. Compatibility of the given full conditional distributions is equivalent to compatibility of the set of all specified probability ratios (called the ratio set) in the graphical representation. Characterizations of compatibility of the ratio set are presented. When the ratio set is compatible, the family of all probability distributions satisfying the specified probability ratios is shown to be the set of convex combinations of k probability distributions where k is the number of components of the underlying graph.
關聯 Journal of Multivariate Analysis, 124, 1-9
資料來源 http://dx.doi.org/10.1016/j.jmva.2013.10.007
資料類型 article
DOI http://dx.doi.org/10.1016/j.jmva.2013.10.007
dc.contributor 統計系en_US
dc.creator (作者) 姚怡慶;陳世傑;王紹宣zh_TW
dc.creator (作者) Yao, Yi-Ching ; Chen, Shih-chieh ; Wang, Shao-Hsuanen_US
dc.date (日期) 2014.02en_US
dc.date.accessioned 21-三月-2014 16:39:48 (UTC+8)-
dc.date.available 21-三月-2014 16:39:48 (UTC+8)-
dc.date.issued (上傳時間) 21-三月-2014 16:39:48 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/64815-
dc.description.abstract (摘要) To deal with the compatibility issue of full conditional distributions of a (discrete) random vector, a graphical representation is introduced where a vertex corresponds to a configuration of the random vector and an edge connects two vertices if and only if the ratio of the probabilities of the two corresponding configurations is specified through one of the given full conditional distributions. Compatibility of the given full conditional distributions is equivalent to compatibility of the set of all specified probability ratios (called the ratio set) in the graphical representation. Characterizations of compatibility of the ratio set are presented. When the ratio set is compatible, the family of all probability distributions satisfying the specified probability ratios is shown to be the set of convex combinations of k probability distributions where k is the number of components of the underlying graph.en_US
dc.format.extent 483330 bytes-
dc.format.mimetype application/pdf-
dc.language.iso en_US-
dc.relation (關聯) Journal of Multivariate Analysis, 124, 1-9en_US
dc.source.uri (資料來源) http://dx.doi.org/10.1016/j.jmva.2013.10.007en_US
dc.subject (關鍵詞) Connected graph; Full conditional; Graph theory; Spanning treeen_US
dc.title (題名) On compatibility of discrete full conditional distributions: A graphical representation approachen_US
dc.type (資料類型) articleen
dc.identifier.doi (DOI) 10.1016/j.jmva.2013.10.007en_US
dc.doi.uri (DOI) http://dx.doi.org/10.1016/j.jmva.2013.10.007en_US