Startseite Identification of the Joint Effect of a Dynamic Treatment Intervention and a Stochastic Monitoring Intervention Under the No Direct Effect Assumption
Artikel Open Access

Identification of the Joint Effect of a Dynamic Treatment Intervention and a Stochastic Monitoring Intervention Under the No Direct Effect Assumption

  • Romain Neugebauer EMAIL logo , Julie A. Schmittdiel , Alyce S. Adams , Richard W. Grant und Mark J. van der Laan
Veröffentlicht/Copyright: 18. Januar 2017
Veröffentlichen auch Sie bei De Gruyter Brill

Abstract

The management of chronic conditions is characterized by frequent re-assessment of therapy decisions in response to the patient’s changing condition over the course of the illness. Evidence most suitable to inform care thus often concerns the contrast of adaptive treatment strategies that repeatedly personalize treatment decisions over time using the latest accumulated data available from the patient’s previous clinic visits such as laboratory exams (e.g., hemoglobin A1c measurements in diabetes care). The frequency at which such information is monitored implicitly defines the causal estimand that is typically evaluated in an observational or randomized study of such adaptive treatment strategies. Analytic control of monitoring with standard estimation approaches for time-varying interventions can therefore not only improve study generalizibility but also inform the optimal timing of clinical surveillance. Valid inference with these estimators requires the upholding of a positivity assumption that can hinder their applicability. To potentially weaken this requirement for monitoring control, we introduce identifiability results that will facilitate the derivation of alternate estimators of effects defined by general joint treatment and monitoring interventions in the context of time-to-event outcomes. These results are developed based on the nonparametric structural equation modeling framework using a no direct effect assumption originally introduced in a prior paper that inspired this work. The relevance and scope of the results presented here are illustrated with examples in diabetes comparative effectiveness research.

1 Introduction

Effective management of chronic conditions such as diabetes involves frequent re-evaluation of treatment decisions over the course of the patient’s illness. Patients and their clinicians must choose not only adequate therapies among many options, but they must also decide throughout the course of the illness when to initiate, switch or intensify treatments and how to titrate medication to balance health benefits and harms. These clinical decisions are informed by periodic monitoring of laboratory test results (e.g., hemoglobin A1c for patients with diabetes), changes in symptoms, and more general considerations of patients’ preferences, concurrent conditions, adherence to previously prescribed treatments, and overall health. Evidence most suitable to guide the real-world management of chronic conditions must therefore involve the evaluation of complex treatment strategies that continuously adapt to new information about the patient’s changing circumstances collected during routine clinic visits. For instance, in diabetes research, contrasting (e.g., by randomization) adaptive treatment regimens of the type:

“Initiate insulin the first time the patient’s observed A1c drifts above X” with X=7%,7.5%, 8%, or 8.5%

will generate evidence that is clinically more relevant that contrasting static treatment regimens of the type

“Initiate insulin X months from now” with X =3, 6, 9, or 12

because the former regimens emulate (albeit simplistically) how treatment decisions are made in real-world clinical practice by personalizing treatment decisions over time based on the latest A1c information available for the patient. With the help of healthcare providers, the above adaptive treatment regimens can be made more complex so they better emulate how treatment decisions are informed in real-world clinical settings and thus ensure that the evidence generated is most useful by contrasting decision making procedures that are (or could be realistically) used by clinicians in practice.

Causal inference methods to estimate the effects of treatment regimens in the presence of time-dependent confounding have been developed specifically to generate such evidence using data from observational studies [1, 2, 3, 4, 5, 6] or randomized experiments [7, 8, 9, 10, 1112]. Until recently [13, 14] however, applications have ignored the role of clinical monitoring frequency in the definition of the effects of adaptive treatment strategies. As a result, conclusions about health benefits and harms remain specific [4, Section 6] to the particular clinical monitoring conditions of the study which may or not reflect a particular real-world practice of interest. For example, two perfect randomized trials (no non-compliance and no loss to follow-up) that are conducted in the same patient population but using two distinct clinical monitoring schedules could provide different conclusions (both valid) about the effectiveness of an adaptive treatment strategy compared to the same, for example, static (i.e., non-adaptive) treatment strategy (e.g., never treat).

Evaluating the joint effect of an adaptive treatment strategy and a particular clinical monitoring intervention is thus desirable to, not only, improve the generalizibility [4, 15, 16] of study results, but also, more importantly, to generate evidence on how clinical monitoring modify the health effects of adaptive treatment strategies. For instance, in diabetes research, contrasting joint treatment and monitoring regimens of the type:

“Monitor the patient’s A1c every X months and initiate insulin the first time her A1c drifts above 8%” with X = 3, 6, 9, 12

can generate evidence about the value of increased A1c monitoring (“value of information” [4]) that can be highly relevant for both patients living with chronic conditions and for the health systems that care for them: A patient’s quality of life is impacted by the burdens imposed by frequent laboratory and other clinical surveillance and this surveillance also contributes to the significant burdens that chronic conditions put on healthcare systems. Thus, not only is evidence on how to possibly minimize the intensity of clinical monitoring without significantly undermining health outcomes relevant to inform care, but also evidence that aim to optimize outcomes by adapting monitoring decisions over time based on a patient’s evolving condition. The latter type of evidence can, for example, be generated by contrasting joint treatment and monitoring regimens of the type:

“Monitor the patient’s A1c every X months as long as her latest A1c remain below 7% and increase monitoring to every 3 months otherwise. Initiate insulin the first time her A1c drifts above 8%” with X = 3, 6, 9, 12.

Standard estimation approaches for evaluating the effect of general time-varying exposures with observational data can be readily applied to the evaluation of the joint effect of an adaptive treatment strategy and a particular clinical monitoring intervention by simply defining the exposure variable of interest at each time point as a two-dimensional variable where the first and second element represents the treatment and monitoring decision, respectively. These methods include not only the most popular Inverse Probability Weighting (IPW) [17] and G-computation [18] estimation approaches but also the two doubly robust and locally efficient augmented-IPW [19, 20, 21, 22, 23] and Targeted Minimum Loss based Estimation (TMLE) [24, 25, 26] approaches. Effect identifiability with these various estimators relies on both a no unmeasured confounders assumption and a positivity assumption. The latter assumption requires that each patient in the study can possibly experience the time-varying interventions of interest at each time point whatever the levels of the time-dependent confounders. Upholding of this assumption when the time-varying interventions include rigid monitoring control (e.g., “patient should have her A1c monitored exactly every 3 months”) might often be unrealistic in observational studies conducted in real-world settings. Concerns over effect non-identifiability due to violation of the positivity assumption associated with monitoring decisions have motivated prior work [4, Section 6] and led to the development of new IPW estimators which remain consistent under a weaker positivity assumption for monitoring decisions as long as it can also be assumed that these monitoring decisions have no direct effects on covariates (including the outcome) once treatment decisions are made. This assumption was named the No Direct Effect (NDE) assumption and the resulting NDE-based IPW estimators were developed in problems with an end-of-study outcome and for static or more general (adaptive or not) stochastic monitoring interventions.

In this article, we extend this prior work in the context of time-to-event outcomes with the presentation of two counterfactual identifiability results. These two counterfactual equalities are developed based on the nonparametric structural equation model (NPSEM) framework [27, 28, 29, 30] and applicable to the evaluation of the joint effect of an adaptive treatment strategy and either a static or general stochastic clinical monitoring intervention under the NDE assumption. The practical implication of the results presented here is the straightforward derivation of new IPW, G-computation, augmented IPW and TMLE estimators that rely on a weaker positivity assumption for the monitoring process compared to their standard analogs (i.e., not based on the NDE assumption). We note, however, that while we illustrate the implication of the results in this paper for estimator construction using the IPW methodology with the simple example of static monitoring interventions, the detailed derivation and evaluation of alternate estimators and of the required assumptions for estimation consistency (e.g., sequential randomization assumption) are beyond the scope of this article. In separate work, we will further exploit the two identifiability results presented here to demonstrate that they lead, not only, to another innovative NDE-based IPW estimator for general stochastic monitoring interventions derived in a prior paper [4] (without formally evoking the results of this article), but also to the straightforward derivation of NDE-based TMLE estimators for either static or general stochastic monitoring interventions.

In the next section, we present the notation adopted in this paper to represent the general longitudinal observational data available in practice to evaluate the joint treatment and monitoring effects of interest. In Section 3, we introduce the causal model defined by a general NPSEM that is assumed to have generated the observed data and that defines the various classes of counterfactual variables considered in this work. We detail the definition of these counterfactuals in Section 4 before formalizing the NDE assumption. In Sections 6 and 7, we present the two identifiability results for evaluating joint effects defined by static and general stochastic monitoring interventions, respectively. We illustrate the practical implication of these results for estimator construction in Section 8 and conclude with a discussion of the contribution of this paper to the existing literature on the same topic in Section 9. For clarity, we continue to use examples in diabetes comparative effectiveness research (CER) throughout the manuscript to demonstrate the applicability of the formalism introduced in the next sections.

2 Observed data

We consider an observational study (e.g., retrospective study based on Electronic Health Records from a healthcare database) in which longitudinal data are collected on a random sample of n patients from a target population starting at the index date (i.e., cohort entry date denoted by t=0) and until end of follow-up defined by the earliest occurrence of a failure event of interest (e.g., onset of diabetic peripheral neuropathy) or a right-censoring event (e.g., health plan disenrollment). Right-censoring events include reaching the administrative end of the study which occurs for all patients at time t=K+1 at the latest. At each time point t during follow-up (expressed in an arbitrary unit of time, e.g., 30-day interval), measurements on the following variables are assembled. The sequence in which we describe these variables reflects the actual temporal ordering of the underlying information these variables encode. The binary outcome variable Y(t) represents whether the failure event occurred since time point t1 (Y(0)=0 by convention). The vector of covariates Z(t) represents various patient attributes (e.g., demographic, vital signs, comorbidities, etc.) at time t. We note that some of these attributes may not be monitored at each time point in which case indicators of monitoring are included as part of the definition of Z(t) and the unmonitored attribute measurements are then equal to 0 by convention. The covariate I(t) represents the patient’s attribute at time t (e.g., A1c) that is involved in the definition of the adaptive treatment regimen of interest and for which a monitoring intervention is also of interest. By convention, I(0) is always monitored and I(t)0 if the attribute is not monitored at time t. The binary variable A2(t) represents whether the patient experiences a right-censoring event at time t. The variable A1(t) represents the treatment decision of interest at time t (e.g., insulin exposure). The binary variable N(t) represents the monitoring decision of interest at time t and indicates whether a measurement for I(t+1) will be collected (e.g., whether an A1c test will be conducted at the next time point). We thus have I(t+1)=0 if N(t)=0. In short, the observed data are realizations of n independent and identically distributed copies of the following temporally ordered sequence of random variables:

O=(L(0),A2(0),A1(0),N(0),,L(K),A2(K),A1(K),N(K),L(K+1),A2(K+1)),

where L(t)(Y(t),Z(t),I(t)), A2(K+1)=1 if Y(K+1)=0 (i.e., right-censoring from reaching the administrative end of the study is deterministic at K+1), and where, by convention, all variables become degenerate (defined at their last observed value) after occurrence of a failure or right-censoring event. Time-independent covariates (e.g., sex) are included in the vector of baseline covariates L(0) alongside the baseline measurements of time-varying covariates. We denote the distribution of these observed data O by P0. To simplify notation below, we use the overbar symbol to denote the history of a variable. More specifically, Xˉ(t) and Xˉ(t,t) represent the vectors of measurements of the time-varying attribute X from baseline to time point t: Xˉ(t)(X(0),,X(t)) and from time point t to t: Xˉ(t,t)(X(t),,X(t)), respectively. By convention, Xˉ(t) and X(t) are nil for t<0 and Xˉ(t,t) is nil for t<t. We also use lower case letters to represent realizations of random variables. Finally, we denote the support of the treatment and monitoring processes Aˉ1(K) and Nˉ(K) by Aˉ and Nˉ, respectively.

3 Causal model

We assume the following nonparametric structural equation model (NPSEM) that links (Appendix A) the observed data distribution P0 to the probability distribution (denoted by PU) of a vector of random disturbances U((UY(t),UZ(t),UI0(t),UA2(t))t=0,,K+1,(UA1(t),UN(t))t=0,,K) and a fixed vector of functions f((fY(t),fZ(t),fI0(t),fA2(t))t=0,,K+1,(fA1(t),fN(t))t=0,,K):

  1. Y(t)=fY(t)(PY(t)0,UY(t)) with parents PY(t)0(Yˉ(t1),Zˉ(t1),Iˉ0(t1),Aˉ2(t1),Aˉ1(t1),Nˉ(t1)) for t=0,,K+1,

  2. Z(t)=fZ(t)(PZ(t)0,UZ(t)) with parents PZ(t)0(Yˉ(t),Zˉ(t1),Iˉ0(t1),Aˉ2(t1),Aˉ1(t1),Nˉ(t1)) for t=0,,K+1,

  3. I0(t)=fI0(t)(PI0(t)0,UI0(t)) with parents PI0(t)0(Yˉ(t),Zˉ(t),Iˉ0(t1),Aˉ2(t1),Aˉ1(t1),Nˉ(t1)) for t=0,,K+1,

  4. I(t)=Y(t)I(t1)+(1Y(t))N(t1)I0(t) for t=0,,K+1 where N(1)1 by convention,

  5. A2(t)=fA2(t)(PA2(t)0,UA2(t)) with parents PA2(t)0(Yˉ(t),Zˉ(t),Iˉ0(t),Aˉ2(t1),Aˉ1(t1),Nˉ(t1)) for t=0,,K+1,

  6. A1(t)=fA1(t)(PA10,UA1(t)) with parents PA1(t)0(Yˉ(t),Zˉ(t),Iˉ0(t),Aˉ2(t),Aˉ1(t1),Nˉ(t1)) for t=0,,K,

  7. N(t)=fN(t)(PN(t)0,UN(t)) with parents PN(t)0(Yˉ(t),Zˉ(t),Iˉ0(t),Aˉ2(t),Aˉ1(t),Nˉ(t1)) for t=0,,K,

where the functions f above are left unspecified except for the following constraints:

  1. fY(0)(UY(0))=0,

  2. fY(t)(PY(t)0,UY(t))=Y(t1) if A2(t1)=1 or Y(t1)=1 for t=1,,K+1,

  3. fZ(t)(PZ(t)0,UZ(t))=Z(t1) if A2(t1)=1 or Y(t)=1 for t=1,,K+1,

  4. fI0(t)(PI0(t)0,UI0(t))=I0(t1) if A2(t1)=1 or Y(t)=1 for t=1,,K+1,

  5. fA2(t)(PA2(t)0,UA2(t))=A2(t1) if A2(t1)=1 or Y(t)=1 for t=1,,K+1,

  6. fA1(t)(PA1(t)0,UA1(t))=A1(t1) if A2(t)=1 or Y(t)=1 for t=1,,K,

  7. fN(t)(PN(t)0,UN(t))=N(t1) if A2(t)=1 or Y(t)=1 for t=1,,K,

  8. fA2(K+1)(PA2(K+1)0,UA2(K+1))=1 if Y(K+1)=0.

In this NPSEM, the observed covariate I(t) is explicitly linked to a latent variable I0(t) which represents the patient’s underlying attribute measurement of interest at time t. More specifically, as long as the patient has not experienced failure yet, if a decision was made not to collect the measurement I0(t) at the previous time point (i.e., when N(t1)=0) then I(t)=0 (which follows the convention described in the previous section to define I(t)) and otherwise I(t)=I0(t) (i.e., when N(t1)=1).

The combination of the latent variable I0(t) and observed variables Y(t), Z(t), A2(t), A1(t), and N(t) are referred to as endogenous variables [1] and we note that the previous constraints on the functions f merely encode 1) the convention that the baseline outcome is 0, 2) the convention that the endogenous variables are defined as degenerate random variables after end of follow-up from occurrence of a failure or right-censoring event, and 3) deterministic right-censoring from administrative end of study at t=K+1.

We note also that the definition of the observed measurement I(t) above implies that, like all other endogenous variables, it becomes degenerate at its last observed value after the occurrence of, not only, the failure event, but also a right-censoring event, i.e., I(t)=I(t1) if Y(t)=1 or A2(t1)=1.

Finally, we introduce the notation L0(t)(Y(t),Z(t),I0(t)) for t=0,,K+1 and bring attention to the distinction between L0(t) and the observed vector of covariates L(t)=(Y(t),Z(t),I(t)).

4 Counterfactual variables of interest

Whether conducted with a randomized experiment or an observational study, CER typically aims to evaluate causal estimands defined by the distribution of “potential outcomes”, i.e., outcomes if all patients in the target population experienced the “same” (possibly adaptive or stochastic) exposure intervention. In this section, we differentiate five classes of general counterfactual variables considered in this work. Each is defined by a particular modification of the previous NPSEM as described below.

The NPSEM is modified by changing the structural equations associated with a set (denoted by X) of endogenous variables referred to as the action variables. More specifically, for each action variable X(t)X, the original structural equation X(t)=fX(t)(PX(t)0,UX(t)) is replaced with a new structural equation X(t)=fX(t)(PX(t)0,UX(t),UX(t)) and a joint conditional distribution (denoted by PUU) is specified for the new random disturbances associated with the action variables, (UX(t))X(t)X, given the original disturbances U. The endogenous variables resulting from such a modified NPSEM are referred to as counterfactual variables and their joint distribution is entirely defined by the joint distribution of the disturbances (U,(UX(t))X(t)X) which we denote by PU,U. To differentiate such counterfactual variables from the original endogenous variables in the unmodifed NPSEM, we use the generic superscript notation , i.e., the endogenous variables in any given modifed NPSEM are denoted by Y(t), Z(t), I0(t), I(t), A2(t), A1(t), and N(t) and the modified NPSEM is then expressed as the following collection of equations:

  1. X(t)=fX(t)(PX(t)0,UX(t),UX(t)) for each counterfactual variable X(t) corresponding with an action variable X(t)X, where PX(t)0 denotes the counterfactual analog of the parents PX(t)0 in the modified NPSEM (e.g., PN(t)0(Yˉ(t),Zˉ(t),Iˉ0(t),Aˉ2(t),Aˉ1(t),Nˉ(t1))),

  2. X(t)=fX(t)(PX(t)0,UX(t)) for each counterfactual variables X(t) corresponding with a non-action variable X(t)X.

4.1 Static intervention on the treatment and right-censoring variables

In this section, we formalize the definition of counterfactual outcomes involved in the evaluation of the following types of CER question in a cohort of diabetes patients whose glycemia has become out of control (e.g., A1c7%) despite prior therapies with oral agents (e.g., metformin therapy): What is the difference in the risk of onset diabetic peripheral neuropathy (DPN) if patients initiate insulin therapy at study entry versus delay initiation by 12 months? We note that such risk evaluation would require that all patients remain followed-up for the entire duration of the study (i.e., no loss to follow-up). Because the treatment interventions of interest in the example above are not adapted to the patient’s covariates, the treatment interventions are referred to as static.

We denote such static intervention regimens on the treatment and right-censoring variables through time K by aˉ(aˉ1(K),aˉ2(K)) where a2(t)=0 for t=0,,K. The effect of such an intervention on all other endogenous variables in the causal model is defined by the modified NPSEM with the following structural equations for the action variables X={Aˉ1(K),Aˉ2(K)}:

  1. A2(t)=fA2(t)(PA2(t)0,UA2(t),UA2(t))=Y(t)fA2(t)(PA2(t)0,UA2(t))+(1Y(t))a2(t)

  2. A1(t)=fA1(t)(PA1(t)0,UA1(t),UA1(t))=Y(t)fA1(t)(PA1(t)0,UA1(t))+(1Y(t))a1(t)

