Unformatted text preview:

24.221 Metaphysics Thursday November 10, 2005 Causal networks. Preemption seems to show that there can be counterfactual dependence without causation. But if one looks at examples of preemption, it often seems that e does in a way depend on c. It depends on c “in the obtaining circumstances”or “holding certain things fixed.” Early preemption. Suzy and Billy both throw their rocks at a bottle. Suzy’s rock deflectsBilly’s en route to the bottle, and Billy’s rock falls to the ground. True, it’s not the case that ~Oc → ~Oe. But it is the case that there are facts G such that ~Oc&G → ~Oe. Name some. Late preemption. Same setup, except that Billy’s rock is not deflected; it just arrives toolate, after the bottle has been broken by Suzy’s rock. True, it’s not the case that ~Oc → ~Oe. See if you can think of a G such that ~Oc&G → ~Oe. Trumping preemption. The troops obey Colonel and they obey Captain, but if both makean order simultaneously, it’s the higher ranking officer (Captain) they’ve been trained tofollow. Colonel and Captain both shout “March!” The troops march because of Captain’sorder. But if Captain had kept quiet, they still would have marched. What can we hold fixed to restore the dependence/? Magical preemption. The laws of magic say the first spell of the day determines whathappens at midnight. Merlin says in the morning, “Prince into frog!” Morgana says thesame thing in the evening. It’s Merlin’s spell that causes the transformation, but there’s no counterfactual dependence. What to hold fixed? Hastening preemption. The forest would have burned in June anyway due to a biglightning storm, but the drought dries it out so that a small lightning storm in May isenough to set it off. One wants to say the drought is a cause of the fire, despite that itwould have occurred anyway. What to hold fixed? One implementation of the holding fixed strategy has arisen in engineering, in the work ofJudea Pearl (Causality, 2000) and others. It’s called the method of causal networks. Hitchcock gives a simplified version of it. The basic idea is that c causes e iff there’s an “active” path or route through the relevant network, leading from c to e. First we explain networks. One starts with a bunch of variables A, B, C, etc. To keepthings simple they can only assume two values: 1 if the corresponding event a, b, c,….occurs, 0 if it does not occur. So, C might be Suzy’s throwing, D might be Billy’s, aandE might be the bottle shattering. One states the counterfactual relations between thevalues of these variables using “structural equations.” Assume that Billy throws only ifSuzy doesn’t. Then the equations are D = ~C E = C v D Read these as convenient shorthand for counterfactuals. The first says that C=0 → D=1,C=1 → D=0; the second says that (C=1 v D=1) → D=1, (C=0 & D=0) → E=0. The equations tell us how to interpret this graph; they tell us how arrow-tip variables havetheir values determined by arrow-base variables. C E D And now here is what is meant by an active path. To determine if there is an active pathfrom C to E, one first sets off-path variables to their actual values. That means one changes the equation for D to this: D=0 (since we’re assuming Billy didn’t throw). One now toggles C up and down from 0 to 1 and back and looks at how this affects E. Clearly,if we hold D fixed at 0, then E is just going to take the same value as C. The path isactive insofar as changing C’s value (with off-path variables frozen at their actual values)changes E’s value. The claim (slightly simplified) is that c causes e iff there is an active path from C to E, so that toggling C on and off is a way of toggling E on and off. One nice feature of this account is that it fits with our intuitions about transitivity. Suppose c is a boulder being dislodged, d is the hiker seeing it dislodged and ducking, and e is the hiker’s surviving. The equations are D=C, E=~CvD; the diagram can be the same asabove. Freezing D to its actual value of 1 (the hiker ducked) the route from C to E isinactive, even though the routes from C to D and from D to E are both active. The route via D is inactive too; the hiker survives whether the boulder is dislodged or not. Problem, though: suppose we add a new variable D* on the upper path, equal to 1 if there’sa falling boulder right by the hiker’s head, otherwise 0. The equations are D*=C, D=C,E=Dv~D*. Now (exercise!) the path from C to E through D becomes active. Uh oh! Holding fixed that there was a boulder about to fall on her head, it’s a good thing a boulderwas dislodged a moment earlier, leading the hiker to duck! The bomb example is evenclearer in this respect. Holding fixed that the chair was going to explode, whether the victim survives depends on whether a bomb is put under her chair to tip her off to theimpending explosion! Next time talk about responses to these


View Full Document

MIT 24 221 - Causal networks

Download Causal networks
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Causal networks and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Causal networks 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?