Traceable Regressions
نویسندگان
چکیده
In this paper, we define and study the concept of traceable regressions and apply it to some examples. Traceable regressions are sequences of conditional distributions in joint or single responses for which a corresponding graph captures an independence structure and represents, in addition, conditional dependences that permit the tracing of pathways of dependence. We give the properties needed for transforming these graphs and graphical criteria to decide whether a path in the graph induces a dependence. The much stronger constraints on distributions that are faithful to a graph are compared to those needed for traceable regressions.
منابع مشابه
Sequences of regressions and their dependences
In this paper, we study sequences of regressions in joint or single responses given a set of context variables, where a dependence structure of interest is captured by a regression graph. These graphs have nodes representing random variables and three types of edge. Their set of missing edges defines the independence structure of the graph provided two properties are used that are not common to...
متن کاملStar graphs induce tetrad correlations: for Gaussian as well as for binary variables
Tetrad correlations were obtained historically for Gaussian distributions when tasks are designed to measure an ability or attitude so that a single unobserved variable may generate the observed, linearly increasing dependences among the tasks. We connect such generating processes to a particular type of directed graph, the star graph, and to the notion of traceable regressions. Tetrad correlat...
متن کاملA traceable optimistic fair exchange protocol in the standard model
An Optimistic Fair Exchange (OFE) protocol is a good way for two parties to exchange their digital items in a fair way such that at the end of the protocol execution, both of them receive their items or none of them receive anything. In an OFE protocol there is a semi-trusted third party, named arbitrator, which involves in the protocol if it is necessary. But there is a security problem when a...
متن کاملAn Iterative Approach to the Traceability Conjecture for Oriented Graphs
A digraph is k-traceable if its order is at least k and each of its subdigraphs of order k is traceable. The Traceability Conjecture (TC) states that for k > 2 every k-traceable oriented graph of order at least 2k − 1 is traceable. It has been shown that for 2 6 k 6 6, every k-traceable oriented graph is traceable. We develop an iterative procedure to extend previous results regarding the TC. I...
متن کاملComputational Results on the Traceability of Oriented Graphs of Small Order
A digraph D is traceable if it contains a path visiting every vertex, and hypotraceable if D is not traceable, but D − v is traceable for every vertex v ∈ V (D). Van Aardt, Frick, Katrenic̃ and Nielsen [Discrete Math. 11(2011), 1273-1280] showed that there exists a hypotraceable oriented graph of order n for every n > 8, except possibly for n = 9 or 11. These two outstanding existence questions ...
متن کامل