A structural Markov property for decomposable graph laws that allows control of clique intersections

A structural Markov property for decomposable graph laws that allows control of clique intersections

We present a new kind of structural Markov property for probabilistic laws on decomposable graphs, which allows the explicit control of interactions between cliques and so is capable of encoding some interesting structure. We prove the equivalence of this property to an exponential family assumption...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Biometrika 2018-03, Vol.105 (1), p.19-30, Article 19
Hauptverfasser: GREEN, PETER J., THOMAS, ALUN
Format: Artikel
Sprache:eng
Schlagworte:
Computer applications
Decomposition
Graph theory
Intersections
Markov analysis
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 30
container_issue 1
container_start_page 19
container_title Biometrika
container_volume 105
creator GREEN, PETER J.
THOMAS, ALUN
description We present a new kind of structural Markov property for probabilistic laws on decomposable graphs, which allows the explicit control of interactions between cliques and so is capable of encoding some interesting structure. We prove the equivalence of this property to an exponential family assumption, and discuss identifiability, modelling, inferential and computational implications.
doi_str_mv 10.1093/biomet/asx072
format Article
fullrecord <record><control><sourceid>jstor_proqu</sourceid><recordid>TN_cdi_proquest_journals_2306249010</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><jstor_id>48546283</jstor_id><oup_id>10.1093/biomet/asx072</oup_id><sourcerecordid>48546283</sourcerecordid><originalsourceid>FETCH-LOGICAL-c359t-1414aa66289a29a4cf6f3d3c3b555f97e61370baf8cadef6f18eda4f36abe5943</originalsourceid><addsrcrecordid>eNqFkE1PwzAMhiMEEmNw5IgUiQuXQtJ8rD1OE1_SEBc4V26asI6sKUkK7N-TqYgDEuJkW37s134ROqXkkpKSXdWt2-h4BeGTzPI9NKFc8owJSvbRhBAiM8Y5P0RHIax3pRRygpo5DtEPKg4eLH4A_-rece9dr33cYuM8brRym94FqK3GLx76FbbwEXBcQcRgrUu5cl30zmJnsLLt26Bx20Xtg1axdV04RgcGbNAn33GKnm-unxZ32fLx9n4xX2aKiTJmlFMOIGVelJCXwJWRhjVMsVoIYcqZlpTNSA2mUNDo1KSFboAbJqHWouRsis7HvemBdESI1doNvkuSVc6IzHlJKElUNlLKuxC8NlXv2w34bUVJtTOyGo2sRiMTz37xqo2weyx6aO2fUxfjlBv6fwXORnQdovM_MC8ET14w9gUE8JT9</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2306249010</pqid></control><display><type>article</type><title>A structural Markov property for decomposable graph laws that allows control of clique intersections</title><source>JSTOR Mathematics &amp; Statistics</source><source>JSTOR Archive Collection A-Z Listing</source><source>Oxford University Press Journals All Titles (1996-Current)</source><creator>GREEN, PETER J. ; THOMAS, ALUN</creator><creatorcontrib>GREEN, PETER J. ; THOMAS, ALUN</creatorcontrib><description>We present a new kind of structural Markov property for probabilistic laws on decomposable graphs, which allows the explicit control of interactions between cliques and so is capable of encoding some interesting structure. We prove the equivalence of this property to an exponential family assumption, and discuss identifiability, modelling, inferential and computational implications.</description><identifier>ISSN: 0006-3444</identifier><identifier>EISSN: 1464-3510</identifier><identifier>DOI: 10.1093/biomet/asx072</identifier><language>eng</language><publisher>Oxford: Oxford University Press</publisher><subject>Computer applications ; Decomposition ; Graph theory ; Intersections ; Markov analysis</subject><ispartof>Biometrika, 2018-03, Vol.105 (1), p.19-30, Article 19</ispartof><rights>2017 Biometrika Trust</rights><rights>2017 Biometrika Trust 2017</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c359t-1414aa66289a29a4cf6f3d3c3b555f97e61370baf8cadef6f18eda4f36abe5943</citedby><cites>FETCH-LOGICAL-c359t-1414aa66289a29a4cf6f3d3c3b555f97e61370baf8cadef6f18eda4f36abe5943</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.jstor.org/stable/pdf/48546283$$EPDF$$P50$$Gjstor$$H</linktopdf><linktohtml>$$Uhttps://www.jstor.org/stable/48546283$$EHTML$$P50$$Gjstor$$H</linktohtml><link.rule.ids>314,780,784,803,832,1584,27924,27925,58017,58021,58250,58254</link.rule.ids></links><search><creatorcontrib>GREEN, PETER J.</creatorcontrib><creatorcontrib>THOMAS, ALUN</creatorcontrib><title>A structural Markov property for decomposable graph laws that allows control of clique intersections</title><title>Biometrika</title><description>We present a new kind of structural Markov property for probabilistic laws on decomposable graphs, which allows the explicit control of interactions between cliques and so is capable of encoding some interesting structure. We prove the equivalence of this property to an exponential family assumption, and discuss identifiability, modelling, inferential and computational implications.</description><subject>Computer applications</subject><subject>Decomposition</subject><subject>Graph theory</subject><subject>Intersections</subject><subject>Markov analysis</subject><issn>0006-3444</issn><issn>1464-3510</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>TOX</sourceid><recordid>eNqFkE1PwzAMhiMEEmNw5IgUiQuXQtJ8rD1OE1_SEBc4V26asI6sKUkK7N-TqYgDEuJkW37s134ROqXkkpKSXdWt2-h4BeGTzPI9NKFc8owJSvbRhBAiM8Y5P0RHIax3pRRygpo5DtEPKg4eLH4A_-rece9dr33cYuM8brRym94FqK3GLx76FbbwEXBcQcRgrUu5cl30zmJnsLLt26Bx20Xtg1axdV04RgcGbNAn33GKnm-unxZ32fLx9n4xX2aKiTJmlFMOIGVelJCXwJWRhjVMsVoIYcqZlpTNSA2mUNDo1KSFboAbJqHWouRsis7HvemBdESI1doNvkuSVc6IzHlJKElUNlLKuxC8NlXv2w34bUVJtTOyGo2sRiMTz37xqo2weyx6aO2fUxfjlBv6fwXORnQdovM_MC8ET14w9gUE8JT9</recordid><startdate>20180301</startdate><enddate>20180301</enddate><creator>GREEN, PETER J.</creator><creator>THOMAS, ALUN</creator><general>Oxford University Press</general><general>Oxford Publishing Limited (England)</general><scope>TOX</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7QO</scope><scope>8FD</scope><scope>FR3</scope><scope>P64</scope></search><sort><creationdate>20180301</creationdate><title>A structural Markov property for decomposable graph laws that allows control of clique intersections</title><author>GREEN, PETER J. ; THOMAS, ALUN</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c359t-1414aa66289a29a4cf6f3d3c3b555f97e61370baf8cadef6f18eda4f36abe5943</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Computer applications</topic><topic>Decomposition</topic><topic>Graph theory</topic><topic>Intersections</topic><topic>Markov analysis</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>GREEN, PETER J.</creatorcontrib><creatorcontrib>THOMAS, ALUN</creatorcontrib><collection>Access via Oxford University Press (Open Access Collection)</collection><collection>CrossRef</collection><collection>Biotechnology Research Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>Biotechnology and BioEngineering Abstracts</collection><jtitle>Biometrika</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>GREEN, PETER J.</au><au>THOMAS, ALUN</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A structural Markov property for decomposable graph laws that allows control of clique intersections</atitle><jtitle>Biometrika</jtitle><date>2018-03-01</date><risdate>2018</risdate><volume>105</volume><issue>1</issue><spage>19</spage><epage>30</epage><pages>19-30</pages><artnum>19</artnum><issn>0006-3444</issn><eissn>1464-3510</eissn><abstract>We present a new kind of structural Markov property for probabilistic laws on decomposable graphs, which allows the explicit control of interactions between cliques and so is capable of encoding some interesting structure. We prove the equivalence of this property to an exponential family assumption, and discuss identifiability, modelling, inferential and computational implications.</abstract><cop>Oxford</cop><pub>Oxford University Press</pub><doi>10.1093/biomet/asx072</doi><tpages>12</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0006-3444
ispartof Biometrika, 2018-03, Vol.105 (1), p.19-30, Article 19
issn 0006-3444
1464-3510
language eng
recordid cdi_proquest_journals_2306249010
source JSTOR Mathematics & Statistics; JSTOR Archive Collection A-Z Listing; Oxford University Press Journals All Titles (1996-Current)
subjects Computer applications
Decomposition
Graph theory
Intersections
Markov analysis
title A structural Markov property for decomposable graph laws that allows control of clique intersections
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-20T12%3A37%3A45IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-jstor_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20structural%20Markov%20property%20for%20decomposable%20graph%20laws%20that%20allows%20control%20of%20clique%20intersections&rft.jtitle=Biometrika&rft.au=GREEN,%20PETER%20J.&rft.date=2018-03-01&rft.volume=105&rft.issue=1&rft.spage=19&rft.epage=30&rft.pages=19-30&rft.artnum=19&rft.issn=0006-3444&rft.eissn=1464-3510&rft_id=info:doi/10.1093/biomet/asx072&rft_dat=%3Cjstor_proqu%3E48546283%3C/jstor_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2306249010&rft_id=info:pmid/&rft_jstor_id=48546283&rft_oup_id=10.1093/biomet/asx072&rfr_iscdi=true