Exploiting fluctuations in gene expression to detect causal interactions between genes

Definition 1. A co-transition event is a transition event in the system where two or more components change simultaneously. That is, a reaction where the step size d has more than one vector component.

An example would be a conversion event, where a chemical species zm converts to another chemical species zn

(zm,zn)W(zm)(zm1,zn+1)

According to our framework, an arrow would be drawn from zm to zn in the network if the above reaction was part of the system. Another example would be two molecules zm, zn that bind to form a complex zl

(zm,zn,zl)W(zm,zn)(zm1,zn1,zl+1).

If the above reaction was part of the system, an arrow would be drawn from zm to zn, from zn to zm, and from both zm, zn to zl.

In order to derive Equation 2, we need to assume that no components in zaffc are part of a co-transition event with any variable in zaff. We thus begin by proving the following lemma.

Lemma 1. Let Zk be a component that is not affected by X or Y. For any network of the class in Appendix 1—figure 21B (Equations 4.3; 4.4), there exists another network with the exact same dynamics in X, Y, and Zk, but where no components in zaffc are part of a co-transition event with any component in zaff.

Proof of Lemma 1. Let the following co-transition reaction be part of the system, where {ak} are variables in zaff and {bk} are variables in zaffc

(5.1)

(a,b)W(b)(a+da,b+db).

By definition of zaff and zaffc, the reaction rate W in the above reaction cannot depend on the variables {ak}. However, because a is part of zaff, the {ak} variables must be affected by X or Y. Therefore, there must exist one or more reactions, labeled with i{1,2,}, in the system, that change a with reaction rates that depend on the variables affected by X or Y

(5.2)

aWi(zaff,zaffc)a+difori=1,2,

Note that the above reactions cannot make changes to b; otherwise, the {bk} variables would not be in the variables not affected by X or Y. We now consider an exact copy of the whole system z and the system reactions, with the change that the a variables are decomposed into two sets of mock variables. Specifically, we define the variables {akint} and {akb} that undergo the following reactions

(ab,b)W(b)(ab+da,b+db)aintWi(zaff,zaffc)aint+difori=1,2,,

which correspond to the reactions in Equations 5.1; 5.2. We replace all the explicit a dependencies in the reaction rates of the system with aint+ab. As a result, all the reactions that depended on a are unchanged, but now we can put the ab variables in zaffc, and we can put the aint variables in zaff. We are left with a system where the aint are not part of a co-transition event with variables in zaffc, and the dynamics of X and Y remain unchanged. Moreover, none of the reaction rates that govern the dynamics of any component in the original zaffc have been altered, meaning the dynamics of Zk remain unchanged. Such a decomposition can be done for any co-transition reaction that involves components from zaff and zaffc.

We now let Zk correspond to another component of interest in the system, as a continuous-time Markov process. It can be any stochastic process that can be measured, like the abundance of a molecular species in the network, the size of the cell, or any parameter that can influence the reaction rates of the system.

Theorem 1. Let Zk be a component in zaffc. If the averages xt, yt and the covariances Cov(xt,zk,t), Cov(xt,zk,t) over the ensemble have reached a stationary state (i.e. they have become constant over time), then ηxzk=ηyzk.

Proof of Theorem 1. We condition on the components not affected by X or Y, zaffc[,t]. This corresponds to a hypothetical system where all the variables in zaffc become deterministic time-varying signals {zk(t)}. The reactions governing X and Y in the conditional system become

(5.3)

xR(zaff,t)x+1yαR(zaff,t)y+1xxβ(t)x1yyβ(t)y1

where R(zaff,t)=R(zaff,zaffc(t)) and β(t)=β(zaffc(t)) now have an explicit time dependence from the conditioned history zaffc[,t]. We let A be the set of all integers k such that the k-th reaction in Equation 4.1 leads to a change in at least one of the components in zaff. In the conditional probability space, the components affected in zaff follow the following reactions

(5.4)

zaffWk(zaff,t)zaff+dkkA,

where Wk(zaff,t)=Wk(zaff,zaffc(t)) now has an explicit time dependence from the conditioned history of the variables not affected by X or Y. Note that if some components in zaffc were part of a co-transition event with components in zaff, then Equations 5.3; 5.4 would not hold. This is because conditioning on the history of those extrinsic variables effectively conditions on those birth events in zaff that are caused by those co-transitions. However, from Lemma 1, we can always work with another network in which there are no such co-transition events, and where the dynamics of X and Y remain unchanged.

This conditional system follows the following master equation

ddtP(x,y,zaff,tzaffc[,t])=kA[Wk(zaffdk,t)P(x,y,zaffdk,tzaffc[,t])Wk(zaff,t)P(x,y,zaff,tzaffc[,t])]+R(x1,y,zaff,t)P(x1,y,zaff,tzaffc[,t])R(x,y,zaff,t)P(x,y,zaff,tzaffc[,t])+αR(x,y1,zaff,t)P(x,y1,zaff,tzaffc[,t])αR(x,y,zaff,t)P(x,y,zaff;tzaffc[,t])+(x+1)β(t)P(x+1,y,zaff,tzaffc[,t])xβ(t)P(x,y,zaff,tzaffc[,t])+(y+1)β(t)P(x,y+1,zaff,tzaffc[,t])yβ(t)P(x,y,zaff,tzaffc[,t]).