for any given conditional distribution PUU. We note that, with this definition, the intervention is restricted to the treatment and censoring variables from time 0 to the minimum of time K or the time of failure and, therefore, A1(t) is not necessarily equal to a1(t) after failure. We will also denote the counterfactual variables Y(t), Z(t), I0(t), I(t), A2(t), A1(t) and N(t) defined by the modified NPSEM described above by Yaˉ(t), Zaˉ(t), I0aˉ(t), Iaˉ(t), A2aˉ(t), A1aˉ(t) and Naˉ(t), respectively, to differentiate them from the other counterfactual variables defined in the following subsections. We denote the support of the counterfactual treatment and monitoring processes Aˉ1aˉ(K) and Nˉaˉ(K) by Aˉaˉ and Nˉaˉ, respectively.

4.2 Static intervention on the treatment, right-censoring, and monitoring variables

The static treatment and right-censoring interventions defined in the previous section are now supplemented by a static intervention on the monitoring process. We denote any given static intervention regimen of interest on monitoring through time K by nˉnˉ(K). The joint effect of this intervention and the static interventions on treatment and right-censoring, aˉ, on all other endogenous variables in the causal model is defined by the modified NPSEM with the following structural equations for the action variables X={Aˉ1(K),Aˉ2(K),Nˉ(K)}:

  1. A2(t)=fA2(t)(PA2(t)0,UA2(t),UA2(t))=Y(t)fA2(t)(PA2(t)0,UA2(t))+(1Y(t))a2(t)

  2. A1(t)=fA1(t)(PA1(t)0,UA1(t),UA1(t))=Y(t)fA1(t)(PA1(t)0,UA1(t))+(1Y(t))a1(t)

  3. N(t)=fN(t)(PN(t)0,UN(t),UN(t))=Y(t)fN(t)(PN(t)0,UN(t))+(1Y(t))n(t)

for any given conditional distribution PUU. We will also denote the counterfactual variables Y(t), Z(t), I0(t), I(t), A2(t), A1(t) and N(t) defined by the modified NPSEM just described by Yaˉ,nˉ(t), Zaˉ,nˉ(t), I0aˉ,nˉ(t), Iaˉ,nˉ(t), A2aˉ,nˉ(t), A1aˉ,nˉ(t) and Naˉ,nˉ(t), respectively. We note again here that, after failure, A1aˉ,nˉ(t) and now also Naˉ,nˉ(t) are not necessarily equal to a1(t) and n(t), respectively. We denote the support of the counterfactual treatment and monitoring processes Aˉ1aˉ,nˉ(K) and Nˉaˉ,nˉ(K) by Aˉaˉ,nˉ and Nˉaˉ,nˉ, respectively.

4.3 Static intervention on the right-censoring and monitoring variables combined with a dynamic intervention on the treatment variables

In this section, we formalize the definition of counterfactual outcomes involved in the evaluation of the following types of diabetes CER questions: What is the difference in the risk of onset DPN if patients have their A1c monitored every 6 months and initiate insulin therapy the first time their A1c drifts above 7.5% versus 8.5%? What is the difference in the risk of onset DPN if patients have their A1c monitored every 3 months versus every 6 months and initiate insulin therapy the first time their A1c drifts above 8.5%? We note that the intervention regimens of interest now involve adaptive treatment decisions combined with static (i.e., non-adaptive) monitoring decisions for the biomarker that is used to personalize treatment decisions.

The effect of such intervention regimens on all other endogenous variables in the causal model is defined by the modified NPSEM with the following structural equations for the action variables X={Aˉ1(K),Aˉ2(K),Nˉ(K)}:

  1. A2(t)=fA2(t)(PA2(t)0,UA2(t),UA2(t))=Y(t)fA2(t)(PA2(t)0,UA2(t))+(1Y(t))a2(t)

  2. A1(t)=fA1(t)(PA1(t)0,UA1(t),UA1(t))=Y(t)fA1(t)(PA1(t)0,UA1(t))+(1Y(t))dx(t)(PA1(t)) where PA1(t) is defined as PA1(t)0 with the difference that the variables Iˉ0(t) are replaced with the variables Iˉ(t), i.e., PA1(t)(Yˉ(t),Zˉ(t),Iˉ(t),Aˉ2(t),Aˉ1(t1),Nˉ(t1))

  3. N(t)=fN(t)(PN(t)0,UN(t),UN(t))=Y(t)fN(t)(PN(t)0,UN(t))+(1Y(t))n(t)

for any given distribution PUU and a particular choice of mapping dx(t):PA1(t)a1(t) for t=0,,K from past observed variables into a treatment intervention at time t corresponding with the dynamic intervention of interest. We will also denote the counterfactual variables Y(t), Z(t), I0(t), I(t), A2(t), A1(t) and N(t) defined by the modified NPSEM just described by Ydx,nˉ(t), Zdx,nˉ(t), I0dx,nˉ(t), Idx,nˉ(t), A2dx,nˉ(t), A1dx,nˉ(t) and Ndx,nˉ(t), respectively. Note that to simplify notation, we omit the use of the subscript aˉ2(K) and thus make the intervention on the right-censoring variables implicit in the notation of these counterfactual variables. We denote the support of the counterfactual treatment and monitoring processes Aˉ1dx,nˉ(K) and Nˉdx,nˉ(K) by Aˉdx,nˉ and Nˉdx,nˉ, respectively.

4.4 Static intervention on the right-censoring variables combined with a stochastic intervention on the monitoring variables and a dynamic intervention on the treatment variables

In this section, we consider a general class of monitoring interventions which can be used to address four types of CER questions that are each illustrated below before formalizing the definition of these interventions with a unifying notation.

So far, the static monitoring intervention considered required that patients adhere to a rigid A1c testing schedule with no tolerance for even slight deviations (i.e., advanced or delayed monitoring). Here, we consider more realistic monitoring interventions that can reflect real-world adherence to monitoring guidelines. More specifically, we formalize the definition of counterfactual outcomes involved in the evaluation of the following types of diabetes CER questions: (Q1) What is the difference in the risk of onset DPN if patients’ A1c are monitored on average every 3 versus 6 months and patients initiate insulin therapy the first time their A1c drifts above 8.5%? The monitoring interventions of interest are now stochastic. In addition, we also consider here adaptive (deterministic or stochastic) monitoring interventions which allow the personalization of monitoring decisions over time based on the patient’s latest observed condition. More specifically, we also formalize below the definition of counterfactual outcomes involved in the evaluation of the following types of diabetes CER questions: (Q2) What is the difference in the risk of onset DPN if patients initiate insulin therapy the first time their A1c drifts above 8.5% and their A1c is monitored on average every 3 versus 6 months as long as their latest A1c remain below 7% and on average every 3 months otherwise? The monitoring intervention of interest is now, not only, stochastic, but also adaptive. We note that, to formally evaluate the effects of interest in the previous two examples, the analyst must first define the monitoring interventions of interest more precisely by specifying monitoring distributions that would result in patients having on average their A1c collected every 3 or 6 months (possibly conditional on the last observed A1c value). Many such distributions can be chosen and each would lead to a different effect measure. While real-world adherence to the stochastic interventions above is more realistic than adherence to the static intervention described in the previous sections, they do not accommodate for the occurrence of unexpected events (e.g., severe hypoglycemia) which would require additional monitoring in practice. To avoid arbitrary specification of monitoring distributions and to further increase the relevance of the evidence generated to real-world settings, we also consider here alternate monitoring interventions which require that gaps between two A1c test not exceed a given threshold. More specifically, we also formalize here the definition of counterfactual outcomes involved in the evaluation of the following types of diabetes CER questions: (Q3) What is the difference in the risk of onset DPN if A1c monitoring precludes gaps between measurements greater than 6 versus 12 months and patients initiate insulin therapy the first time their A1c drifts above 8.5%? The monitoring interventions of interest are now restricted to only enforcing monitoring as soon as the patient’s last A1c measurement is 6-month (or 12-month) old and A1c monitoring is not intervened upon in between such monitoring interventions (i.e., monitoring follows the natural decision process of the setting in which the study is conducted). Finally, we also consider here monitoring interventions that are defined by uniformly increasing or decreasing the probability of A1c monitoring at each time point defined by the natural decision process of the study. More specifically, we also formalize here the definition of counterfactual outcomes involved in the evaluation of the following types of diabetes CER questions: (Q4) What is the difference in the risk of onset DPN if at each time point 10% versus 20% of patients who would otherwise not be monitored had their A1c tested and all patients initiate insulin therapy the first time their A1c drifts above 8.5%?

The effect of any one of the intervention regimens described above on all other endogenous variables in the causal model is defined by the modified NPSEM with the following structural equations for the action variables X={Aˉ1(K),Aˉ2(K),Nˉ(K)}:

  1. A2(t)=fA2(t)(PA2(t)0,UA2(t),UA2(t))=Y(t)fA2(t)(PA2(t)0,UA2(t))+(1Y(t))a2(t)

  2. A1(t)=fA1(t)(PA1(t)0,UA1(t),UA1(t))=Y(t)fA1(t)(PA1(t)0,UA1(t))+(1Y(t))dx(t)(PA1(t))

  3. N(t)=fN(t)(PN(t)0,UN(t),UN(t))=Y(t)fN(t)(PN(t)0,UN(t))+(1Y(t))hN(t)(PN(t),UN(t),fN(t)(PN(t)0,UN(t))) where PN(t) is defined as PN(t)0 with the difference that the variables Iˉ0(t) are replaced with the variables Iˉ(t), i.e., PN(t)(Yˉ(t),Zˉ(t),Iˉ(t),Aˉ2(t),Aˉ1(t),Nˉ(t1)),

for a particular choice of distribution PUU and functions hN(t). The argument fN(t)(PN(t)0,UN(t)) of the function hN(t) represents the monitoring variable (denoted by N0(t)) that would be observed if the monitoring intervention at time t was not carried out (i.e., what we referred to as the natural monitoring decision process in the examples above). Thus, except when t=0, this monitoring variable is not the observed monitoring variable N(t) because PN(t)0PN(t)0. As a result, the definition of the function hN(t) above allows the specification of a monitoring intervention at time t that can be defined as a perturbation of the counterfactual monitoring variable N0(t) defined by the previous treatment, monitoring, and censoring interventions. We note that the conditional probability (denoted by g) of the counterfactual variable N(t) above given its parents will not typically be degenerate for a general choice of functions hN(t) and distribution PUU. The notation g thus symbolizes the stochastic intervention on the monitoring variables which is entirely defined by the choice of distribution PUU and function hN(t). Consequently, we also denote the counterfactual variables Y(t), Z(t), I0(t), I(t), A2(t), A1(t) and N(t) defined by the modified NPSEM just described by Ydx,g(t), Zdx,g(t), I0dx,g(t), Idx,g(t), A2dx,g(t), A1dx,g(t) and Ndx,g(t), respectively. Note that here again, we omit the use of the subscript aˉ2(K) and thus make the intervention on the right-censoring variables implicit in the notation of these counterfactual variables. Similarly, we also denote the counterfactual variable N0(t)fN(t)(PN(t)0,UN(t)) by Ndx,g0(t). We denote the support of the counterfactual treatment and monitoring processes Aˉ1dx,g(K) and Nˉdx,g(K) by Aˉdx,g and Nˉdx,g, respectively.

We now illustrate how particular choices for the function hN(t) in the modified NPSEM above allow the definition of each of the four types of stochastic monitoring interventions described in the four examples of CER questions outlined earlier. The effect of the stochastic monitoring intervention from CER question (Q1) that requires A1c testing on average every 3 months can be formalized using hN(t):(UN(t),Nˉ(t1))I(UN(t)uNˉ(t1)) with

uN¯*(t1)=0ifN*(t1)=1=14ifN*(t2)=1andN*(t1)=0=23ifN*(t3)=1andN*(t2)=N*(t1)=0=1ifN*(t4)=1andN*(t3)=N*(t2)=N*(t1)=0=0otherwise

where the disturbance UN(t) is distributed uniformly between 0 and 1 and independent of all other disturbances and where I() denotes the indicator function. The effect of the stochastic adaptive monitoring interventions from CER question (Q2) can similarly be formalized using hN(t):(UN(t),Nˉ(t1),Iˉ(t))I(UN(t)uNˉ(t1),Iˉ(t)) with the differences that the values uNˉ(t1),Iˉ(t) are now also defined based on the past observed A1c measurements Iˉ(t). The effect of the adaptive monitoring intervention from CER question (Q3) that precludes a gap between A1c testing greater than 6 months can be formalized using hN(t):(Nˉ(t1),fN(t)(PN(t)0,UN(t)))fN(t)(PN(t)0,UN(t))I(Nˉ(t6,t1)0). Finally, the monitoring interventions from CER question (Q4) can be formalized using hN(t):(UN(t),fN(t)(PN(t)0,UN(t)))I(UN(t)δ1fN(t)(PN(t)0,UN(t))) with δ=0.1 or 0.2.

4.5 Static intervention on the right-censoring variables and a subset of the monitoring variables combined with a dynamic intervention on the treatment variables

In this section, we formalize the definition of counterfactual variables involved in the two identifiability results presented later in this paper. They are defined by the interventions introduced in Section 4.3 with the difference that the interventions on the monitoring variables N(t) are now restricted to the subset of monitoring variables identified by the time points t when the static monitoring interventions n(t) are equal to 1.

The effect of such an intervention regimen on all other endogenous variables in the causal model is defined by the modified NPSEM with the following structural equations for the action variables X={Aˉ1(K),Aˉ2(K),Nˉ(K)}:

  1. A2(t)=fA2(t)(PA2(t)0,UA2(t),UA2(t))=Y(t)fA2(t)(PA2(t)0,UA2(t))+(1Y(t))a2(t)

  2. A1(t)=fA1(t)(PA1(t)0,UA1(t),UA1(t))=Y(t)fA1(t)(PA1(t)0,UA1(t))+(1Y(t))dx(t)(PA1(t))

  3. N(t)=fN(t)(PN(t)0,UN(t),UN(t))=Y(t)fN(t)(PN(t)0,UN(t))+(1Y(t))fN(t)(PN(t)0,UN(t))1n(t)

for any given distribution PUU and a particular choice of dynamic treatment intervention dx(t):PA1(t)a1(t) for t=0,,K. We note that the conditional probability (denoted by g) of the counterfactual variable N(t) above given its parents will not typically be degenerate for a general choice of static monitoring regimen nˉ. By analogy with the effect definition described in the previous section, one may thus view the intervention on monitoring above as a stochastic intervention on the monitoring process Nˉ(t) such that the distribution of the resulting counterfactual monitoring variable N(t) is defined as degenerate at 1 for time points t when n(t)=1 and defined by the distribution PU and functions fN(t) otherwise. Consequently, we also denote the counterfactual variables Y(t), Z(t), I0(t), I(t), A2(t), A1(t) and N(t) defined by the modified NPSEM just described by Ydx,g(t), Zdx,g(t), I0dx,g(t), Idx,g(t), A2dx,g(t), A1dx,g(t) and Ndx,g(t), respectively. Note that here again, we omit the use of the subscript aˉ2(K) and thus make the intervention on the right-censoring variables implicit in the notation of these counterfactual variables. We denote the support of the counterfactual treatment and monitoring processes Aˉ1dx,g(t) and Nˉdx,g(K) by Aˉdx,g and Nˉdx,g, respectively.

5 No direct effect (NDE) assumption

We denote, respectively, by Aˉ and Nˉ, the union of the supports of the counterfactual treatment processes Aˉ1(K) and counterfactual monitoring processes Nˉ(K) introduced in Section 4.2 for any choices of static treatment and monitoring interventions aˉ1 and nˉ:

(1)A¯*a¯*1,n¯*A¯a¯*,n¯*
(2)N¯*a¯*1,n¯*N¯a¯*,n¯*.

We note that these sets contain the supports of, not only, the observed treatment and monitoring processes, but also the supports of the various counterfactual treatment and monitoring processes defined in Section 4 based on specific choices for aˉ1, nˉ, dx, dx, and hN(t), i.e.,

A¯*A¯A¯a¯*A¯a¯*,n¯*A¯dx,n¯*A¯dx,gA¯dx*,g*N¯*N¯N¯a¯*N¯a¯*,n¯*N¯dx,n¯*N¯dx,gN¯dx*,g*.

We define the NDE assumption as the following set of equalities:

(3)fY(t+1)(PYa¯*,n¯*(t+1)0,UY(t+1))=fY(t+1)(PYa¯*,n¯*0(t+1),n¯*',UY(t+1))fZ(t+1)(PZa¯*,n¯*(t+1)0,UZ(t+1))=fZ(t+1)(PZa¯*,n¯*0(t+1),n¯*,UZ(t+1))fI0(t+1)(PI0a¯*,n¯*(t+1)0,UI0(t+1))=fI0(t+1)(PI0a¯*,n¯*(t+1)0,n¯*,UI0(t+1))}forallt=0,,K,a¯*1A¯*,and(n¯*,n¯*)N¯*2

where we use the generic notation PX(t+1),nˉ0 to denote the vector of variables defined by the parents PX(t+1)0 of the counterfactual variable X(t+1) in which the monitoring variables Nˉ(t) are replaced by the fixed values nˉ(t). The equalities above encode the assumption that the NPSEM functions that generate the covariates Y(t+1), Z(t+1), and I0(t+1) for t=0,,K return the same values whether their input arguments are set to the vector of their respective counterfactual parents under the static right-censoring, treatment, and monitoring interventions aˉ2=0, aˉ1Aˉ, nˉNˉ from Section 4.2 or set to the same vector in which the counterfactual monitoring history Nˉaˉ,nˉ(t) is replaced with any other monitoring history nˉNˉ.

We note that the NDE assumption is implied by the assumption that the functions fY(t), fZ(t) and fI0(t) do not depend on the monitoring process Nˉ(t1) for t1. As illustrated in Figure 1, the latter exclusion restrictions can be encoded graphically in a Directed Acyclic Graph (DAG) with the absence of arrows from a node N(t) to any subsequent covariate nodes Y(j), Z(j), and I0(j) for j>t. Such exclusion restrictions do not preclude however the existence of directed paths from a node N(t) to any subsequent covariate nodes Y(j), Z(j), and I0(j) but requires that all such paths be intercepted by treatment or censoring nodes A2(j) or A1(j) for j>t.

In Appendix B, we show that the NDE assumption above is equivalent to the following equalities between the counterfactuals introduced in Sections 4.1 and 4.2:

(4)L0aˉ,nˉ(t)=L0aˉ(t)forallt=1,,K+1,aˉ1Aˉ,andnˉNˉ

We note that this latter formulation of the NDE assumption was introduced in prior published work [4] which was not based on an NPSEM and in which counterfactuals were instead introduced as primitives [31].

We also define the weak NDE assumption (which is implied by the NDE assumption above) as the upholding of one of the following two sets of equalities defined by the same choice of interventions nˉ, dx, and dx:

(5)fY(t+1)(PYdx*,g*(t+1)0,UY(t+1))=fY(t+1)(PYdx*,g*(t+1),N¯dx,n¯*(t)0,UY(t+1))fZ(t+1)(PZdx*,g*(t+1)0,UZ(t+1))=fZ(t+1)(PZdx*,g*(t+1),N¯dx,n¯*(t)0,UZ(t+1))fI0(t+1)(PI0dx*,g*(t+1)0,UI0(t+1))=fI0(t+1)(PI0dx*,g*(t+1),N¯dx,n¯*(t)0,UI0(t+1))}forallt=0,,Kor
(6)fY(t+1)(PYdx,n¯*(t+1)0,UY(t+1))=fY(t+1)(PYdx,n¯*(t+1),N¯dx*,g*(t)0,UY(t+1))fZ(t+1)(PZdx,n¯*(t+1)0,UZ(t+1))=fZ(t+1)(PZdx,n¯*(t+1),N¯dx*,g*(t)0,UZ(t+1))fI0(t+1)(PI0dx,n¯*(t+1)0,UI0(t+1))=fI0(t+1)(PI0dx,n¯*(t+1),N¯dx*,g*(t)0,UI0(t+1))}forallt=0,,K.

The equalities eq. (5) (resp. eq. (6)) above encode the assumption that the NPSEM functions that generate the covariates Y(t+1), Z(t+1), and I0(t+1) for t=0,,K return the same values whether their input arguments are set to the vector of their respective counterfactual parents under the interventions from Section 4.5 (resp. Section 4.3) or set to the same vector in which the counterfactual monitoring history Nˉdx,g(t) (resp. Nˉdx,nˉ(t)) is replaced with the counterfactual monitoring history Nˉdx,nˉ(t) from Section 4.3 (resp. Nˉdx,g(t) from Section 4.5).

