Directed acyclic graphs with edge-specific bounds.
نویسندگان
چکیده
We give a definition of a bounded edge within the causal directed acyclic graph framework. A bounded edge generalizes the notion of a signed edge and is defined in terms of bounds on a ratio of survivor probabilities. We derive rules concerning the propagation of bounds. Bounds on causal effects in the presence of unmeasured confounding are also derived using bounds related to specific edges on a graph. We illustrate the theory developed by an example concerning estimating the effect of antihistamine treatment on asthma in the presence of unmeasured confounding.
منابع مشابه
Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs
We give upper bounds for the generalised acyclic chromatic number and generalised acyclic edge chromatic number of graphs with maximum degree d, as a function of d. We also produce examples of graphs where these bounds are of the correct order.
متن کاملEconomical Graph Discovery
Consider a weighted n-vertex, m-edge graph G with designated source s and destination t. The topology of G is known, while the edge weights are hidden. Our goal is to discover either the edge weights in the graph or a shortest (s, t)-path. This is done by means of agents that traverse different (s, t)-paths in multiple rounds and report back the total cost they incurred. Various cost models are...
متن کاملAcyclic Edge Colouring of Partial 2-Trees
An acyclic edge colouring of a graph is a proper edge colouring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge colouring using k colours and it is denoted by a′(G). Here, we obtain tight estimates on a′(G) for nontrivial subclasses of the family of 2-degenerate graphs. Specifically, we obtain values of...
متن کاملAcyclic Coloring of Graphs
In this report we obtain (good) upper bounds on the acyclic chromatic index of graphs obtained as the tensor product of two (or more) graphs, in terms of the acyclic chromatic indices of those factor graphs in the tensor product. Our results assume that optimal colourings for the factor graphs are given and our algorithms extend these colourings to obtain good (close to optimal) colourings of t...
متن کاملImproved algorithms for replacement paths problems in restricted graphs
We present near-optimal algorithms for two problems related to finding the replacement paths for edges with respect to shortest paths in sparse graphs. The problems essentially study how the shortest paths change as edges on the path fail, one at a time. Our technique improves the existing bounds for these problems on directed acyclic graphs, planar graphs, and non-planar integer-edge-weighted ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Biometrika
دوره 99 1 شماره
صفحات -
تاریخ انتشار 2012