We consider the averages of X and Y conditioned on the upstream history, x¯(t)=E[xt|zaffc[,t]] and y¯(t)=E[yt|zaffc[,t]], where xt and yt are the X and Y abundances at time t. From the above master equation, the time-evolution for these first moments can be derived (Joly-Smith et al., 2021; Hilfinger and Paulsson, 2011)

(5.5)

dx¯dt=R¯(t)x¯β¯(t)&dy¯dt=αR¯(t)y¯β¯(t),

where R¯(t)=E[R(xt,yt,zaff,t)|z affc[,t]] and β¯(t)=E[β(zaffc)|zaff c[,t]] are the average production and degradation rates conditioned on the history of the variables not affected by X or Y. Note that β¯(t)=E[β(zaffc)|zaff c[,t]]=β(zaffc(t))=β(t), because the time trajectory of zaffc is set through the conditioning on the upstream history. We can then take the expectation of x¯ over all possible histories of zaffc to get

(5.6)

E[x¯(t)]histories=E[E[xtzaffc[,t]]]histories=xt,

which follows from the law of total expectation. We now let Zk correspond to any component in the network that is not affected by X or Y. It can be a molecular abundance, concentration, or another stochastic cellular variable like the growth rate of the cell. It follows that

(5.7)

E[x¯(t)zk(t)]histories=E[E[xtzaff c[,t]]E[zk,tzaff c[,t]]]histories =E[E[xtzk,tzaff c[,t]]]histories =xtzk,t,

where the second step comes from the fact that conditioning on the history of zaffc effectively also conditions on the history of Zk with zk(t)=E[zk,t|zaffc[,t]] (so x and zk are independent when conditioning on the zaffc history), the last step follows from the law of total expectation, and zk,t is the measured amount of Zk at time t. From Equations 5.6; 5.7, it follows that

(5.8)

Cov(xt,zk,t)=Cov(x¯(t),z¯k(t)),

where z¯k(t)=E[zk,t|zaffc[,t]]=zk(t), where the last step comes from the fact that the time trajectory of zk is set through the conditioning of the upstream histories. Intuitively, Equation 5.8 says that when X does not affect Zk, the stochastic fluctuations of X average out when taking the covariance between X and Zk. Strikingly, this is independent of any type of feedback that X may impose through interactions in the cloud of components z(t). As a result, the same should hold for Y, and since y¯(t) is governed by the same differential equation as x¯, the intrinsic fluctuations that differentiate X and Y will average out when taking the covariances with Zk.

That is, dividing the right equation in Equation 5.5 with α, we write the general solution for x¯(t) and y¯(t)/α, and find

(5.9)

x¯(t)=x¯(0)e0tβ(u)du+0te(0tβ(u)du0tβ(v)dv)R(t)dt

(5.10)

y¯(t)/α=y¯(0)e0tβ(u)du/α+0te(0tβ(u)du0tβ(v)dv)R(t)dt

Taking the average over all histories and subtracting the equations we have

(5.11)

E[x¯(t)]historiesE[y¯(t)]histories=E[(x¯(0)y¯(0)/α)e0tβ(u)du]historiesxtyt/α=E[(x¯(0)y¯(0)/α)e0tβ(u)du]histories,

where in the second step we used Equation 5.6 which also holds for y by symmetry. We now invoke the requirement that the averages xt and yt are stationary, meaning they are constant over time. In that case, xtyt/α is constant over time, and so

(5.12)

xtyt/α=limt(xtyt/α).

Substituting Equation 5.11, we thus have

(5.13)

xtyt/α=E[(x¯(0)y¯(0)/α)e0β(u)du]histories.

Now, we must have 0β(u)du when βt=limT1T0Tβ(u)du>0. Therefore, the right-hand side of Equation 5.13 becomes 0:

(5.14)

xtyt/α=E[(x¯(0)y¯(0)/α)e0β(u)du]histories=0,

Similarly, we now multiply Equations 5.10; 5.9 with zk(t), average over all histories, and subtract to obtain

(5.15)

llE[x¯(t)zk(t)]historiesE[y¯(t)zk(t)]histories=E[(x¯(0)y¯(0)/α)zk(t)e0tβ(u)du]historiesxtzk,tytzk,t/α=E[(x¯(0)y¯(0)/α)zk(t)e0tβ(u)du]histories=0,

where in the second step we used Equation 5.7 which also holds for y by symmetry. The last step follows when xtzk,t and ytzk,t have reached stationarity and are constant over time, along with βt=limT1T0Tβ(u)du>0.

It then follows from Equations 5.14; 5.15 that

(5.16)

x=y/α&Cov(x,zk)=Cov(y,zk)/α.

Dividing Cov(x,zk) by xz, and Cov(y,zk)/α by yz/α, we find ηxzk=ηyzk.

If the reporter Y is engineered to be passive (i.e., it does not affect components in the network), then a violation of Equation 2 would imply that X affects Zk. Otherwise, such a violation would imply that X or Y affect Zk.

Thus far, we assumed that all the components not affected by X or Y are part of a continuous-time Markov chain. This was in order to make a rigorous definition of causal interaction in our framework as a path in the topology of the transition rates. Alternatively, if we relax the requirement that the components not affected by X or Y be Markov chains (i.e. they can be a set of arbitrary stochastic processes), we can operationally define ‘no causal interaction from X or Y’ to mean that we can condition on the history of those stochastic processes and write down Equations 5.3; 5.4. We can then operationally define any violation of Equation 2 as a ‘causal interaction from X or Y’ to a stochastic process Zk.

Continue Reading