Figure 1: Example of a Directed Acyclic Graph consistent with the general NPSEM introduced in Section 3. This graph assumes, in particular, that all disturbances are mutually independent, that the nodes Y(t)$$Y(t)$$ and Z(t)$$Z(t)$$ share the same parents (with t=1,2$$t= 1, 2$$), and that right-censoring is completely at random. The exclusion of the arrows represented with dashed lines in this diagram graphically encodes the upholding of the NDE assumption introduced in Section 5.
Figure 1:

Example of a Directed Acyclic Graph consistent with the general NPSEM introduced in Section 3. This graph assumes, in particular, that all disturbances are mutually independent, that the nodes Y(t) and Z(t) share the same parents (with t=1,2), and that right-censoring is completely at random. The exclusion of the arrows represented with dashed lines in this diagram graphically encodes the upholding of the NDE assumption introduced in Section 5.

6 Identifiability result 1

In Appendix C, we prove the following equalities of counterfactuals.

Theorem 1

For any given dynamic treatment intervention dx defined in Section 4.3 and any given static monitoring intervention nˉ, if the dynamic treatment intervention dx is defined as the dynamic treatment intervention dx applied using only the information from the past covariate process Iˉ(t) available under both the actual observed monitoring process and the static monitoring regimen nˉ, i.e., for t=0,,K:

(7)dx(t)(PA1(t))dx(t)(Γnˉ(PA1(t)))

with the function Γnˉ:PA1(t)PA1(t)nˉ(Lˉ(t),Aˉ2(t),Aˉ1(t1),Nˉ(t1)) defined by

(8)N(j)Y(j)N(j1)+(1Y(j))n*(j)N(j)forj=0,,t1L(j)(Y(j),Z(j),I(j))suchthatI(j)Y(j)I(j1)+(1Y(j))×n*(j1)I(j)forj=0,,t(N(1)andn*(1)arenilbyconvention)}

then, if the (weak) NDE assumption also holds, the counterfactual outcomes defined in Section 4.3 by a static intervention on the monitoring variables nˉ combined with the dynamic treatment intervention dx equal the counterfactual outcomes defined in Section 4.5 by a stochastic intervention g on the monitoring variables combined with the dynamic treatment intervention dx defined above, i.e.:

(9)Ydx,nˉ(t+1)=Ydx,g(t+1)fort=0,,K,

and the following counterfactual equalities also hold:

(10)Z¯dx,n¯*(t)=Z¯dx*,g*(t)I¯0dx,n¯*(t)=I¯0dx*,g*(t)I¯dx,n¯*(t)=I¯dx*,g*(t)A¯2dx,n¯*(t)=A¯2dx*,g*(t)A¯1dx,n¯*(t)=A¯1dx*,g*(t)N¯dx,n¯*(t)=N¯dx*,g*(t)}fort=0,,K,

where we recall (see Section 4.5 for details) that the stochastic intervention g on the monitoring process is entirely defined by a static intervention on a subset of the monitoring variables before failure (setting them to 1 whenever n(t)=1 while all other monitoring variables are not intervened upon).

7 Identifiability result 2

In Appendix D, we prove the following results.

Theorem 2

The following equality (13) holds for each t=1,,K+1 and any intervention regimen on the action variables A1(t), A2(t), N(t) as defined in Section 4.4 that satisfies both the following conditional independences:

(11)A2*(t)(UA1(j),UN(j),UL0(j+1),UA2(j+1))j=t,,K|PA2*(t)0,UA2(t),A1*(t)((UN(j),UL0(j+1),UA2(j+1),UA1(j+1))j=t,,K1,UN(K),UL0(K+1),UA2(K+1))|PA1*(t)0,UA1(t),N*(t)((UL0(j),UA2(j),UA1(j),UN(j))j=t+1,,K,UL0(K+1),UA2(K+1))|PN*(t)0,UN(t),

for t=0,,K with UL0(j)(UY(j),UZ(j),UI0(j)), and the constraint that the functions hN(t) are not dependent on the counterfactual monitoring variables, N0(t)=fN(t)(PN(t)0,UN(t)), i.e.:

(12)hN(t)(PN(t),UN(t),N0(t))=lN(t)(PN(t),UN(t))

for a function lN(t) of only PN(t) and UN(t):

(13)E(Ydx,g(t))=nˉ(t1)E(Ydx,nˉ(t)j=0t1g(Ndx,nˉ(j)PNdx,nˉ(j))I(Ndx,nˉ(j)=n(j))Ydx,nˉ(j)),

where nˉ is defined by an arbitrary choice for nˉ(t,K), I() denotes the indicator function, and the functions g are defined by the distribution of the counterfactual variables introduced in Section 4.4 as follows:

g(n(j)pn(j))=P(Ndx,g(j)=n(j)PNdx,g(j)=pn(j))=PU,U*((UN(j),U*N(j))fpn(j)0*1(n(j))PNdx,g(j)0=pn(j)0),

when the conditional probabilities on the right-hand side are well-defined (i.e., the conditional event has non-zero probability) and otherwise (e.g., when aˉ2(j)0), by convention,

g(n(j)pn(j))=PU,U*((UN(j),U*N(j))fpn(j)0*1(n(j)))

where we use pn(j)(lˉ(j),aˉ2(j),aˉ1(j),nˉ(j1)) with lˉ(j)(yˉ(j),zˉ(j),iˉ(j)), pn(j)0(lˉ0(j),aˉ2(j),aˉ1(j),nˉ(j1)) with lˉ0(j)(yˉ(j),zˉ(j),iˉ0(j)) for any given i0(k) such that i(k)=n(k1)i0(k), and fpn(j)01(n(j))={(uN(j),uN(j)):fN(j)(pn(j)0,uN(j),uN(j))=n(j)}.

Alternatively, the previous equality (13) also holds even when the functions hN(t) are dependent on the counterfactual monitoring variables, N0(t)=fN(t)(PN(t)0,UN(t)), if, not only, the intervention regimen on the action variables A1(t), A2(t), N(t) defined in Section 4.4 satisfies the previous conditional independences (11), but also if both the following conditional independences hold

(14)UN(t)(UL0(j))j=t+1,,K|(UL0(j),UA2(j),UA1(j))j=0,,t,(UN(j))j=0,,t1fort=0,,K

and the functions fN(t) are not dependent on the latent variables Iˉ0(t) for t=0,,K:

(15)fN(t)(PN(t)0,UN(t))=fN(t)(PN(t),UN(t))

for a function fN(t) of only the observed parents PN(t) and UN(t).

In addition, if both the previous equality (13) and the (weak) NDE assumption hold then the following equality also holds:

(16)E(Ydx,g(t))=nˉ(t1)E(Ydx,g(t)j=0t1g(Ndx,g(j)PNdx,g(j))I(Ndx,g(j)=n(j))Ydx,g(j)),

where we use the definition for the interventions dx and g given in Theorem 1, PNdx,g(j)(Lˉdx,g(j),Aˉ2dx,g(j),Aˉ1dx,g(j),Nˉdx,g(j1)) and we recall the definitions Ldx,g(j)(Ydx,g(j),Zdx,g(j),Idx,g(j)), Idx,g(j)Ydx,g(j)Idx,g(j1)+(1Ydx,g(j))n(j1)Idx,g(j), and Ndx,g(j)Ydx,g(j)Ndx,g(j1)+(1Ydx,g(j))n(j)Ndx,g(j).

Equality (16) corresponds to equality (13) with the difference that all counterfactual variables resulting from the joint treatment and monitoring interventions dx and nˉ on the right-hand side of equality (13) are replaced with counterfactual variables resulting from the joint treatment and monitoring interventions dx and g (using the counterfactual equalities from Theorem 1).

We note that while the conditional independence assumptions (11) and condition (12) only put constraints on the definition of intervention regimens (specified by the analyst) for which equalities (13) and (16) can hold, the conditional independences (14) and exclusion restriction (15) can be viewed instead as causal assumptions since they restrict the class of NPSEM (not under the analyst’s control) for which these equalities can hold.

In practice and as illustrated with the four monitoring intervention types (Q1–Q4) described in Section 4.4, the conditional independence assumptions (11) will typically hold since interventions that have been commonly considered in real-data analyses can be defined using disturbances U (specified by the analyst) that are independent of each other and of all disturbances U. However, condition (12) precludes stochastic monitoring interventions that are defined based on the monitoring decisions (N0(t)) that would naturally occur under no monitoring interventions such as two of the four types of interventions illustrated in Section 4.4, more specifically, the interventions involved in the CER questions (Q3) and (Q4). In particular, this assumption also excludes monitoring interventions of the type “intention-to-treat” where monitoring variables are only intervened upon up to occurrence of some events (e.g., start of treatment).

The conditional independences (14) holds in practice if it can be assumed that all backdoor paths from any given monitoring node N(t) to all subsequent covariates including the latent variables I0(j) are blocked by conditioning on past treatment, right-censoring, monitoring and covariates (including the past latent variables I0(j)). The exclusion restriction (15) corresponds with the assumption of no arrows from any node I0(j) to any subsequent monitoring node N(k) for kj in a DAG (past latent covariates can have however an indirect effect on monitoring through past observed covariates).

8 Practical relevance

Although the exploitation of the two identifiability results in this article to derive alternate NDE-based estimators of the joint effect of a dynamic treatment intervention and a general monitoring intervention will be detailed in separate work, we briefly illustrate below the practical implications of the formal results presented above with a simple example introduced in Section 4.3.

To address the diabetes CER question “What is the difference in the risk of onset DPN if patients have their A1c monitored every 3 months versus every 6 months and initiate insulin therapy the first time their A1c drifts above 8.5%?”, we would aim to evaluate the following causal estimands for t=0,,K:

E(Ydx,nˉ1(t+1))E(Ydx,nˉ2(t+1)),

where t is expressed in months from study entry, dx represents the dynamic A1c-based insulin initiation strategy of interest, and nˉ1 and nˉ2 denote the two static monitoring interventions corresponding with A1c testing every 3 and 6 months respectively, i.e., nˉ1=(1,0,0,1,0,0,) and nˉ2=(1,0,0,0,0,0,1,0,0,0,0,0,).

At each time point t, each of the two counterfactual cumulative risks of interest ψdx,nˉE(Ydx,nˉ(t+1)) for nˉ=nˉ1,nˉ2 can be evaluated using the following estimating function derived from a straightforward extension of prior results [1, 2, 3, 4, 5, 6] on dynamic marginal structural modeling by IPW estimation:

Ddx,nˉbdipw(Og0,ψ)=j=0Tˇ(t)I(A2(j)=0)I(A1(j)=dx(j)(PA1(j)))I(N(j)=n(j))j=0Tˇ(t)g0(A2(j)PA2(j))g0(A1(j)PA1(j))g0(N(j)PN(j))(Y(t+1)ψ),

where the notation g0 in the denominator refers to the conditional probabilities (defined by P0) of each action variable given the subset of its observed parents and the notation Tˇ(t) represents the minimum of time t and the patient’s follow-up time, i.e., Tˇ(t)=min(t,T,C), with T denoting the failure time when it occurs, i.e., Tmin{j=0,,K:Y(j+1)=1} and is nil if Yˉ(K+1)=0, and C denoting the right-censoring time when it occurs, i.e., Cmin{j=0,,K:A2(j)=1} and is nil if Aˉ2(K+1)=0. Thus, the following solution of the estimating equation associated with this estimating function defines a consistent and asymptotically linear estimator [19] of ψdx,nˉ referred to as the standard bounded [32] IPW estimator and denoted by ψˆdx,nˉbdipw:

(17)i=1nw(Oi)j=1nw(Oj)Yi(t+1),

with

(18)w(Oi)j=0Tˇi(t)I(A2,i(j)=0)I(A1,i(j)=dx(j)(PA1(j),i))I(Ni(j)=n(j))j=0Tˇi(t)g0(A2,i(j)PA2(j),i)g0(A1,i(j)PA1(j),i)g0(Ni(j)PN(j),i),

and where the subscript i is used to identify each of the n independent and identically distributed copies of the observed data process O (or, by extension, any components of O) defined in Section 2.

If the NDE assumption holds, we can also make use of the equality E(Ydx,nˉ(t+1))=E(Ydx,g(t+1)) implied by Theorem 1 to indirectly develop another IPW estimator of ψdx,nˉ through the evaluation of the causal estimand ψdx,gE(Ydx,g(t+1)) using the same general IPW estimation methodology just described but applied now to the joint dynamic treatment and stochastic monitoring intervention (dx,g) instead of the joint dynamic treatment and static monitoring intervention (dx,nˉ). We recall that the stochastic monitoring intervention g consists of a static intervention on a subset of the monitoring variables before failure (setting them to 1 whenever nˉ(t)=1 while all other monitoring variables are not intervened upon). More specifically at each time point t, each of the counterfactual cumulative risks ψdx,g with nˉ=nˉ1,nˉ2 can be evaluated using the bounded IPW estimator denoted by ψˆdx,gbdipw and defined by expression (17) with the difference that the inverse probability (IP) weights (18) are now defined by:

(19)w(Oi)=j=0Tˇi(t)I(A2,i(j)=0)I(A1,i(j)=dx(j)(PA1(j),i))jTˇi(t):n(j)=1I(Ni(j)=1)j=0Tˇi(t)g0(A2,i(j)PA2(j),i)g0(A1,i(j)PA1(j),i)jTˇi(t):n(j)=1g0(Ni(j)PN(j),i),

where we use bold font to highlight the difference with the IP weights (18) that define the standard IPW estimator ψˆdx,nˉbdipw. The IPW estimator ψˆdx,gbdipw is referred to as the NDE-based bounded IPW estimator of ψdx,nˉ because, although it is foremost an estimator of ψdx,g, Theorem 1 implies that it is also an indirect estimator of ψdx,nˉ when the NDE assumption holds.

We note that the alternate NDE-based IPW estimator ψˆdx,gbdipw of ψdx,nˉ derived above (i.e., estimator (17) with w(Oi) defined by equality (19)) is the bounded, time-to-event analog of the NDE-based unbounded IPW estimator given by expression (30) in Section 6.3.2 of prior published work [4]. Here, we have formalized results that demonstrate that this previously proposed alternate IPW estimator can simply be viewed as a standard IPW estimator for the mean counterfactual outcome Ydx,g(t+1) which, under the NDE, is equal to the mean counterfactual outcome of interest Ydx,nˉ(t+1). An important consequence of this formalization is that, even when the NDE assumption is violated, the inference from the IPW estimator ψˆdx,gbdipw above can remain causally interpretable as the effect of the dynamic treatment intervention dx and stochastic monitoring intervention g. When the NDE assumption also holds, the IPW estimator ψˆdx,gbdipw may not only provide valid inference for the causal estimand originally of interest (i.e., E(Ydx,nˉ(t+1))) as could the standard IPW estimator (17, 18) but, unlike that latter estimator, it relies on a possibly weaker positivity assumption which can translate into improved estimation properties as discussed further below. Another important practical consequence of the identifiability results in this paper is the simplification of the development of NDE-based doubly robust and locally efficient estimators of the effect of joint dynamic treatment and general monitoring interventions. The description of these new estimators is left for future work.

As just noted, consistent estimation of the causal estimand ψdx,nˉ with either the standard bounded IPW estimator ψˆdx,nˉbdipw or its NDE-based analog ψˆdx,gbdipw relies on a positivity assumption about the monitoring decisions Nˉ(K) in the observed data. More specifically, the standard IPW estimator ψˆdx,nˉbdipw relies on the following positivity assumption about the observed monitoring process:

(20)P0(N(j)=n*(j)Y¯(j)=0,Z¯(j),I¯(j),A¯2(j)=0,A¯1(j)=dx,N¯(j1)=n¯*(j1))>0foralltimepointsj=0,,K

while the NDE-based IPW estimator ψˆdx,gbdipw relies on the following alternate positivity assumption about the observed monitoring process:

(21)P0(N(j)=1Y¯(j)=0,Z¯(j),I¯(j),A¯2(j)=0,A¯1(j)=dx*,N¯0(n¯*,j1),N¯1(n¯*,j1)=1)>0onlyforj=0,,Ksuchthatn*(j)=1

where we use the shorthand notation Aˉ1(j)=dx and Aˉ1(j)=dx to represent the conditional events indicating that treatment decisions were made before and at time j according to the dynamic intervention dx and dx, respectively, and where we also use the notation Nˉn(nˉ,j)(N(k))kj:n(k)=n for n=0,1 to represent the monitoring decisions up to time j1 that are (when n=1) or are not (when n=0) intervened upon under intervention g. Interpreting the previous two positivity assumptions in the context of the diabetes example introduced at the beginning of this section can clarify the difference between the two sets of conditions. For instance, if we consider the monitoring intervention nˉ2=(1,0,0,0,0,0,1,0,0,0,0,0,), the first positivity assumption requires that each subject can possibly experience the exact sequence of monitoring decisions nˉ2, i.e., be monitored every 6 months with no additional monitoring in between these monitoring events, whereas the second positivity assumption only requires that each subject can possibly be monitored every 6 months and does not place any constraint on the monitoring decision processes in between these 6-month periodic monitoring events. Thus, as highlighted by the bold font, a quick examination of these two assumptions suggest that the second positivity assumption is weaker than the first because the constraints of strictly positive monitoring probabilities will generally apply to a smaller set of monitoring variables for the intervention g than for the intervention nˉ. The expected practical consequence of this weakening of the positivity assumption for monitoring decisions is improved estimation performance (bias and precision) for the NDE-based IPW estimator ψˆdx,gbdipw compared to that of the standard estimator ψˆdx,nˉbdipw because of the likely more stable IPW weights (19) that result from the exclusion of the terms jTˇi(t):n(j)=0g0(Ni(j)PN(j),i) from the definition of the denominators of the NDE-based IP weights compared to that of the standard IP weights (18). A closer examination of the positivity assumptions above suggests however that, in practice, gains from weakening of the positivity assumption for the monitoring process might be offset by the fact that there might be fewer observations whose treatment history is concordant with following the dynamic intervention dx or the fact that, for these observations, the treatment factors j=0Tˇi(t)g0(A1,i(j)PA1(j)) might be closer to 0 than for the observations whose treatment history is concordant with following the dynamic intervention dx (i.e., for the observations contributing to the standard IPW estimator (17, 18)). Future applied work with simulated and real data should provide practical insights into the relevance of NDE-based estimators by studying the potential trade-off between improved weight stability resulting from an intervention g on fewer monitoring variables and worsened weight stability resulting from poorer adherence to a treatment strategy dx that requires that treatment decisions be made as if some past observed information about the patient’s condition had actually been unobserved. Similarly, such applied work should also illustrate the stronger sequential randomization assumption (SRA) required for consistent estimation of the joint effect of a dynamic treatment intervention and a stochastic (e.g., static) monitoring intervention compared to the weaker SRA required for consistent estimation of the effect of a dynamic treatment intervention (without a monitoring intervention). In particular, it has been argued [4, Section 7] that the stronger SRA requirement will impede applications of these estimators in studies based on standard Electronic Health Records databases “[...] unless we collect data at t on the health status of not only those who return to the clinic at t (which we typically do) but also those who do not come to the clinic a t (which we almost never do)”.

9 Discussion

In this article, we utilized the NPSEM framework to formally derive two identifiability results for evaluating the effect of general joint treatment and monitoring interventions on time-to-event outcomes under a no direct effect assumption. In addition, we illustrated the practical relevance of these identifiability results by showing how one of them can be directly exploited to easily derive a new NDE-based estimator by simply applying a common estimation approach. More specifically, we have shown that our first identifiability result quickly leads to the construction of a bounded IPW estimator for the counterfactual cumulative risk under a joint dynamic treatment intervention and a static monitoring intervention. We also noted that a slightly different NDE-based estimator that can similarly be derived from our first identifiability result corresponds to the unbounded (Horvitz-Thompson) IPW estimator presented in prior work. This unbounded estimator had been formally derived based on the missing data framework for problems with end-of-study outcomes using a novel theorem.

