2015
DOI: 10.1214/15-ejs1068
|View full text |Cite
|
Sign up to set email alerts
|

The dynamic chain event graph

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
46
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 30 publications
(46 citation statements)
references
References 22 publications
0
46
0
Order By: Relevance
“…This not only decreases the size of the event tree, but also makes explicit the asymmetric relationships among steps in the process. CEGs have since further been developed in order to model processes with non-finite event trees [27].…”
Section: Context Specific Independencementioning
confidence: 99%
“…This not only decreases the size of the event tree, but also makes explicit the asymmetric relationships among steps in the process. CEGs have since further been developed in order to model processes with non-finite event trees [27].…”
Section: Context Specific Independencementioning
confidence: 99%
“…It is important to note that the Markov model in [7] was for assessing long-term effectiveness.The CEG described in this paper caters to short-term analysis. Dynamic variants of the CEG have been developed in [1,5]. For applications such as the falls intervention, we observe that individuals take varying amounts of time to move from certain states.…”
Section: Discussionmentioning
confidence: 99%
“…However, other classes of graphical models can also entertain a distributed analysis. For example chain event graphs (Smith and Anderson, 2008) and their dynamic variant (Barclay et al, 2013) might be able to provide in some domains a better representation of the involved uncertainties and consequently a more focused decision making. We plan to extend our results to additional classes of model in future research.…”
Section: Discussionmentioning
confidence: 99%
“…Line (1) describes the backward induction step over the time index, t, while line (2) does the same over the index of the vertices of the graph, i. Now note that in lines (5)- (7), Panel G i :ũ t,i using equation (4). Each panel has enough information to do this, since line (10) guarantees that the scores are communicated to the panels overseeing father vertices and line (14) denotes the fact that the SB transmitsû t,i to the appropriate panels.…”
Section: B Proof Of Theoremmentioning
confidence: 99%