With this paper, our intention is not to emphasize that the IPW estimator developed here is novel or better because it is bounded, NPSEM-based, or applicable to time-to-event outcomes compared to the unbounded alternative developed previously for end-of-study outcomes and derived based on the missing data framework. Instead, we want to highlight how formal derivation of NDE-based estimators can be made transparent and simple using the identifiability results presented here. Indeed, our example shows that the unbounded IPW estimator developed in prior work actually corresponds to a usual (i.e., based on the standard G-computation formula from Robins [18]) IPW estimator that targets a particular causal estimand which happens to equal the intended causal estimand of interest when the NDE assumption holds. If the NDE assumption is violated, our result also directly implies that the estimator can remain causally interpretable. This result is an additional contribution which, to our knowledge, was not formally noted previously.

In short, we propose that results in this paper can, not only, further explicate previously proposed NDE-based IPW estimators but also facilitate the derivation of alternate NDE-based estimators using existing general estimation roadmaps such as those rooted in the standard G-computation formula (e.g., maximum likelihood, IPW, augmented-IPW, and targeted minimum loss based estimators). These results also show that NDE-based estimators can remain causally interpretable even when the NDE assumption is violated.

Funding statement: This study was supported through a Patient-Centered Outcomes Research Institute (PCORI) Award (ME-1403-12506). All statements in this report, including its findings and conclusions, are solely those of the authors and do not necessarily represent the views of the Patient-Centered Outcomes Research Institute (PCORI), its Board of Governors or Methodology Committee.

References

1. Murphy S, van der Laan M, Robins J. Marginal mean models for dynamic treatment regimens. J Am Stat Assoc 2001;96:1410–1424.10.1198/016214501753382327Suche in Google Scholar

2. Hernan MA, Lanoy E, Costagliola D, Robins JM. Comparison of dynamic treatment regimes via inverse probability weighting. Basic Clin Pharmacol Toxicol 2006;98:237–242.10.1111/j.1742-7843.2006.pto_329.xSuche in Google Scholar

3. van der Laan MJ, Petersen ML. Causal effect models for realistic individualized treatment and intention to treat rules. Int J Biostat 2007;3:Article 3. DOI: 10.2202/1557–4679.102210.2202/1557-4679.1022Suche in Google Scholar

4. Robins J, Orellana L, Rotnitzky A. Estimation and extrapolation of optimal treatment and testing strategies. Stat Med 2008;27:4678–4721.10.1002/sim.3301Suche in Google Scholar

5. Cain LE, Robins JM, Lanoy E, Logan R, Costagliola D, Hernan MA. When to start treatment? a systematic approach to the comparison of dynamic regimes using observational data. Int J Biostat 2010;6:Article 18. DOI: 10.2202/1557–4679.121210.2202/1557-4679.1212Suche in Google Scholar

6. Petersen M, Schwab J, Gruber S, Blaser N, Schomaker M, van der Laan M. Targeted maximum likelihood estimation for dynamic and static longitudinal marginal structural working models. J Causal Inference 2014;2:147–185.10.1515/jci-2013-0007Suche in Google Scholar

7. Thall PF, Millikan RE, Sung HG. Evaluating multiple treatment courses in clinical trials. Stat Med 2000;19:1011–1028.10.1002/(SICI)1097-0258(20000430)19:8<1011::AID-SIM414>3.0.CO;2-MSuche in Google Scholar

8. Lavori P, Dawson R. A design for testing clinical strategies: biased adaptive within-subject randomization. J R Stat Soc Ser A 2000;163:29–38.10.1111/1467-985X.00154Suche in Google Scholar

9. Lavori PW, Dawson R. Adaptive treatment strategies in chronic disease. Ann Rev Med 2008;59:443–453.10.1146/annurev.med.59.062606.122232Suche in Google Scholar

10. Murphy SA. An experimental design for the development of adaptive treatment strategies. Stat Med, 2005;24:1455–1481.10.1002/sim.2022Suche in Google Scholar

11. Lavori PW, Dawson R. Dynamic treatment regimes: practical design considerations. Clin Trials 2004;1:9–20.10.1191/1740774S04cn002oaSuche in Google Scholar

12. Murphy S. Optimal dynamic treatment regimes. J R Stat Soc Ser B 2003;65:331–366.10.1111/1467-9868.00389Suche in Google Scholar

13. Ewings FM, Ford D, Walker AS, Carpenter J, Copas A. Optimal CD4 count for initiating HIV treatment: impact of CD4 observation frequency and grace periods, and performance of dynamic marginal structural models. Epidemiology 2014;25:194–202.10.1097/EDE.0000000000000043Suche in Google Scholar

14. Ford D, Robins JM, Petersen ML, Gibb DM, Gilks CF, Mugyenyi P, et al. The impact of different CD4 cell-count monitoring and switching strategies on mortality in HIV-infected African adults on antiretroviral therapy: an application of dynamic marginal structural models. Am J Epidemiol 2015;182:633–643.10.1093/aje/kwv083Suche in Google Scholar

15. Pearl J, Bareinboim E. Transportability of causal and statistical relations: a formal approach. In In Proceedings of the 25th AAAI Conference on Artificial Intelligence, August 7 –11, 2011, San Francisco, CA., Menlo Park, CA: AAAI Press, 2011; 247–254.10.1109/ICDMW.2011.169Suche in Google Scholar

16. Pearl J, Bareinboim E. External validity: from do-calculus to transportability across populations. Stat Sci 2014;29:579–595. 10.21236/ADA563868Suche in Google Scholar

17. Robins JM. Association, causation and marginal structural models. Synthese 1999;121:151–179.10.1023/A:1005285815569Suche in Google Scholar

18. Robins J. A new approach to causal inference in mortality studies with sustained exposure periods - application to control of the healthy worker survivor effect. Math Modell 1986;7:1393–1512.10.1016/0270-0255(86)90088-6Suche in Google Scholar

19. van der Laan MJ, Robins JM. Unified methods for censored longitudinal data and causality. New York: Springer, 2003. 10.1007/978-0-387-21700-0Suche in Google Scholar

20. Bang H, Robins JM. Doubly robust estimation in missing data and causal inference models. Biometrics 2005;61:962–973.10.1111/j.1541-0420.2005.00377.xSuche in Google Scholar PubMed

21. Tsiatis A. Semiparametric theory and missing data. New York: Springer, 2006.Suche in Google Scholar

22. Kang JD, Schafer JL. Demystifying double robustness: a comparison of alternative strategies for estimating a population mean from incomplete data. Stat Sci 2007;22:523–539.10.1214/07-STS227REJSuche in Google Scholar

23. Robins JM. Robust estimation in sequentially ignorable missing data and causal inference models. In Proceedings of the American Statistical Association, Alexandria, VA: American Statistical Association, 2000:6–10.Suche in Google Scholar

24. van der Laan M, Rubin D. Targeted maximum likelihood learning. Int J Biostat 2006;2:Article 11. DOI: 10.2202/1557–4679.104310.2202/1557-4679.1043Suche in Google Scholar

25. van der Laan MJ, Gruber S. Targeted minimum loss based estimation of causal effects of multiple time point interventions. Int J Biostat 2012;8:Article 9. DOI: 10.1515/1557–4679.137010.1515/1557-4679.1370Suche in Google Scholar PubMed

26. van der Laan, MJ, Rose S. Targeted learning: causal inference for observational and experimental data. New York: Springer, 2011.10.1007/978-1-4419-9782-1Suche in Google Scholar

27. Pearl J. Causal diagrams for empirical research. Biometrika 1995;82:669–710.10.1093/biomet/82.4.669Suche in Google Scholar

28. Pearl J. Causal inference in statistics: an overview. Stat Surveys 2009a;3:96–146.10.1214/09-SS057Suche in Google Scholar

29. Pearl J. Causality: models, reasoning, and inference, 2nd ed. Cambridge: Cambridge University Press, 2009b.10.1017/CBO9780511803161Suche in Google Scholar

30. Pearl J. An introduction to causal inference. Int J Biostat 2010a;6: Article 7. DOI: 10.2202/1557-4679.120310.2202/1557-4679.1203Suche in Google Scholar PubMed PubMed Central

31. Pearl J. On the consistency rule in causal inference: axiom, definition, assumption, or theorem? Epidemiology 2010b;21:872–875.10.1097/EDE.0b013e3181f5d3fdSuche in Google Scholar PubMed

32. Robins J, Sued M, Lei-Gomez Q, Rotnitzky A. Comment: Performance of double-robust estimators when “inverse probability” weights are highly variable. Stat Sci 2007;22:544–559.10.1214/07-STS227DSuche in Google Scholar

A Link between the NPSEM and the observed data distribution

For any realization pX(t)0 of the parents PX(t)0 of a given variable X(t), we define the function fpX(t)0:UX(t)fX(t)(pX(t)0,UX(t)) and denote the fiber of any element x(t) in its codomain by fpX(t)01(x(t)) (f1(x(t)) if variable X(t) has no parent, i.e., PX(t)0 is nil), i.e., the following set of realizations of UX(t):

fpX(t)01(x(t))={uX(t):fX(t)(pX(t)0,uX(t))=x(t)}.

Under the causal model encoded by the NPSEM above, the distribution of the vector of disturbances U defines the distribution of the observed data O as follows:

(22)P0(O=o)i¯0(K+1)I(i0(0)=i(0))t=1K+1I(n(t1)i0(t)=i(t))PU((UY(t)fpy(t)01(y(t)),UZ(t)fpZ(t)01(z(t)),UI0(t)fpI0(t)01(i0(t)),UA2(t)fpA2(t)01(a2(0)))t=0,,K+1,(UA1(t)fpA1(t)01(a1(t)),UN(t)fpN(t)01(n(t)))t=0,,K),

where bold font is used to underscore the random variables and we recall that o=(lˉ(K+1),aˉ2(K+1),aˉ1(K),nˉ(K)) with l(t)=(y(t),z(t),i(t)) and l0(t)=(y(t),z(t),i0(t)) for t=0,,K+1.

B Proof of the equivalence between the NPSEM-based (3) and counterfactual-based (4) formulations of the NDE assumption

Proof that the set of equalities (3) implies the set of equalities (4):

Below, we show that the set of equalities (3) implies the following proposition for any k=0,,K, aˉ1Aˉ, and nˉNˉ:

(A){L¯0a¯*,n¯*(k)=L¯0a¯*(k)A¯2a¯*,n¯*(k)=A¯2a¯*(k)A¯1a¯*,n¯*(k)=A¯1a¯*(k)(B){L¯0a¯*,n¯*(k+1)=L¯0a¯*(k+1)A¯2a¯*,n¯*(k+1)=A¯2a¯*(k+1)A¯1a¯*,n¯*(k+1)=A¯1a¯*(k+1),

where we define A1aˉ,nˉ(K+1) and A1aˉ(K+1) as nil by convention.

By definition of the counterfactual variables defined in Section 4.1, we have for any k=0,,K and any aˉAˉ:

Ya¯*(k+1)=fY(k+1)(PYa¯*(k+1)0,UY(k+1))=fY(k+1)((Y¯a¯*(k),Z¯a¯*(k),I¯0a¯*(k),A¯2a¯*(k),A¯1a¯*(k),N¯a¯*(k)),UY(k+1))

where the last equality is derived from the definition of the parents of the counterfactual variable Yaˉ(k+1). If (A) holds then the last equality becomes for any nˉNˉ:

Yaˉ(k+1)=fY(k+1)((Yˉaˉ,nˉ(k),Zˉaˉ,nˉ(k),Iˉ0aˉ,nˉ(k),Aˉ2aˉ,nˉ(k),Aˉ1aˉ,nˉ(k),Nˉaˉ(k)),UY(k+1)),

Because the set Nˉ contains the support of Nˉaˉ(K) (by definition (2)), the set of equalities (3) implies that the right-hand side of the previous equality is equal to fY(k+1)(PYaˉ,nˉ(k+1)0,UY(k+1)). The previous equality thus becomes

(23)Ya¯*(k+1)=fY(k+1)(PYa¯*,n¯*(k+1)0,UY(k+1))=Ya¯*,n¯*(k+1)

where the last equality is directly derived from the definition of the counterfactual outcome Yaˉ,nˉ(k+1) in Section 4.2.

By definition of the counterfactual variables defined in Section 4.1, we have for any k=0,,K and any aˉAˉ:

Za¯*(k+1)=fZ(k+1)(PZa¯*(k+1)0,UZ(k+1))=fZ(k+1)((Y¯a¯*(k+1),Z¯a¯*(k),I¯0a¯*(k),A¯2a¯*(k),A¯1a¯*(k),N¯a¯*(k)),UZ(k+1))

where the last equality is derived from the definition of the parents of the counterfactual variable Zaˉ(k+1). If (A) holds then the last equality becomes for any nˉNˉ:

Zaˉ(k+1)=fZ(k+1)((Yˉaˉ,nˉ(k+1),Zˉaˉ,nˉ(k),Iˉ0aˉ,nˉ(k),Aˉ2aˉ,nˉ(k),Aˉ1aˉ,nˉ(k),Nˉaˉ(k)),UZ(k+1)),

where we also made use of equality (23) (just shown to be implied by equalities (A)). Because the set Nˉ contains the support of Nˉaˉ(K) (by definition (2)), the set of equalities (3) implies that the right-hand side of the previous equality is equal to fZ(k+1)(PZaˉ,nˉ(k+1)0,UZ(k+1)). The previous equality thus becomes

(24)Za¯*(k+1)=fZ(k+1)(PZa¯*,n¯*(k+1)0,UZ(k+1))=Za¯*,n¯*(k+1)

where the last equality is directly derived from the definition of the counterfactual outcome Zaˉ,nˉ(k+1) in Section 4.2.

By definition of the counterfactual variables defined in Section 4.1, we have for any k=0,,K and any aˉAˉ:

I0a¯*(k+1)=fI0(k+1)(PI0a¯*(k+1)0,UI0(k+1))=fI0(k+1)((Y¯a¯*(k+1),Z¯a¯*(k+1),I¯0a¯*(k),A¯2a¯*(k),A¯1a¯*(k),N¯a¯*(k)),UI0(k+1))

where the last equality is derived from the definition of the parents of the counterfactual variable I0aˉ(k+1). If (A) holds then the last equality becomes for any nˉNˉ:

I0aˉ(k+1)=fI0(k+1)((Yˉaˉ,nˉ(k+1),Zˉaˉ,nˉ(k),Iˉ0aˉ,nˉ(k),Aˉ2aˉ,nˉ(k),Aˉ1aˉ,nˉ(k),Nˉaˉ(k)),UI0(k+1)),

where we also made use of equalities (23) and (24) (both just shown to be implied by equalities (A)). Because the set Nˉ contains the support of Nˉaˉ(K) (by definition (2)), the set of equalities (3) implies that the right-hand side of the previous equality is equal to fI0(k+1)(PI0aˉ,nˉ(k+1)0,UI0(k+1)). The previous equality thus becomes

(25)I0a¯*(k+1)=fI0(k+1)(PI0a¯*(k+1)0,UI0(k+1))=fI0(k+1)((Y¯a¯*(k+1),Z¯a¯*(k+1),I¯0a¯*(k),A¯2a¯*(k),A¯1a¯*(k),N¯a¯*(k)),UI0(k+1))

where the last equality is directly derived from the definition of the counterfactual outcome I0aˉ,nˉ(k+1) in Section 4.2.

We have just shown that equalities (3) imply: (A) Lˉ0aˉ,nˉ(k+1)=Lˉ0aˉ(k+1).

Moreover, by definition of the counterfactual variables defined in Section 4.1, we also have for k=0,K1

A2a¯*(k+1)=Ya¯*(k+1)fA2(k+1)(PA2a¯*(k+1)0,UA2(k+1))+(1Ya¯*(k+1))a2*(k+1)A1a¯*(k+1)=Ya¯*(k+1)fA1(k+1)(PA1a¯*(k+1)0,UA1(k+1))+(1Ya¯*(k+1))a1*(k+1).

We recall from the constraints on fA2(k+1) and fA1(k+1) described in Section 3 and imposed by convention (degenerate variable distributions after failure or censoring) that fA2(k+1)(PA2aˉ(k+1)0,UA2(k+1))=A2aˉ(k) and fA1(k+1)(PA1aˉ(k+1)0,UA1(k+1))=A1aˉ(k) if Yaˉ(k+1)=1. As a result and using equalities (A), (23), and the definition of the counterfactual variables Aˉ2aˉ,nˉ(k+1) and Aˉ1aˉ,nˉ(k+1) defined in Section 4.2, the previous two equalities can be expressed as

A2a¯*(k+1)=Ya¯*,n¯*(k+1)A2a¯*,n¯*(k)+(1Ya¯*,n¯*(k+1))a2*(k+1)=A2a¯*,n¯*(k+1),

and

A1a¯*(k+1)=Ya¯*,n¯*(k+1)A1a¯*,n¯*(k)+(1Ya¯*,n¯*(k+1))a1*(k+1)=A1a¯*,n¯*(k+1).

We have just shown that equalities (3) imply: (A){A¯2a¯*,n¯*(k+1)=A¯2a¯*(k+1)A¯1a¯*,n¯*(k+1)=A¯1a¯*(k+1).

Thus, we have now shown the proposition that, for any k=0,,K, aˉ1Aˉ, and nˉNˉ, if equalities (A) hold then they imply equalities (B) when equalities (3) hold. We now show the proposition that, for any aˉ1Aˉ and nˉNˉ, equalities (A) hold at k=0 when equalities (3) hold.

By definition of the counterfactuals defined in Sections 4.1 and 4.2, we have for any aˉ1Aˉ and nˉNˉ:

{Ya¯*(0)=0Za¯*(0)=fZ(0)((0),UZ(0))I0a¯*(0)=fI0(0)((0,Za¯*(0)),UI0(0))A2a¯*(0)=a2*(0)A1a¯*(0)=fA1(0)((0,Za¯*(0),I0a¯*(0),a2*(0)),UA1(0))

and

{Ya¯*,n¯*(0)=0Za¯*,n¯*(0)=fZ(0)((0),UZ(0))I0a¯*,n¯*(0)=fI0(0)((0,Za¯*,n¯*(0)),UI0(0))A2a¯*,n¯*(0)=a2*(0)A1a¯*,n¯*(0)=fA1(0)((0,Za¯*,n¯*(0),I0a¯*,n¯*(0),a*2(0)),UA1(0)),.

where we used the constraint on fY(0) and parent definitions detailed in Section 3.

These two sets of equalities clearly imply:

{Ya¯*(0)=Ya¯*,n¯*(0)Za¯*(0)=Za¯*,n¯*(0)I0a¯*(0)=I0a¯*,n¯*(0).A2a¯*(0)=A2a¯*,n¯*(0).A1a¯*(0)=A1a¯*,n¯*(0).

By induction, the previous two propositions imply that equalities (4) hold when equalities (3) hold.

Proof that the set of equalities (4) implies the set of equalities (3):

Below, we show that the set of equalities (4) implies the following proposition for any k=0,,K1, aˉ1Aˉ, and (nˉ,nˉ)Nˉ2:

(A){(E(t))t=0,,kA¯2a¯*,n¯*(k)=A¯2a¯*,n¯*(k)A¯1a¯*,n¯*(k)=A¯1a¯*,n¯*(k)(B){(E(t))t=0,,k+1A¯2a¯*,n¯*(k+1)=A¯2a¯*,n¯*(k+1),A¯1a¯*,n¯*(k+1)=A¯1a¯*,n¯*(k+1)

where, for t=0,,K, E(t) denotes the following three equalities:

{fY(t+1)(PYa¯*,n¯*(t+1)0,UY(t+1))=fY(t+1)(PYa¯*,n¯*(t+1),n¯*0,UY(t+1))fZ(t+1)(PZa¯*,n¯*(t+1)0,UZ(t+1))=fZ(t+1)(PZa*,n*(t+1),n¯*0,UZ(t+1))fI0(t+1)(PI0a¯*,n¯*(t+1)0,UI0(t+1))=fI0(t+1)(PI0a¯*,n¯*(t+1),n¯*0,UI0(t+1)).

By definition of the counterfactual variables defined in Section 4.2, we have for any k=0,,K1, aˉ1Aˉ, and nˉNˉ:

A2a¯*,n¯*(k+1)=Ya¯*,n¯*(k+1)fA2(k+1)(PA2a¯*,n¯*(k+1)0,UA2(k+1))+(1Ya¯*,n¯*(k+1))a2*(k+1)A1a¯*,n¯*(k+1)=Ya¯*,n¯*(k+1)fA1(k+1)(PA1a¯*,n¯*(k+1)0,UA1(k+1))+(1Ya¯*,n¯*(k+1))a1*(k+1).

We recall from the constraints on fA2(k+1) and fA1(k+1) described in Section 3 and imposed by convention (degenerate variable distributions after failure or censoring) that fA2(k+1)(PA2aˉ,nˉ(k+1)0,UA2(k+1))=A2aˉ,nˉ(k) and fA1(k+1)(PA1aˉ,nˉ(k+1)0,UA1(k+1))=A1aˉ,nˉ(k) if Yaˉ,nˉ(k+1)=1. As a result and using equalities (A), the previous two equalities become

A2a¯*,n¯*(k+1)=Ya¯*,n¯*(k+1)A2a¯*,n¯*(k)+(1Ya¯*,n¯*(k+1))a2*(k+1)A1a¯*,n¯*(k+1)=Ya¯*,n¯*(k+1)A1a¯*,n¯*(k)+(1Ya¯*,n¯*(k+1))a1*(k+1).

From the set of equalities (4), we have for m=1,,K+1: L0aˉ,nˉ(m)=L0aˉ(m)andL0aˉ,nˉ(m)=L0aˉ(m) and thus L0aˉ,nˉ(m)=L0aˉ,nˉ(m). Because k ranging from 0 to K1 implies k+1 ranges from 1 to K, the latter equality thus implies Yaˉ,nˉ(k+1)=Yaˉ,nˉ(k+1) and we have:

A2a¯*,n¯*(k+1)=Ya¯*,n¯*(k+1)A2a¯*,n¯*(k)+(1Ya¯*,n¯*(k+1))a2*(k+1)A1a¯*,n¯*(k+1)=Ya¯*,n¯*(k+1)A1a¯*,n¯*(k)+(1Ya¯*,n¯*(k+1))a1*(k+1).

Using the definitions of the counterfactual variables defined in Section 4.2 and recalling again that the constraints on fA2(k+1) and fA1(k+1) described in Section 3 imply fA2(k+1)(PA2aˉ,nˉ(k+1)0,UA2(k+1))=A2aˉ,nˉ(k) and fA1(k+1)(PA1aˉ,nˉ(k+1)0,UA1(k+1))=A1aˉ,nˉ(k) if Yaˉ,nˉ(k+1)=1, we obtain

(26)A2a¯*,n¯*(k+1)=A2a¯*,n¯*(k+1)A1a¯*,n¯*(k+1)=A1a¯*,n¯*(k+1)}

We have just shown that equalities (4) imply: (A){A¯2a¯*,n¯*(k+1)=A¯2a¯*,n¯*(k+1)A¯1a*,n*(k+1)=A¯1a*,n*(k+1).

Moreover, by definition of the counterfactual variables in Section 4.2, we have for any k=0,,K1, aˉ1Aˉ, and nˉNˉ:

(i){Ya¯*,n¯*(k+2)=fY(k+2)((Y¯a¯*,n¯*(k+1),Z¯a¯*,n¯*(k+1),I¯0a¯*,n¯*(k+1),A¯2a¯*,n¯*(k+1),A¯1a¯*,n¯*(k+1),N¯a¯*,n¯*(k+1)),UY(k+2))Za¯*,n¯*(k+2)=fZ(k+2)((Y¯a¯*,n¯*(k+2),Z¯a¯*,n¯*(k+1),I¯0a¯*,n¯*(k+1),A¯2a¯*,n¯*(k+1),A¯1a¯*,n¯*(k+1),N¯a¯*,n¯*(k+1)),UZ(k+2))I0a¯*,n¯*(k+2)=fI0(k+2)((Y¯a¯*,n¯*(k+2),Z¯a¯*,n¯*(k+2),I¯0a¯*,n¯*(k+1),A¯2a¯*,n¯*(k+1),A¯1a¯*,n¯*(k+1),N¯a¯*,n¯*(k+1)),UI0(k+2))

where for t=0,,k+1

(j){Ya¯*,n¯*(t)=fY(t)((Y¯a¯*,n¯*(t1),Z¯a¯*,n¯*(t1),I¯0a¯*,n¯*(t1),A¯2a¯*,n¯*(t1),A¯1a¯*,n¯*(t1),N¯a¯*,n¯*(t1)),UY(t))Za¯*,n¯*(t)=fZ(t)((Y¯a¯*,n¯*(t),Z¯a¯*,n¯*(t1),I¯0a¯*,n¯*(t1),A¯2a¯*,n¯*(t1),A¯1a¯*,n¯*(t1),N¯a¯*,n¯*(t1)),UZ(t))I0a¯*,n¯*(t)=fI0(t)((Y¯a¯*,n¯*(t),Z¯a¯*,n¯*(t),I¯0a¯*,n¯*(t1),A¯2a¯*,n¯*(t1),A¯1a¯*,n¯*(t1),N¯a¯*,n¯*(t1)),UI0(t)).

Similarly, for any nˉNˉ, we have:

(ii){Ya¯*,n¯*(k+2)=fY(k+2)((Y¯a¯*,n¯*(k+1),Z¯a¯*,n¯*(k+1),I¯0a¯*,n¯*(k+1),A¯2a¯*,n¯*(k+1),A¯1a¯*,n¯*(k+1),N¯a¯*,n¯*(k+1)),UY(k+2))Za¯*,n¯*(k+2)=fZ(k+2)((Y¯a¯*,n¯*(k+2),Z¯a¯*,n¯*(k+1),I¯0a¯*,n¯*(k+1),A¯2a¯*,n¯*(k+1),A¯1a¯*,n¯*(k+1),N¯a¯*,n¯*(k+1)),UZ(k+2))I0a¯*,n¯*(k+2)=fI0(k+2)((Y¯a¯*,n¯*(k+2),Z¯a¯*,n¯*(k+2),I¯0a¯*,n¯*(k+1),A¯2a¯*,n¯*(k+1),A¯1a¯*,n¯*(k+1),N¯a¯*,n¯*(k+1)),UI0(k+2)).

where for t=0,,k+1

(jj){Ya¯*,n¯*(t)=fY(t)((Y¯a¯*,n¯*(t1),Z¯a¯*,n¯*(t1),I¯a*,n*(t1),A¯2a¯*,n¯*(t1),A¯1a*,n*(t1),N¯a¯*,n¯*(t1)),UY(t))Za¯*,n¯*(t)=fZ(t)((Y¯a¯*,n¯*(t),Z¯a¯*,n¯*(t1),I¯0a¯*,n¯*(t1),A¯2a¯*,n¯*(t1),A¯1a¯*,n¯*(t1),N¯a¯*,n¯*(t1)),UZ(t))I0a¯*,n¯*(t)=fI0(t)((Y¯a¯*,n¯*(t),Z¯a¯*,n¯*(t),I¯0a¯*,n¯*(t1),A¯2a¯*,n¯*(t1),A¯1a¯*,n¯*(t1),N¯a¯*,n¯*(t1)),UI0(t)).

From the set of equalities (4), we have for m=1,,K+1: L0aˉ,nˉ(m)=L0aˉ(m)andL0aˉ,nˉ(m)=L0aˉ(m) and thus L0aˉ,nˉ(m)=L0aˉ,nˉ(m). We also note that equalities (j) and (jj) evaluated at t=0 clearly imply Laˉ,nˉ(0)=Laˉ,nˉ(0). The previous two equalities thus imply Lˉ0aˉ,nˉ(m)=Lˉ0aˉ,nˉ(m) for m=1,,K+1. Because k ranging from 0 to K1 implies k+2 ranges from 2 to K+1, the previous equality thus implies Lˉ0aˉ,nˉ(k+2)=Lˉ0aˉ,nˉ(k+2). Using this last result, equalities (ii) become

{Ya¯*,n¯*(k+2)=fY(k+2)((Y¯a¯*,n¯*(k+1),Z¯a¯*,n¯*(k+1),I¯0a¯*,n¯*(k+1),A¯2a¯*,n¯*(k+1),A¯1a¯*,n¯*(k+1),N¯a¯*,n¯*(k+1)),UY(k+2))Za¯*,n¯*(k+2)=fZ(k+2)((Y¯a¯*,n¯*(k+2),Z¯a¯*,n¯*(k+1),I¯0a¯*,n¯*(k+1),A¯2a¯*,n¯*(k+1),A¯1a¯*,n¯*(k+1),N¯a¯*,n¯*(k+1)),UZ(k+2))I0a¯*,n¯*(k+2)=fI0(k+2)((Y¯a¯*,n¯*(k+2),Z¯a¯*,n¯*(k+2),I¯0a¯*,n¯*(k+1),A¯2a¯*,n¯*(k+1),A¯1a¯*,n¯*(k+1),N¯a¯*,n¯*(k+1)),UI0(k+2))

Using equalities (A) and equality (26) (just shown to be itself implied by equalities (A) and (4)), we obtain

{Ya¯*,n¯*(k+2)=fY(k+2)((Y¯a¯*,n¯*(k+1),Z¯a¯*,n¯*(k+1),I¯0a¯*,n¯*(k+1),A¯2a¯*,n¯*(k+1),A¯1a¯*,n¯*(k+1),N¯a¯*,n¯*(k+1)),UY(k+2))Za¯*,n¯*(k+2)=fZ(k+2)((Y¯a¯*,n¯*(k+2),Z¯a¯*,n¯*(k+1),I¯0a¯*,n¯*(k+1),A¯2a¯*,n¯*(k+1),A¯1a¯*,n¯*(k+1),N¯a¯*,n¯*(k+1)),UZ(k+2))I0a¯*,n¯*(k+2)=fI0(k+2)((Y¯a¯*,n¯*(k+2),Z¯a¯*,n¯*(k+2),I¯0a¯*,n¯*(k+1),A¯2a¯*,n¯*(k+1),A¯1a¯*,n¯*(k+1),N¯a¯*,n¯*(k+1)),UI0(k+2))

We note that if Yaˉ,nˉ(k+1)=0, then the definition of the counterfactual monitoring variables in Section 4.2 implies that all previous counterfactual outcomes are also equal to 0, i.e., Yˉaˉ,nˉ(k+1)=0, and therefore Nˉaˉ,nˉ(k+1)=nˉ(k+1). Otherwise, we note that this equality may not hold. However, if Yaˉ,nˉ(k+1)=1, then the constraints on fY(k+2), fZ(k+2) and fI0(k+2) described in Section 3 imply that the counterfactual monitoring process Nˉaˉ,nˉ(k+1) can nevertheless be replaced by nˉ(k+1) in the previous three equalities since the values of the functions fY(k+2), fZ(k+2) and fI0(k+2) is then equal to Yaˉ,nˉ(k+1)Zaˉ,nˉ(k+1), and I0aˉ,nˉ(k+1), respectively, whatever the value of past covariates (including the monitoring process). The previous three equalities can thus be expressed as

{Ya¯*,n¯*(k+2)=fY(k+2)(PYa¯*,n¯*0(k+2),n¯*,UY(k+2))Za¯*,n¯*(k+2)=fZ(k+2)(PZa¯*,n¯*(k+2),n¯*0,UZ(k+2))I0a¯*,n¯*(k+2)=fI0(k+2)(PI0a¯*,n¯*(k+2),n¯*0,UI0(k+2))

where we use the generic notation PX(t),nˉ0 to denote the vector of variables defined by the parents PX(t+1)0 of the counterfactual variable X(t+1) in which the monitoring variables Nˉ(t) are replaced by the fixed values nˉ(t). By transitivity, the combination of the latter equalities with equalities (i) implies that the equalities E(k+1) hold. We have just shown that equalities (4) imply: A(E(t))t=0,,k+1.

Above, we have shown the proposition that for any k=0,,K1, aˉ1Aˉ, and (n¯*,n¯*)N¯*2, if equalities (A) hold then they imply equalities (B) when equalities (4) hold. We now show the proposition that, for any aˉ1Aˉ and (n¯*,n¯*)N¯*2 equalities (A) hold at k=0 when equalities (4) hold.

By definition of the counterfactuals described in Section 4.2 and the convention that fY(0)(UY0)=0, we have Yaˉnˉ(0)=Yaˉnˉ(0)=0. As a result, the definition of the counterfactuals described in Section 4.2 also implies the equalities Zaˉ,nˉ(0)=Zaˉ,nˉ(0), I0aˉ,nˉ(0)=I0aˉ,nˉ(0), A2aˉnˉ(0)=A2aˉnˉ(0)=a2(0), A1aˉnˉ(0)=A1aˉnˉ(0)=a1(0), Naˉnˉ(0)=n(0), and Naˉnˉ(0)=n(0). We also note that equalities (4) imply the equalities: Laˉ,nˉ(1)=Laˉ,nˉ(1). Using all the previous equalities and the definition of the counterfactuals Laˉ,nˉ(1) described in Section 4.2, we obtain:

(27)Ya¯*,n¯*(1)fY(1)((Ya¯*,n¯*(0),Za¯*,n¯*(0),I0a¯*,n¯*(0),A2a¯*,n¯*(0),A1a¯*,n¯*(0),Na¯*,n¯*(0)),UY(1))=fY(1)((Ya¯*,n¯*(0),Za¯*,n¯*(0),I0a¯*,n¯*(0),A2a¯*,n¯*(0),A1a¯*,n¯*(0),n*(0)),UY(1))=fY(1)(PYa¯*,n¯*0(1),n¯*,UY(1)),Za¯*,n¯*(1)fZ(1)((Y¯a¯*,n¯*(1),Za¯*,n¯*(0),I0a¯*,n¯*(0),A2a¯*,n¯*(0),A1a¯*,n¯*(0),Na¯*,n¯*(0)),UZ(1))=fZ(1)((Y¯a¯*,n¯*(1),Za¯*,n¯*(0),I0a¯*,n¯*(0),A2a¯*,n¯*(0),A1a¯*,n¯*(0),n*(0)),UZ(1))=fZ(1)(PZa¯*,n¯*(1),n¯*0,UZ(1)),I0a¯*,n¯*(1)fI0(1)((Y¯a¯*,n¯*(1),Z¯a¯*,n¯*(1),I0a¯*,n¯*(0),A2a¯*,n¯*(0),A1a¯*,n¯*(0),Na¯*,n¯*(0)),UI0(1))=fI0(1)((Y¯a¯*,n¯*(1),Z¯a¯*,n¯*(1),I0a¯*,n¯*(0),A2a¯*,n¯*(0),A1a¯*,n¯*(0),n*(0)),UI0(1))=fI0(1)(PI0a¯*,n¯*(1),n¯*0,UI0(1)).}

From the definition of the counterfactuals Laˉ,nˉ(1) described in Section 4.2, we also have

(28)Ya¯*,n¯*(1)=fY(1)(PYa¯*,n¯*(1)0,UY(1))Za¯*,n¯*(1)=fZ(1)(PZa¯*,n¯*(1)0,UZ(1))I0a¯*,n¯*(1)=fI0(1)(PI0a¯*,n¯*(1)0,UI0(1)).}

Using the equality Laˉ,nˉ(1)=Laˉ,nˉ(1) implied by equalities (4), the previous two sets of equalities (27) and (28) imply that that the equalities E(0) hold. We have just shown the proposition that equalities (A) hold at k=0 when equalities (4) hold.

By induction, the previous two propositions imply that equalities (3) hold when equalities (4) hold.

C Proof of the first identifiability result

Below, we show that the (weak) NDE assumption (i.e., equalities (3), (5) or (6)) implies the following proposition for any t=1,,K:

(A){L¯0dx,n¯*(t)=L¯0dx*,g*(t)I¯dx,n¯*(t1)=I¯dx*,g*(t1)A¯2dx,n¯*(t1)=A¯2dx*,g*(t1)A¯1dx,n¯*(t1)=A¯1dx*,g*(t1)N¯dx,n¯*(t1)=N¯dx*,g*(t1)(B){L¯0dx,n¯*(t+1)=L¯0dx*,g*(t+1)I¯dx,n¯*(t)=I¯dx*,g*(t)A¯2dx,n¯*(t)=A¯2dx*,g*(t)A¯1dx,n¯*(t)=A¯1dx*,g*(t)N¯dx,n¯*(t)=N¯dx*,g*(t),

where the definition of the dynamic intervention dx is given by (7) for any given dynamic treatment intervention dx defined in Section 4.3 and any given static monitoring intervention nˉ and where the monitoring intervention g is defined in Section 4.5 using the same choice for nˉ.

From the definition of the variables in the causal model given in Section Section 3, their nˉ-specific transformation defined by (8), and the definition of their counterfactual analogs given in 4, we have

(29)Idx,n¯*(t)=Ydx,n¯*(t)Idx,n¯*(t1)+(1Ydx,n¯*(t))Ndx,n¯*(t1)I0dx,n¯*(t)
(30)Idx*,g*(t)=Ydx*,g*(t)Idx*,g*(t1)+(1Ydx*,g*(t))Ndx*,g*(t1)I0dx*,g*(t)

If equalities (A) hold, we have Ydx,nˉ(t)=Ydx,g(t), Idx,nˉ(t1)=Idx,g(t1), Ndx,nˉ(t1)=Ndx,g(t1), and I0dx,nˉ(t)=I0dx,g(t). As a result, equality (29) becomes

Idx,nˉ(t)=Ydx,g(t)Idx,g(t1)+(1Ydx,g(t))Ndx,g(t1)I0dx,g(t).

By transitivity and using equality (30), we obtain

(31)Idx,nˉ(t)=Idx,g(t).

We have just shown: (A)Iˉdx,nˉ(t)=Iˉdx,g(t).

From the definition of the counterfactual variables given in Sections 4.3 and 4.5, we have

(32)A2dx,n¯*(t)=Ydx,n¯*(t)A2dx,n¯*(t1)+(1Ydx,n¯*(t))a2*(t)
(33)A2dx*,g*(t)=Ydx*,g*(t)A2dx*,g*(t1)+(1Ydx*,g*(t))a2*(t).

If equalities (A) hold, equality (32) becomes

A2dx,nˉ(t)=Ydx,g(t)A2dx,g(t1)+(1Ydx,g(t))a2(t).

By transitivity and using equality (33), we obtain

(34)A2dx,nˉ(t)=A2dx,g(t).

We have just shown: (A)Aˉ2dx,nˉ(t)=Aˉ2dx,g(t).

From the definition of the counterfactual variables given in Sections 4.3 and 4.5, we have

(35)A1dx,n¯*(t)=Ydx,n¯*(t)A1dx,n¯*(t1)+(1Ydx,n¯*(t))dx(t)(PA1dx,n¯*(t))
(36)A1dx*,g*(t)=Ydx*,g*(t)A1dx*,g*(t1)+(1Ydx*,g*(t))dx*(t)(PA1dx*,g*(t)).

From the definition of the dynamic interventions dx given by expression (7), equality (36) becomes:

A1dx*,g*(t)=Ydx*,g*(t)A1dx*,g*(t1)+(1Ydx*,g*(t))dx(t)((Y¯dx*,g*(t),Z¯dx*,g*(t),I¯dx*,g*(t),A¯2dx*,g*(t),A¯1dx*,g*(t1),N¯dx*,g*(t1)).

If equalities (A) hold, the previous equality becomes

A1dx*,g*(t)=Ydx,n¯*(t)A1dx,n¯*(t1)+(1Ydx,n¯*(t))dx(t)((Y¯dx,n¯*(t),Z¯dx,n¯*(t),I¯dx,n¯*(t),A¯2dx,n¯*(t),A¯1dx,n¯*(t1),N¯dx,n¯*(t1)).

where we also made use of equalities (31) and (34) (just shown to hold if equalities (A) hold). Using the parent notation, the previous equality can be expressed as

A1dx,g(t)=Ydx,nˉ(t)A1dx,nˉ(t1)+(1Ydx,nˉ(t))dx(t)(PA1dx,nˉ(t)).

By transitivity and using equality (35), we obtain

(37)A1dx,nˉ(t)=A1dx,g(t).

We have just shown: (A)Aˉ1dx,nˉ(t)=Aˉ1dx,g(t).

From the definition of the variables in the causal model given in Section Section 3, their nˉ-specific transformation defined by expression (8), and the definition of their counterfactual analogs given in 4, we have

(38)N*(t)=Y*(t)N*(t1)+(1Y*(t))n*(t)N*(t)
(39)Ndx,n¯*(t)=Ydx,n¯*(t)Ndx,n¯*(t1)+(1Ydx,n¯*(t))n*(t)
(40)Ndx*,g*(t)=Ydx*,g*(t)Ndx*,g*(t1)+(1Ydx*,g*(t))fN(t)(PNdx*,g*(t)0,UN(t))1n*(t).

These equalities imply:

  1. If n(t)=1 and Ydx,g(t)=0 then Ndx,g(t)=Ndx,g(t) from equality (38), Ndx,g(t)=1 from equality (40) and thus Ndx,g(t)=1 by transitivity. If equalities (A) hold, we also have Ydx,nˉ(t)=Ydx,g(t) and therefore Ndx,nˉ(t)=1 from equality (39). As a result, we obtain Ndx,nˉ(t)=Ndx,g(t).

  2. If n(t)=0 and Ydx,g(t)=0 then Ndx,g(t)=0 from equality (38). If equalities (A) hold, we also have Ydx,nˉ(t)=Ydx,g(t) and therefore Ndx,nˉ(t)=0 from equality (39). As a result, we also obtain Ndx,nˉ(t)=Ndx,g(t).

  3. If Ydx,g(t)=1 then we obtain from equalities (A), (38) and (39):

    (41)Ndx*,g*(t)=Ndx*,g*(t1)
    (42)Ndx,n¯*(t)=Ndx,n¯*(t1).

    If equalities (A) hold then Ndx,nˉ(t1)=Ndx,g(t1). By transitivity using the latter equality and equalities (41) and (42), we also obtain Ndx,nˉ(t)=Ndx,g(t).

We have just shown: (A)Nˉdx,nˉ(t)=Nˉdx,g(t).

By definition of the counterfactuals in Section 4.5, we have:

Ydx*,g*(t+1)=fY(t+1)(PYdx*,g*(t+1)0,UY(t+1))Zdx*,g*(t+1)=fZ(t+1)(PZdx*,g*(t+1)0,UZ(t+1))I0dx*,g*(t+1)=fI0(t+1)(PI0dx*,g*(t+1)0,UI0(t+1))}

Because the set Aˉ contains the support of Aˉdx,g(K) and because Nˉ contains the supports of both Nˉdx,g(K) and Nˉdx,nˉ(K) (by definitions (1) and (2)), the right-hand sides of the previous equalities can be modified as follows under the NDE assumption (3):

(43)Ydx*,g*(t+1)=fY(t+1)(PYdx*,g*(t+1),N¯dx,n¯*(t)0,UY(t+1))Zdx*,g*(t+1)=fZ(t+1)(PZdx*,g*(t+1),N¯dx,n¯*(t)0,UZ(t+1))I0dx*,g*(t+1)=fI0(t+1)(PI0dx*,g*(t+1),N¯dx,n¯*(t)0,UI0(t+1))}

where we use the generic notation PX(t+1),Nˉ(t)0 to denote the vector of variables defined by the parents PX(t+1)0 of the counterfactual variable X(t+1) in which the monitoring variables Nˉ(t) are replaced by Nˉ(t). By expanding the parent notation and then making use of equalities (A), (34), and (37) (the last two were just shown to hold if equalities (A) hold), the first of equalities (43) becomes

Ydx*,g*(t+1)=fY(t+1)((Y¯dx*,g*(t),Z¯dx*,g*(t),I¯0dx*,g*(t),A¯2dx*,g*(t),A¯1dx*,g*(t),N¯dx,n¯*(t)),UY(t+1))=fY(t+1)((Y¯dx,n¯*(t),Z¯dx,n¯*(t),I¯0dx,n¯*(t),A¯2dx,n¯*(t),A¯1dx,n¯*(t),N¯dx,n¯*(t)),UY(t+1))=fY(t+1)(PYdx,n¯*(t+1)0,UY(t+1)).

By definition of the counterfactuals in Section 4.3, we also have:

Ydx,nˉ(t+1)=fY(t+1)(PYdx,nˉ(t+1)0,UY(t+1)).

By transitivity, the last two equalities imply:

(44)Ydx,nˉ(t+1)=Ydx,g(t+1).

By expanding the parent notation and then making use of the equality just shown to hold but also equalities (A), (34) and (37), the second of equalities (43) becomes

Zdx*,g*(t+1)=fZ(t+1)((Y¯dx*,g*(t+1),Z¯dx*,g*(t),I¯0dx*,g*(t),A¯2dx*,g*(t),A¯1dx*,g*(t),N¯dx,n¯*(t)),UZ(t+1))=fZ(t+1)((Y¯dx,n¯*(t+1),Z¯dx,n¯*(t),I¯0dx,n¯*(t),A¯2dx,n¯*(t),A¯1dx,n¯*(t),N¯dx,n¯*(t)),UZ(t+1))=fZ(t+1)(PZdx,n¯*(t+1)0,UZ(t+1)).

By definition of the counterfactuals in Section 4.3, we also have:

Zdx,nˉ(t+1)=fZ(t+1)(PZdx,nˉ(t+1)0,UZ(t+1)).

By transitivity, the last two equalities imply:

(45)Zdx,nˉ(t+1)=Zdx,g(t+1).

By expanding the parent notation and then making use of both equalities (44) and (45) just shown to hold but also equalities (A), (34) and (37), the third of equalities (43) becomes

I0dx*,g*(t+1)=fI0(t+1)((Y¯dx*,g*(t+1),Z¯dx*,g*(t+1),I¯0dx*,g*(t),A¯2dx*,g*(t),A¯1dx*,g*(t),N¯dx,n¯*(t)),UI0(t+1))=fI0(t+1)((Y¯dx,n¯*(t+1),Z¯dx,n¯*(t+1),I¯0dx,n¯*(t),A¯2dx,n¯*(t),A¯1dx,n¯*(t),N¯dx,n¯*(t)),UI0(t+1))=fI0(t+1)(PI0dx,n¯*(t+1)0,UI0(t+1)).

By definition of the counterfactuals in Section 4.3, we also have:

I0dx,nˉ(t+1)=fI0(t+1)(PI0dx,nˉ(t+1)0,UI0(t+1)).

By transitivity, the last two equalities imply:

I0dx,nˉ(t+1)=I0dx,g(t+1).

We have just shown that the NDE assumption (3) implies: (A)Lˉ0dx,nˉ(t+1)=Lˉ0dx,g(t+1). We note that the proof of this result also holds under the weak NDE assumption if equalities (5) hold (because equalities (5) imply equalities (43)). If equalities (6) hold instead, then we have:

(46)Ydx,n¯*(t+1)=fY(t+1)(PYdx,n¯*(t+1),N¯dx*,g*(t)0,UY(t+1))Zdx,n¯*(t+1)=fZ(t+1)(PZdx,n¯*(t+1),N¯dx*,g*(t)0,UZ(t+1))I0dx,n¯*(t+1)=fI0(t+1)(PI0dx,n¯*(t+1),N¯dx*,g*(t)0,UI0(t+1)).}

We can then adopt the same reasoning following equalities (43) above to show that equalities (46) imply Lˉ0dx,nˉ(t+1)=Lˉ0dx,g(t+1) when equalities (A) hold.

We have just shown that the (weak) NDE assumption (i.e., equalities (3), (5), or (6)) implies: (A)Lˉ0dx,nˉ(t+1)=Lˉ0dx,g(t+1).

Above, we have shown the proposition that for any t=1,,K, if equalities (A) hold then they imply equalities (B) when the (weak) NDE assumption holds. We now show the proposition that, equalities (A) hold at t=1 when the (weak) NDE assumption holds, i.e., equalities (3), (5), or (6) imply:

{L¯0dx,n¯*(1)=L¯0dx*,g*(1)(A.1)Idx,n¯*(0)=Idx*,g*(0)(A.2)A2dx,n¯*(0)=A2dx*,g*(0)(A.3)A1dx,n¯*(0)=A1dx*,g*(0)(A.4)Ndx,n¯*(0)=Ndx*,g*(0)(A.5)

From the definition of the variables in the causal model given in Section 3, their nˉ-specific transformation defined by expressions (8), and the definition of their counterfactual analogs given in Section 4, we have

(47)Y*(0)=0
(48)Z*(0)=fZ(0)((Y*(0)),UZ(0))
(49)I0*(0)=fI0(0)((Y*(0),Z*(0)),UI0(0))
(50)Idx,n¯*(t)=Ydx,n¯*(t)Idx,n¯*(t1)+(1Ydx,n¯*(t))Ndx,n¯*(t1)I0dx,n¯*(t)
(51)Idx*,g*(t)=Ydx*,g*(t)Idx*,g*(t1)+(1Ydx*,g*(t))Ndx*,g*(t1)I0dx*,g*(t)

From equalities (47), (48), and (49), we have I0dx,nˉ(0)=I0dx,g(0). From equalities (47), (50), and (51) we also have Idx,nˉ(0)=I0dx,nˉ(0) and Idx,g(0)=I0dx,g(0). By transitivity using the last three equalities, we obtain Idx,nˉ(0)=Idx,g(0). We have just shown that equality (A.2) holds.

From the definition of the variables in the causal model given in Section 3 and the definition of their counterfactual analogs given in Section 4, we have

(52)Y(0)=0
(53)A2dx,nˉ(t)=Ydx,nˉ(t)A2dx,nˉ(t1)+(1Ydx,nˉ(t))a2(t)
(54)A2dx,g(t)=Ydx,g(t)A2dx,g(t1)+(1Ydx,g(t))a2(t).

These equalities imply A2dx,nˉ(0)=A2dx,g(0). We have just shown that equality (A.3) holds.

From the definition of the variables in the causal model given in Section 3 and the definition of their counterfactual analogs given in Section 4, we have

(55)Y*(0)=0
(56)Z*(0)=fZ(0)((Y*(0)),UZ(0))
(57)A1dx,n¯*(t)=Ydx,n¯*(t)A1dx,n¯*(t1)+(1Ydx,n¯*(t))dx(t)(PA1dx,n¯*(t))
(58)A1dx*,g*(t)=Ydx*,g*(t)A1dx*,g*(t1)+(1Ydx*,g*(t))dx*(t)(PA1dx*,g*(t)).

From equalities (55), (57), and (58), we have

(59)A1dx,n¯*(0)=dx(0)((Ydx,n¯*(0),Zdx,n¯*(0),Idx,n¯*(0),A2dx,n¯*(0)))
(60)A1dx*,g*(0)=dx*(0)((Ydx*,g*(0),Zdx*,g*(0),Idx*,g*(0),A2dx*,g*(0))).

From the definition of the dynamic interventions dx given by expression (7), equality (60) becomes:

A1dx,g(0)=dx(0)((Ydx,g(0),Zdx,g(0),Idx,g(0),A2dx,g(0))).

From equalities (A.2) and (A.3) (just shown to hold) and because equalities (55) and (56) imply Ydx,nˉ(0)=Ydx,g(0) and Zdx,nˉ(0)=Zdx,g(0), the previous equality becomes

A1dx,g(0)=dx(0)((Ydx,nˉ(0),Zdx,nˉ(0),Idx,nˉ(0),A2dx,nˉ(0))).

By transitivity, the latter equality and equality (59) imply

A1dx,nˉ(t)=A1dx,g(t).

We have just shown that equality (A.4) holds.

From the definition of the variables in the causal model given in Section 3, their nˉ-specific transformation defined by expressions (8), and the definition of their counterfactual analogs given in Section 4, we have

Y*(0)=0N*(t)=Y*(t)N*(t1)+(1Y*(t))n*(t)N*(t)Ndx,n¯*(t)=Ydx,n¯*(t)Ndx,n¯*(t1)+(1Ydx,n¯*(t))n*(t)Ndx*,g*(t)=Ydx*,g*(t)Ndx*,g*(t1)+(1Ydx*,g*(t))fN(t)(PNdx*,g*(t)0,UN(t))1n*(t),

and thus, in particular,

(61)N(0)=n(0)N(0)
(62)Ndx,n¯*(0)=n*(0)
(63)Ndx*,g*(0)=fN(0)(PNdx*,g*(0)0,UN(0))1n*(0).

These last equalities imply:

  1. If n(0)=1 then Ndx,g(0)=Ndx,g(0) from equality (61), Ndx,nˉ(0)=1 from equality (62), Ndx,g(0)=1 from equality (63), and thus Ndx,nˉ(0)=Ndx,g(0) by transitivity.

  2. If n(0)=0 then Ndx,g(0)=0 from equality (61) and Ndx,nˉ(0)=0 from equality (62), and thus Ndx,nˉ(0)=Ndx,g(0) by transitivity.

We have just shown that equality (A.5) holds.

From the definition of the variables in the causal model given in Section 3 and the definition of their counterfactual analogs given in Section 4, we have

Y*(0)=0Z*(0)=fZ(0)((Y*(0)),UZ(0))I0*(0)=fI0(0)((Y*(0),Z*(0)),UI0(0)).

These equalities imply

(64)L0dx,nˉ(0)=L0dx,g(0).

By definition of the counterfactuals in Section 4.5, we have:

Ydx*,g*(1)=fY(1)(PYdx*,g*(1)0,UY(1))Zdx*,g*(1)=fZ(1)(PZdx*,g*(1)0,UZ(1))I0dx*,g*(1)=fI0(t+1)(PI0dx*,g*(1)0,UI0(1))

Because the set Aˉ contains the support of Aˉdx,g(K) and because Nˉ contains the supports of both Nˉdx,g(K) and Nˉdx,nˉ(K) (by definitions (1) and (2)), the right-hand sides of the previous equalities can be modified as follows under the NDE assumption (3):

(65)Ydx*,g*(1)=fY(1)(PYdx*,g*(1),N¯dx,n¯*(0)0,UY(1))Zdx*,g*(1)=fZ(1)(PZdx*,g*(1),N¯dx,n¯*(0)0,UZ(1))I0dx*,g*(1)=fI0(1)(PI0dx*,g*(1),N¯dx,n¯*(0)0,UI0(1))

where we use the generic notation PX(t+1),Nˉ(t)0 to denote the vector of variables defined by the parents PX(t+1)0 of the counterfactual variable X(t+1) in which the monitoring variables Nˉ(t) are replaced by Nˉ(t). By expanding the parent notation and then making use of equalities (64), (A.3), and (A.4) (just shown to hold), the first of equalities (65) becomes

Ydx*,g*(1)=fY(1)((Ydx*,g*(0),Zdx*,g*(0),I0dx*,g*(0),A2dx*,g*(0),A1dx*,g*(0),Ndx,n¯*(0)),UY(1))=fY(1)((Ydx,n¯*(0),Zdx,n¯*(0),I0dx,n¯*(0),A2dx,n¯*(0),A1dx,n¯*(0),Ndx,n¯*(0)),UY(1))=fY(1)(PYdx,n¯*(1)0,UY(1)).

By definition of the counterfactuals in Section 4.3, we also have:

Ydx,nˉ(1)=fY(1)(PYdx,nˉ(1)0,UY(1)).

By transitivity, the last two equalities imply:

(66)Ydx,nˉ(1)=Ydx,g(1).

By expanding the parent notation and then making use of the equalities (64), (66), (A.3), and (A.4), the second of equalities (65) becomes

Zdx*,g*(1)=fZ(1)((Y¯dx*,g*(1),Zdx*,g*(0),I0dx*,g*(0),A2dx*,g*(0),A1dx*,g*(0),Ndx,n¯*(0)),UZ(1))=fZ(1)((Y¯dx,n¯*(1),Zdx,n¯*(0),I0dx,n¯*(0),A2dx,n¯*(0),A1dx,n¯*(0),Ndx,n¯*(0)),UZ(1))=fZ(1)(PZdx,n¯*(1)0,UZ(1)).

By definition of the counterfactuals in Section 4.3, we also have:

Zdx,nˉ(1)=fZ(1)(PZdx,nˉ(1)0,UZ(1)).

By transitivity, the last two equalities imply:

(67)Zdx,nˉ(1)=Zdx,g(1).

By expanding the parent notation and then making use of equalities (64), (66), (67), (A.3), and (A.4), the third of equalities (65) becomes

I0dx*,g*(1)=fI0(t)((Y¯dx*,g*(1),Z¯dx*,g*(1),I0dx*,g*(0),A2dx*,g*(0),A1dx*,g*(0),Ndx,n¯*(0)),UI0(1))=fI0(1)((Y¯dx,n¯*(1),Z¯dx,n¯*(1),I0dx,n¯*(0),A2dx,n¯*(0),A1dx,n¯*(0),Ndx,n¯*(0)),UI0(1))=fI0(1)(PI0dx,n¯*(1)0,UI0(1)).

By definition of the counterfactuals in Section 4.3, we also have:

I0dx,nˉ(1)=fI0(1)(PI0dx,nˉ(1)0,UI0(1)).

By transitivity, the last two equalities imply:

I0dx,nˉ(1)=I0dx,g(1).

We have just shown that the NDE assumption (3) implies equality (A.1) holds. We note that the proof of this result also holds under the weak NDE assumption if equalities (5) hold (because equalities (5) imply equalities (65)). If equalities (6) hold instead, then we have:

(68)Ydx,n¯*(1)=fY(1)(PYdx,n¯*(1),N¯dx*,g*(0)0,UY(1))Zdx,n¯*(1)=fZ(1)(PZdx,n¯*(1),N¯dx*,g*(0)0,UZ(1))I0dx,n¯*(1)=fI0(1)(PI0dx,n¯*(1),N¯dx*,g*(0)0,UI0(1)).}

We can then adopt the same reasoning following equalities (65) above to show that equalities (68) imply equality (A.1) holds. We have thus shown that the (weak) NDE assumption (i.e., equalities (3), (5), or (6)) implies equality (A.1). This completes the proof of the proposition that, equalities (A) hold at t=1 when the (weak) NDE assumption holds.

By induction, the previous two propositions imply equalities (9) and (10) of theorem 1.

D Proof of the second identifiability result

D.1 Lemma

Lemma 3

When the NPSEM introduced in Section 3 is modified with an intervention regimen on the action variables in X={A2(t),A1(t),N(t):t=0,,K} defined as in Sections 4.2 through 4.5, we define the following conditional independence assumptions on the action variables for t=0,,K:

(69)A2(t)(UA1(j),UN(j),UL0(j+1),UA2(j+1))j=t,,K|PA2(t)0,UA2(t),
(70)A1(t)((UN(j),UL0(j+1),UA2(j+1),UA1(j+1))j=t,,K1,UN(K),UL0(K+1),UA2(K+1))|PA1(t)0,UA1(t),
(71)N(t)((UL0(j),UA2(j),UA1(j),UN(j))j=t+1,,K,UL0(K+1),UA2(K+1))|PN(t)0,UN(t),

where UL0(j)(UY(j),UZ(j),UI0(j)). For any realization pX(t)0 of the parents PX(t)0 of the counterfactual variable X(t) corresponding with a given action variable X(t)X, we define the function fpX(t)0:(UX(t),UX(t))fX(t)(pX(t)0,UX(t),UX(t)) and denote the fiber of any element x(t) in its codomain by fpX(t)01(x(t)), i.e., the following set of realizations of (UX(t),UX(t)):

fpX(t)01(x(t))={(uX(t),uX(t)):fX(t)(pX(t)0,uX(t),uX(t))=x(t)}.

In addition, we define the following two sets:

fpX(t)0,u1(x(t))={uX(t):(uX(t),uX(t))fpX(t)01(x(t))}
fpX(t)0,u1(uX(t),x(t))={uX(t):(uX(t),uX(t))fpX(t)01(x(t))},

and we thus have:

(72)(uX(t),uX(t))fpX(t)01(x(t))uX(t)fpX(t)0,u1(x(t)),uX(t)fpX(t)0,u1(uX(t),x(t)).

If the intervention regimen on the action variables A2(t), A1(t), and N(t) is defined by a choice of functions f and a conditional distribution PUU that satisfy assumptions (69), (70), and (71) then the conditonal distribution of L0(t) given its parents PL0(t)0PY(t)0 does not depend on PUU but depends only on the distribution PU and the functions f. More specifically, the following equality holds for any given time point t=0,,K+1 and any possible realization of the counterfactual variables (lˉ0(K+1),aˉ2(K+1),aˉ1(K),nˉ(K)):

(73)PU,U*(UL0(t)fpL*0(t)01(l0*(t))|PL*0(t)0=pL*0(t)0)=PU(UL0(t)fpL*0(t)01(l0*(t))|(UL0(k)fpL*0(k)01(l0*(k)),UA2(k)fpA*2(k)0,u*1(a2*(k)),UA1(k)fpA*1(k)0,u*1(a1*(k)),UN(k)fpN*(k)0,u*1(n*(k)))k=0,,t1)

where fpL0(t)01(l0(t))fpY(t)01(y(t))×fpZ(t)01(z(t))×fpI0(t)01(i0(t))) (see Appendix A for the definition of each set of this cartesian product).

In addition, if the following conditional independence assumptions hold

(74)UN(t)(UL0(j))j=t+1,,K|(UL0(j),UA2(j),UA1(j))j=0,,t,(UN(j))j=0,,t1fort=0,,K

then the conditional distribution of L0(t) given its parents PL0(t)0 no longer depends on the functions f and, more specifically, the following equality holds:

(75)PU,U*(UL0(t)fpL*0(t)01(l0*(t))|PL*0(t)0=pL*0(t)0)=PU(UL0(t)fpL*0(t)01(l0*(t))|(UL0(k)fpL*0(k)01(l0*(k)))k=0,,t1).

Proof by induction:

Below, we show that for any given time point t=0,,K+1 and any given possible realization (lˉ0(K+1),aˉ2(K+1),aˉ1(K),nˉ(K)) of one of the counterfactual processes defined in Section 4.2, 4.3, 4.4, or 4.5, the conditional independences (69), (70), and (71) imply the following proposition for any j=t2,,0:

E(j)(A)E(j1)(B),

where E(j) denotes the following equality:

ψ=PU,U(UL0(t)fpL0(t)01(l0(t))PL0(j+1)0=pL0(j+1)0,Uˉ(j+1,t1))

with ψPU,U(UL0(t)fpL0(t)01(l0(t))PL0(t)0=pL0(t)0) and Uˉ(j+1,t1)(UL0(k)fpL0(k)01(l0(k)),UA2(k)fpA2(k)0,u1(a2(k)),UA1(k)fpA1(k)0,u1(a1(k)),UN(k)fpN(k)0,u1(n(k)))k=j+1,,t1.

In the proof below, we use bold font to indicate how each new equality is modified from its previous expression and we also indicate the assumption(s) supporting a new expression above the equal sign. We have for any j=t2,,0

ψ(A)=PU,U*(UL0(t)fpL*0(t)01(l0*(t))|PL*0(j+1)0=pL*0(j+1)0,U¯(j+1,t1))=PU,U*(UL0(t)fpL*0(t)01(l0*(t))|PN*(j)0=pN*(j)0,N*(j)=n*(j),U¯(j+1,t1))=PU,U*(UL0(t)fpL*0(t)01(l0*(t))|PN*(j)0=pN*(j)0,(UN(j),UN(j)*)fpN*(j)0*1(n*(j)),U¯(j+1,t1))(72)=PU,U*(UL0(t)fpL*0(t)01(l0*(t))|PN*(j)0=pN*(j)0,UN(j)fpN*(j)0,u*1(n*(j)),(UN(j),UN(j)*)fpN*(j)0*1(n*(j)),U¯(j+1,t1))=PU,U*(UL0(t)fpL*0(t)01(l0*(t))|PN*(j)0=pN*(j)0,UN(j)fpN*(j)0,u*1(n*(j)),N*(j)=n*(j),U¯(j+1,t1))=PU,U*(UL0(t)fpL*0(t)01(l0*(t)),U¯(j+1,t1)|PN*(j)0=pN*(j)0,UN(j)fpN*(j)0,u*1(n*(j)),N*(j)=n*(j))/PU,U*(U¯(j+1,t1)|PN*(j)0=pN*(j)0,UN(j)fpN*(j)0,u*1(n*(j)),N*(j)=n*(j))(71)=PU,U*(UL0(t)fpL*0(t)01(l0*(t)),U¯(j+1,t1)|PN*(j)0=pN*(j)0,UN(j)fpN*(j)0,u*1(n*(j)))/PU,U*(U¯(j+1,t1)|PN*(j)0=pN*(j)0,UN(j)fpN*(j)0,u*1(n*(j)))=PU,U*(UL0(t)fpL*0(t)01(l0*(t))|U¯(j+1,t1),PN*(j)0=pN*(j)0,UN(j)fpN*(j)0,u*1(n*(j)))
=PU,U*(UL0(t)fpL*0(t)01(l0*(t)),U¯(j+1,t1),UN(j)fpN*(j)0,u*1(n*(j))|PN*(j)0=pN*(j)0)/PU,U*(U¯(j+1,t1),UN(j)fpN*(j)0,u*1(n*(j))|PN*(j)0=pN*(j)0)=PU,U*(UL0(t)fpL*0(t)01(l0*(t)),U¯(j+1,t1),UN(j)fpN*(j)0,u*1(n*(j))|PA*1(j)0=pA*1(j)0,A1*(j)=a*1(j))/PU,U*(U¯(j+1,t1),UN(j)fpN*(j)0,u*1(n*(j))|PA*1(j)0=pA*1(j)0,A1*(j)=a*1(j))(72)=PU,U*(UL0(t)fpL*0(t)01(l0*(t)),U¯(j+1,t1),UN(j)fpN*(j)0,u*1(n*(j))|PA*1(j)0=pA*1(j)0,UA1(j)fpA*1(j)0,u*1(a*1(j)),A1*(j)=a*1(j))/PU,U*(U¯(j+1,t1),UN(j)fpN*(j)0,u*1(n*(j))|PA*1(j)0=pA*1(j)0,UA1(j)fpA*1(j)0,u*1(a*1(j)),A1*(j)=a*1(j))(70)=PU,U*(UL0(t)fpL*0(t)01(l0*(t)),U¯(j+1,t1),UN(j)fpN*(j)0,u*1(n*(j))|PA*1(j)0=pA*1(j)0,UA1(j)fpA*1(j)0,u*1(a*1(j)))/PU,U*(U¯(j+1,t1),UN(j)fpN*(j)0,u*1(n*(j))|PA*1(j)0=pA*1(j)0,UA1(j)fpA*1(j)0,u*1(a*1(j)))=PU,U*(UL0(t)fpL*0(t)01(l0*(t))|U¯(j+1,t1),UN(j)fpN*(j)0,u*1(n*(j)),PA*1(j)0=pA*1(j)0,UA1(j)fpA*1(j)0,u*1(a*1(j)))=PU,U*(UL0(t)fpL*0(t)01(l0*(t))|U¯(j+1,t1),UN(j)fpN*(j)0,u*1(n*(j)),PA*2(j)0=pA*2(j)0,A2*(j)=a*2(j),UA1(j)fpA*1(j)0,u*1(a*1(j)))
ψ(72)=PU,U*(UL0(t)fpL*0(t)01(l0*(t))|U¯(j+1,t1),UN(j)fpN*(j)0,u*1(n*(j)),PA*2(j)0=pA*2(j)0,UA2(j)fpA*2(j)0,u*1(a2*(j)),A2*(j)=a*2(j),UA1(j)fpA*1(j)0,u*1(a*1(j)))=PU,U*(UL0(t)fpL*0(t)01(l0*(t)),U¯(j+1,t1),UN(j)fpN*(j)0,u*1(n*(j)),UA1(j)fpA*1(j)0,u*1(a*1(j))|PA*2(j)0=pA*2(j)0,UA2(j)fpA*2(j)0,u*1(a2*(j)),A2*(j)=a*2(j))/PU,U*(U¯(j+1,t1),UN(j)fpN*(j)0,u*1(n*(j)),UA1(j)fpA*1(j)0,u*1(a*1(j))|PA*2(j)0=pA*2(j)0,UA2(j)fpA*2(j)0,u*1(a2*(j)),A2*(j)=a*2(j))(69)=PU,U*(UL0(t)fpL*0(t)01(l0*(t)),U¯(j+1,t1),UN(j)fpN*(j)0,u*1(n*(j)),UA1(j)fpA*1(j)0,u*1(a*1(j))|PA*2(j)0=pA*2(j)0,UA2(j)fpA*2(j)0,u*1(a2*(j)))/PU,U*(U¯(j+1,t1),UN(j)fpN*(j)0,u*1(n*(j)),UA1(j)fpA*1(j)0,u*1(a*1(j))|PA*2(j)0=pA*2(j)0,UA2(j)fpA*2(j)0,u*1(a2*(j)))=PU,U*(UL0(t)fpL*0(t)01(l0*(t))|U¯(j+1,t1),UN(j)fpN*(j)0,u*1(n*(j)),UA1(j)fpA*1(j)0,u*1(a*1(j)),UA2(j)fpA*2(j)0,u*1(a2*(j)),PA*2(j)0=pA*2(j)0)=PU,U*(UL0(t)fpL*0(t)01(l0*(t))|U¯(j+1,t1),UN(j)fpN*(j)0,u*1(n*(j)),UA1(j)fpA*1(j)0,u*1(a*1(j)),UA2(j)fpA*2(j)0,u*1(a2*(j)),PL*0(j)0=pL*0(j)0,L0*(j)=l0*(j))=PU,U*(UL0(t)fpL*0(t)01(l0*(t))|U¯(j+1,t1),UN(j)fpN*(j)0,u*1(n*(j)),UA1(j)fpA*1(j)0,u*1(a*1(j)),UA2(j)fpA*2(j)0,u*1(a2*(j)),PL*0(j)0=pL*0(j)0,UL0(j)fpL*0(j)01(l0*(j)))=PU,U*(UL0(t)fpL*0(t)01(l0*(t))|PL*0(j)0=pL*0(j)0,U¯(j,t1)).

The last equality corresponds to equality (B).

Thus, we have just shown E(j)E(j1).

Above, we have shown the proposition that, for any j=t2,0, if equality (A) holds then it implies equality (B) when the conditional independences (69), (70), and (71) hold. We now show the proposition that equality (A) holds at j=t2 when the conditional independences (69), (70), and (71) hold:

ψPU,U*(UL0(t)fpL*0(t)01(l0*(t))|PL*0(t)0=pL*0(t)0)=PU,U*(UL0(t)fpL*0(t)01(l0*(t))|PN*(t1)0=pN*(t1)0,N*(t1)=n*(t1))=PU,U*(UL0(t)fpL*0(t)01(l0*(t))|PN*(t1)0=pN*(t1)0,(UN(t1),UN(t1)*)fpN*(t1)0*1(n*(t1)))(72)=PU,U*(UL0(t)fpL*0(t)01(l0*(t))|PN*(t1)0=pN*(t1)0,UN(t1)fpN*(t1)0,u*1(n*(t1)),(UN(t1),UN(t1)*)fpN*(t1)0*1(n*(t1)))=PU,U*(UL0(t)fpL*0(t)01(l0*(t))|PN*(t1)0=pN*(t1)0,UN(t1)fpN*(t+1)0,u*1(n*(t1)),N*(t1)=n*(t1))(71)=PU,U*(UL0(t)fpL*0(t)01(l0*(t))|PN*(t1)0=pN*(t1)0,UN(t1)fpN*(t1)0,u*1(n*(t1)))=PU,U*(UN(t1)fpN*(t1)0,u*1(n*(t1)),UL0(t)fpL*0(t)01(l0*(t))|PN*(t1)0=pN*(t1)0)/PU,U*(UN(t1)fpN*(t1)0,u*1(n*(t1))|PN*(t1)0=pN*(t1)0)=PU,U*(UN(t1)fpN*(t1)0,u*1(n*(t1)),UL0(t)fpL*0(t)01(l0*(t))|PA*1(t1)0=pA*1(t1)0,A1*(t1)=a*1(t1))/PU,U*(UN(t1)fpN*(t1)0,u*1(n*(t1))|PA*1(t1)0=pA*1(t1)0,A1*(t1)=a*1(t1))
ψ(72)=PU,U*(UN(t1)fpN*(t1)0,u*1(n*(t1)),UL0(t)fpL*0(t)01(l0*(t))|PA*1(t1)0=pA*1(t1)0,UA1(t1)fpA*1(t1)0,u*1(a*1(t1)),A1*(t1)=a*1(t1))/PU,U*(UN(t1)fpN*(t1)0,u*1(n*(t1))|PA*1(t1)0=pA*1(t1)0,UA1(t1)fpA*1(t1)0,u*1(a*1(t1)),A1*(t1)=a*1(t1))(70)=PU,U*(UN(t1)fpN*(t1)0,u*1(n*(t1)),UL0(t)fpL*0(t)01(l0*(t))|PA*1(t1)0=pA*1(t1)0,UA1(t1)fpA*1(t1)0,u*1(a*1(t1)))/PU,U*(UN(t1)fpN*(t1)0,u*1(n*(t1))|PA*1(t1)0=pA*1(t1)0,UA1(t1)fpA*1(t1)0,u*1(a*1(t1)))=PU,U*(UL0(t)fpL*0(t)01(l0*(t))|PA*1(t1)0=pA*1(t1)0,UA1(t1)fpA*1(t1)0,u*1(a*1(t1)),UN(t1)fpN*(t1)0,u*1(n*(t1)))=PU,U*(UL0(t)fpL*0(t)01(l0*(t))|PA*2(t1)0=pA*2(t1)0,A2*(t1)=a*2(t1),UA1(t1)fpA*1(t1)0,u*1(a*1(t1)),UN(t1)fpN*(t1)0,u*1(n*(t1)))(72)=PU,U*(UA1(t1)fpA*1(t1)0,u*1(a*1(t1)),UN(t1)fpN*(t1)0,u*1(n*(t1)),UL0(t)fpL*0(t)01(l0*(t))|PA*2(t1)0=pA*2(t1)0,UA2(t1)fpA*2(t1)0,u*1(a2*(t1)),A2*(t1)=a*2(t1))/PU,U*(UA1(t1)fpA*1(t1)0,u*1(a*1(t1)),UN(t1)fpN*(t1)0,u*1(n*(t1))|PA*2(t1)0=pA*2(t1)0,UA2(t1)fpA*2(t1)0,u*1(a2*(t1)),A2*(t1)=a*2(t1))
ψ(69)__PU,U*(UA1(t1)fpA*1(t1)0,u*1(a*1(t1)),UN(t1)fpN*(t1)0,u*1(n*(t1)),UL0(t)fpL*0(t)01(l0*(t))|PA*2(t1)0=pA*2(t1)0,UA2(t1)fpA*2(t1)0,u*1(a2*(t1)))/PU,U*(UA1(t1)fpA*1(t1)0,u*1(a*1(t1)),UN(t1)fpN*(t1)0,u*1(n*(t1))|PA*2(t1)0=pA*2(t1)0,UA2(t1)fpA*2(t1)0,u*1(a2*(t1)))=PU,U*(UL0(t)fpL*0(t)01(l0*(t))|PA*2(t1)0=pA*2(t1)0,UA2(t1)fpA*2(t1)0,u*1(a2*(t1)),UA1(t1)fpA*1(t1)0,u*1(a*1(t1)),UN(t1)fpN*(t1)0,u*1(n*(t1)))=PU,U*(UL0(t)fpL*0(t)01(l0*(t))|PL*0(t1)0=pL*0(t1)0,L0*(t1)=l0*(t1),UA2(t1)fpA*2(t1)0,u*1(a2*(t1)),UA1(t1)fpA*1(t1)0,u*1(a*1(t1)),UN(t1)fpN*(t1)0,u*1(n*(t1)))=PU,U*(UL0(t)fpL*0(t)01(l0*(t))|PL*0(t1)0=pL*0(t1)0,UL0(t1)fpL*0(t1)01(l0*(t1)),UA2(t1)fpA*2(t1)0,u*1(a2*(t1)),UA1(t1)fpA*1(t1)0,u*1(a*1(t1)),UN(t1)fpN*(t1)0,u*1(n*(t1))).

The last equality corresponds to equality (A) at j=t2. We have just shown the proposition that equality (A) holds at j=t2 when the conditional independences (69), (70), and (71) hold.

By induction, the previous two propositions imply that equality (73) holds when the conditional independences (69), (70), and (71) hold (because PY(0)0 is nil).

Below, we now show that for any given time point t=0,,K+1 and any given possible realization (lˉ0(K+1),aˉ2(K+1),aˉ1(K),nˉ(K)) of the counterfactual processes defined in Section 4.2, 4.3, 4.4, or 4.5, the conditional independence (74) implies the following proposition for any j=t2,,0:

F(j)(C)F(j1)(D),

where F(j) denotes the following equality:

ψ=PU(UL0(t)fpL0(t)01(l0(t))|Uˉ(0,j),(UL0(k)fpL0(k)01(l0(k)))k=j+1,,t1)

with ψPU,U(UL0(t)fpL0(t)01(l0(t))|PL0(t)0=pL0(t)0) and Uˉ(0,j)(UL0(k)fpL0(k)01(l0(k)),UA2(k)fpA2(k)0,u1(a2(k)),UA1(k)fpA1(k)0,u1(a1(k)),UN(k)fpN(k)0,u1(n(k)))k=0,,j.

Indeed, we have for any j=t2,,0:

ψ(C)=PU(UL0(t)fpL*0(t)01(l0*(t))|U¯(0,j),(UL0(k)fpL*0(k)01(l0*(k)))k=j+1,,t1)=PU(UL0(t)fpL*0(t)01(l0*(t)),(UL0(k)fpL*0(k)01(l0*(k)))k=j+1,,t1|U¯(0,j))/PU((UL0(k)fpL*0(k)01(l0*(k)))k=j+1,,t1U¯(0,j))(74)__PU(UL0(t)fpL*0(t)01(l0*(t)),(UL0(k)fpL*0(k)01(l0*(k)))k=j+1,,t1|U¯(0,j1),UL0(j)fpL*0(j)01(l0*(j)))/PU((UL0(k)fpL*0(k)01(l0*(k)))k=j+1,,t1|U¯(0,j1),UL0(j)fpL*0(j)01(l0*(j)))=PU(UL0(t)fpL*0(t)01(l0*(t))|U¯(0,j1),(UL0(k)fpL*0(k)01(l0*(k)))k=j,,t1).

We note that the third equality above indeed holds under the conditional independence assumption (74) because, when the conditional probability ψ is defined, the sets fpA2(k)0,u1(a2(k)) and fpA1(k)0,u1(a1(k)) are then equal to the support of UA2(k) and UA1(k), respectively. The last equality corresponds to equality (D). Thus, we have just shown F(j)F(j1).

Above, we have shown the proposition that, for any j=t2,,0, if equality (C) holds then it implies equality (D) when the conditional independence (74) holds. We now show the proposition that equality (C) holds at j=t2 when the conditional independences (69), (70), (71), and (74) hold:

ψPU,U*(UL0(t)fpL*0(t)01(l0*(t))|PL*0(t)0=pL*0(t)0)(73)__PU(UL0(t)fpL*0(t)01(l0*(t))|U¯(0,t1))(equality(73)wasjustshowntoholdwhenequalities(69),(70),(71)hold)(74)__PU(UL0(t)fpL*0(t)01(l0*(t))|U¯(0,t2),UL0(t1)fpL*0(t1)01(l0*(t1))).

The last equality corresponds to equality (C) at j=t2. We have just shown the proposition that equality (C) holds at j=t2.

By induction, the previous two propositions imply that equality (75) holds when the four conditional independences (69), (70), (71), and (74) hold.

D.2 Proof of theorem 2

Proof

By definition, we have for any t=1,,K+1:

(76)E(Ydx,g(t))=y(t)y(t)(y¯t(K+1),z¯(K+1),i0¯(K+1),a¯2(K+1),a¯1(K),n¯(K)P(Xdx,g=x)),

where P(Xdx,g=x) denotes the probability that the counterfactual data process Xdx,g=(Lˉ0dx,g(K+1),Aˉ2dx,g(K+1),Aˉ1dx,g(K),Nˉdx,g(K)) resulting from the modified NPSEM in Section 4.4 is equal to the realization x(lˉ0(K+1),aˉ2(K+1),aˉ1(K),nˉ(K)) and where we use the notation yˉt(K+1)=(yˉ(t1),y(t+1),,y(K+1)) and l0(j)(y(j),z(j),i0(j)) for j=0,,K+1. The probability P(Xdx,g=x) is defined as follows based on the distribution of the exogenous variables PU,U and the functions f and f defined in Section 4.4:

P(Xdx,g=x)PU,U*((UY(t)fpy(t)01(y(t)),UZ(t)fpz(t)01(z(t)),UI0(t)fpi0(t)01(i0(t)))t=0,,K+1,UA2(K+1)fpa2(K+1)01(a2(K+1)),((UA2(t),U*A2(t))fpa2(t)0*1(a2(t)),(UA1(t),U*A1(t))fpa1(t)0*1(a1(t)),(UN(t),U*N(t))fpn(t)0*1(n(t)))t=0,,K),

where bold font is used to highlight the random variables and where we use the generic notation px(t)0 defined as the realization pX(t)0 of the parents of variable X(t) defined in Section 3 corresponding with x if x were a realization of the process X=(Lˉ0(K+1),Aˉ2(K+1),Aˉ1(K),Nˉ(K)) defined by the unmodified NPSEM. For example, we have py(t)0(lˉ0(t1),aˉ2(t1),aˉ1(t1),nˉ(t1)). We recall that the generic definition of the set fpx(t)01 (resp. fpx(t)01) for a given non-action (resp. action) variable X(t) is given in Appendix A (resp. D.1).

By factorization using the chain rule applied according to the temporal ordering of the variables, the previous expression can be rewritten as follows:

(77)P(Xdx,g=x)=t=0K+1Qt(y(t),z(t),i0(t)py(t)0)t=0Kgt(a2(t),a1(t),n(t)pa2(t)0)gK+1(a2(K+1)pa2(K+1)0),

where the factors Qt and gt are defined recursively for t=0,,K+1 in this order as follows:

  1. if either t=0 or if both t>0 and j=0t1Qj(y(j),z(j),i0(j)py(j)0)gj(a2(j),a1(j),n(j)pa2(j)0)>0:

    Qt(y(t),z(t),i0(t)py(t)0)PU,U*(UY(t)fpy(t)01(y(t)),UZ(t)fpz(t)01(z(t)),UI0(t)fpi0(t)01(i0(t))PYdx,g(t)0=py(t)0)=P(L0dx,g(t)=l0(t)PYdx,g(t)0=py(t)0),

    and otherwise:

    Qt(y(t),z(t),i0(t)py(t)0)PU,U*(UY(t)fpy(t)01(y(t)),UZ(t)fpz(t)01(z(t)),UI0(t)fpi0(t)01(i0(t)))P(L0dx,g(t)=l0(t)),

    by convention (the previous conditional probability is then undefined). We note that this choice of convention has no impact on the definition of P(Xdx,g=x) since P(Xdx,g=x)=0 whenever at least one of the terms Qt is not defined by the conditional probability.

  2. if j=0tQj(y(j),z(j),i0(j)py(j)0)j=0t1gj(a2(j),a1(j),n(j)pa2(j)0)>0:

    gt(a2(t),a1(t),n(t)pa2(t)0)PU,U*((UA2(t),U*A2(t))fpa2(t)0*1(a2(t)),(UA1(t),U*A1(t))fpa1(t)0*1(a1(t)),(UN(t),U*N(t))fpn(t)0*1(n(t))PA2dx,g(t)0=pa2(t)0)=P(A2dx,g(t)=a2(t),A1dx,g(t)=a1(t),Ndx,g(t)=n(t)PA2dx,g(t)0=pa2(t)0),

    and otherwise gt(a2(t),a1(t),n(t)pa2(t)0)gt(a2(t)pa2(t)0)gt(a1(t)pa1(t)0)gt(n(t)pn(t)0) with:

    gt(a2(t)pa2(t)0)PU,U*((UA2(t),U*A2(t))fpa2(t)0*1(a2(t)))P(A2dx,g(t)=a2(t))gt(a1(t)pa1(t)0)PU,U*((UA1(t),U*A1(t))fpa1(t)0*1(a1(t)))P(A1dx,g(t)=a1(t))gt(n(t)pn(t)0)PU,U*((UN(t),U*N(t))fpn(t)0*1(n(t)))P(Ndx,g(t)=n(t)),

    by convention (the previous conditional probability is then undefined). We note again that this choice of convention has no impact on the definition of P(Xdx,g=x).

  3. if j=0K+1Qj(y(j),z(j),i0(j)py(j)0)j=0Kgj(a2(j),a1(j),n(j)pa2(j)0)>0:

    gK+1(a2(K+1)pa2(K+1)0)PU,U*(UA2(K+1)fpa2(K+1)01(a2(K+1))PA2dx,g(K+1)0=pa2(K+1)0)=P(A2dx,g(K+1)=a2(K+1)PA2dx,g(K+1)0=pa2(K+1)0)

    and otherwise:

    gK+1(a2(K+1)pa2(K+1)0)PU,U*(UA2(K+1)fpa2(K+1)01(a2(K+1)))P(A2dx,g(K+1)=a2(K+1))

    by convention (the previous conditional probability is then undefined). In addition, from the definition of fA2(K+1) and fA2(K+1) given in Sections 3 and 4.4, we have

    (78)gK+1(a2(K+1)pa2(K+1)0)=I(a2(K+1)=1y(K+1)).

From now on, to simplify notation, we drop the subscript t from the terms gt and Qt defined above. Thus, each reference to the functions g and Q below is an implicit reference to one of the functions gt and Qt above and we rely on the names of the function arguments to indicate to the reader which function gt and Qt is actually referenced. Using this new notation, we note that each factor g above for t=0,,K can be further factorized as follows when it is defined based on the conditional probability (i.e., if j=0tQ(y(j),z(j),i0(j)py(j)0)j=0t1g(a2(j),a1(j),n(j)pa2(j)0)>0):

g(a2(t),a1(t),n(t)pa2(t)0)=g(a2(t)pa2(t)0)g(a1(t)pa1(t)0)g(n(t)pn(t)0),

where each of these three terms are defined as follows

  1. g(a2(t)pa2(t)0)PU,U((UA2(t),UA2(t))fpa2(t)01(a2(t))PA2dx,g(t)0=pa2(t)0)=P(A2dx,g(t)=a2(t)PA2dx,g(t)0=pa2(t)0)

  2. if g(a2(t)pa2(t)0)>0:

    g(a1(t)pa1(t)0)PU,U*((UA1(t),U*A1(t))fpa1(t)0*1(a1(t))PA1dx,g(t)0=pa1(t)0)=P(A1dx,g(t)=a1(t)PA1dx,g(t)0=pa1(t)0)

    and otherwise:

    g(a1(t)pa1(t)0)PU,U*((UA1(t),U*A1(t))fpa1(t)0*1(a1(t)))P(A1dx,g(t)=a1(t))

    by convention (the previous conditional probability is then undefined).

  3. if g(a2(t)pa2(t)0)g(a1(t)pa1(t)0)>0:

    g(n(t)pn(t)0)PU,U*((UN(t),U*N(t))fpn(t)0*1(n(t))PNdx,g(t)0=pn(t)0)=P(Ndx,g(t)=n(t)PNdx,g(t)0=pn(t)0)

    and otherwise:

    g(n(t)pn(t)0)PU,U*((UN(t),U*N(t))fpn(t)0*1(n(t)))P(Ndx,g(t)=n(t)),

    by convention (the previous conditional probability is then undefined).

From the definition of f in Section 4.4, we have for t=0,,K:

(79)g(a2(t)pa2(t)0)=I(a2(t)=0)
(80)g(a1(t)pa1(t)0)=I(a1(t)=a1(t1))y(t)I(a1(t)=dx(t)(pa1(t)))1y(t)

where we use the generic notation px(t) (px(t)0) defined as the realization pX(t) of the observed parents of variable X(t) defined in Section 3 corresponding with x if x were a realization of the process X=(Lˉ0(K+1),Aˉ2(K+1),Aˉ1(K),Nˉ(K)) defined by the unmodified NPSEM. For example, we have pa1(t)(lˉ(t),aˉ2(t),aˉ1(t1),nˉ(t1)) with l(k)(y(k),z(k),i(k)) and i(k)n(k1)i0(k) for k=0,,t1. We note that equalities (79) and (80) hold even when g(a2(t)pa2(t)0) and g(a1(t)pa1(t)0) are defined using the convention introduced earlier.

In addition, from the definition of f in Section 4.4, we have g(n(t)pn(t)0)=I(n(t)=n(t1)) when y(t)=1. When y(t)=0 and if either the function hN(t) is not dependent on the counterfactual monitoring variable, fN(t)(PN(t)0,UN(t)), or the function fN(t) is not dependent on the variables Iˉ0(t), then the definition of fN(t) in Section 4.4 implies that g(n(t)pn(t)0) (even when defined by convention) is only a function of the observed past pn(t). More specifically, we have:

P(Ndx,g(t)=n(t)PNdx,g(t)0=pn(t)0)=P(Ndx,g(t)=n(t)PNdx,g(t)=pn(t))
PU,U((UN(t),UN(t))fpn(t)01(n(t)))=PU,U((UN(t),UN(t))fpn(t)01(n(t)))

where pn(t)0(yˉ(t),zˉ(t),iˉ0(t),aˉ2(t),aˉ1(t),nˉ(t1)) for any iˉ0(t) such that i0(k)=i0(k) if n(k1)=1. Thus, from now on, we can also denote g(n(t)pn(t)0) by g(n(t)pn(t)) whether y(t)=0 or y(t)=1 and we have:

(81)g(n(t)pn(t))=g(n(t)pn(t))I(n(t)=n(t1))y(t),

because I(n(t)=n(t1))2=I(n(t)=n(t1)).

Futhermore, from lemma 3, the following equality holds under conditional independences (69), (70), and (71):

(82)PU,U*(UY(t)fpy(t)01(y(t)),UZ(t)fpz(t)01(z(t)),UI0(t)fpi0(t)01(i0(t))|PYdx,g(t)0=py(t)0)=PU(UY(t)fpy(t)01(y(t)),UZ(t)fpz(t)01(z(t)),UI0(t)fpi0(t)01(i0(t))|(UY(k)fpy(k)01(y(k)),UZ(k)fpz(k)01(z(k)),UI0(k)fpi0(k)01(i0(k)),UA2(k)fpa2(k)0,u*1(a2(k)),UA1(k)fpa1(k)0,u*1(a1(k)),UN(k)fpn(k)0,u*1(n(k)))k=0,,t1).

The use of bold font in this expression makes explicit that these probabilities are invariant to the choice of conditional distribution PUU. We note however that these probabilities remain dependent on the choice of functions f, i.e., the definition of the intervention regimen on the action variables A2(t), A1(t), and N(t). We recall that the factors Q(y(t),z(t),i0(t)py(t)0) that define the probability P(Xdx,g=x) are defined by the probabilities above. To clearly indicate the dependence of these factors on the choice of functions f, we now use the notation Qfdx,g(l0(t)py(t)0) for the factors Q(y(t),z(t),i0(t)py(t)0).

From the results (78), (79), (80), (81), and (82) derived above, the expression (77) of the probability P(Xdx,g=x) becomes

(83)P(Xdx,g=x)=I(a2(K+1)=1y(K+1))t=0K+1Qfdx,g(l0(t)py(t)0)t=0KI(a2(t)=0)×I(a1(t)=a1(t1))y(t)I(a1(t)=dx(t)(pa1(t)))1y(t)g(n(t)pn(t)),

and we obtain:

y¯t(K+1),z¯(K+1),i¯0(K+1),a¯2(K+1),a¯1(K),n¯(K)P(Xdx,g=x)=l¯0(t1),z(t),i0(t),a¯2(t1),a¯1(t1),n¯(t1)j=0tQf*dx,g(l0(j)py(j)0)j=0t1I(a2(j)=0)×I(a1(j)=a1(j1))y(j)I(a1(j)=dx(j)(pa1(j)))1y(j)g(n(j)pn(j)).

As a result, equality (76) becomes:

E(Ydx,g(t))=l¯0(t),a¯2(t1),a¯1(t1),n¯(t1)y(t)j=0tQf*dx,g(l0(j)py(j)0)j=0t1I(a2(j)=0)×I(a1(j)=a1(j1))y(j)I(a1(j)=dx(j)(pa1(j)))1y(j)g(n(j)pn(j)).

Because for any given nˉ(t1), nˉ(t1)I(nˉ(t1)=nˉ(t1))=1, we have:

E(Ydx,g(t))=n¯(t1)l¯0(t),a¯2(t1),a¯1(t1)n¯*(t1)y(t)j=0tQf*dx,g(l0(j)py(j)0)j=0t1I(a2(j)=0)×I(a1(j)=a1(j1))y(j)I(a1(j)=dx(j)(pa1(j)))1y(j)g(n(j)pn(j))×I(n(j)=n*(j))y(j)I(n(j)=n*(j))1y(j)
E(Ydx,g(t))(81)=n¯*(t1)n¯(t1)l¯0(t),a¯2(t1),a¯1(t1)y(t)j=0tQf*dx,g(l0(j)py(j)0)j=0t1I(a2(j)=0)×I(a1(j)=a1(j1))y(j)I(a1(j)=dx(j)(pa1(j)))1y(j)g(n(j)pn(j))×I(n(j)=n(j1))y(j)I(n(j)=n*(j))y(j)I(n(j)=n*(j))1y(j)
(84)E(Ydx,g(t))=n¯*(t1)l¯0(t),a¯2(t1),a¯1(t1),n¯(t1)(y(t)j=0t1g(n(j)pn(j))I(n(j)=n*(j))y(j))×j=0tQf*dx,g(l0(j)py(j)0)j=0t1I(a2(j)=0)I(a1(j)=a1(j1))y(j)×I(a1(j)=dx(j)(pa1(j)))1y(j)I(n(j)=n(j1))y(j)I(n(j)=n*(j))1y(j).

We now note that, with the particular choice of stochastic monitoring intervention function

hN(t)(PN(t),UN(t),fN(t)(PN(t)0,UN(t)))n(t)

in Section 4.4, we have

g(n(t)pn(t))=I(n(t)=n(t1))y(t)I(n(t)=n(t))1y(t)

and the modified NPSEM in Section 4.4 becomes the same as the modified NPSEM in Section 4.3. Thus, the probability that the counterfactual data process Xdx,nˉ=(Lˉ0dx,nˉ(K+1),Aˉ2dx,nˉ(K+1),Aˉ1dx,nˉ(K),Nˉdx,nˉ(K)) resulting from the modified NPSEM in Section 4.3 is equal to x (denoted by P(Xdx,nˉ=x)) can directly be derived from equality (83) as follows:

(85)P(Xdx,n¯*=x)=I(a2(K+1)=1y(K+1))t=0K+1Qfdx,n¯**(l0(t)py(t)0)t=0KI(a2(t)=0)×I(a1(t)=a1(t1))y(t)I(a1(t)=dx(t)(pa1(t)))1y(t)I(n(t)=n(t1))y(t)I(n(t)=n*(t))1y(t).

In addition, if the functions hN(t) are not dependent on the counterfactual monitoring variables, fN(t)(PN(t)0,UN(t)), then the functions f in Section 4.3 that define Qfdx,nˉ and the functions f in Section 4.4 that define Qfdx,g become independent of the exogenous variables UA2(t), UA1(t), and UN(t). As a result, the right-hand side of equality (82) which defines both the factors Qfdx,nˉ(l0(t)py(t)0) and Qfdx,g(l0(t)py(t)0) no longer depends on the choice of functions f:

PU(UY(t)fpy(t)01(y(t)),UZ(t)fpz(t)01(z(t)),UI0(t)fpi0(t)01(i0(t))|(UY(k)fpy(k)01(y(k)),UZ(k)fpz(k)01(z(k)),UI0(k)fpi0(k)01(i0(k)),UA2(k)fpa2(k)0,u*1(a2(k)),UA1(k)fpa1(k)0,u*1(a1(k)),UN(k)fpn(k)0,u*1(n(k)))k=0,,t1)=PU(UY(t)fpy(t)01(y(t)),UZ(t)fpz(t)01(z(t)),UI0(t)fpi0(t)01(i0(t))(UY(k)fpy(k)01(y(k)),UZ(k)fpz(k)01(z(k)),UI0(k)fpi0(k)01(i0(k)))k=0,,t1),

because, when these conditional probabilities are defined, the sets fpa2(k)0,u1(a2(k)), fpa1(k)0,u1(a1(k)), and fpn(k)0,u1(n(k)) are then equal to the support of UA2(k), UA1(k), and UN(t), respectively. We note that, from the second result of lemma 3, the previous equality also holds when the functions hN(t) are dependent on the counterfactual monitoring variables, fN(t)(PN(t)0,UN(t)), as long as the conditional independences (74) hold.

Therefore, when the previous equality holds, we have Qfdx,nˉ(l0(t)py(t)0)=Qfdx,g(l0(t)py(t)0) and using equality (85), we further obtain:

l¯0(t+1,K+1),a¯2(t,K+1),a¯1(t,K),n¯(t,K)P(Xdx,n¯*=x)=j=0tQfdx,g*(l0(j)py(j)0)j=0t1I(a2(j)=0)×I(a1(j)=a1(j1))y(j)I(a1(j)=dx(j)(pa1(j)))1y(j)I(n(j)=n(j1))y(j)I(n(j)=n*(j))1y(j)

where we use the generic notation Xˉ(j,j)=(X(j),,X(j)) for jj (Xˉ(j,j) is nil if j<j). Thus, equality (84) can be expressed as:

E(Ydx,g(t))=n¯*(t1)(l¯0(t),a¯2(t1),a¯1(t1),n¯(t1)(y(t)j=0t1g(n(j)pn(j))I(n(j)=n*(j))y(j))×(l¯0(t+1,K+1),a¯2(t,K+1),a¯1(t,K),n¯(t,K)P(Xdx,n¯*=x))),

and can be further simplied as:

E(Ydx,g(t))=n¯*(t1)E(Ydx,n¯*(t)j=0t1g(Ndx,n¯*(j)PNdx,n¯*(j))I(Ndx,n¯*(j)=n*(j))Ydx,n¯*(j)).

From theorem 1 and after expanding PNdx,nˉ(j) in the previous equality, we obtain the following equality when the (weak) NDE assumption holds:

E(Ydx,g(t))=n¯*(t1)E(Ydx*,g*(t)j=0t1g(Ndx*,g*(j)L¯dx*,g*(j),A¯2dx*,g*(j),A¯1dx*,g*(j),N¯dx*,g*(j1))I(Ndx*,g*(j)=n*(j))Ydx*,g*(j)),

where we use Ldx,g(j)(Ydx,g(j),Zdx,g(j),Idx,g(j)), Idx,g(j)Ydx,g(j)Idx,g(j1)+(1Ydx,g(j))n(j1)Idx,g(j), and Ndx,g(j)Ydx,g(j)Ndx,g(j1)+(1Ydx,g(j))n(j)Ndx,g(j).

Published Online: 2017-1-18

© 2017 Walter de Gruyter GmbH, Berlin/Boston

This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

Heruntergeladen am 12.10.2025 von https://www.degruyterbrill.com/document/doi/10.1515/jci-2016-0015/html?lang=de
Button zum nach oben scrollen