Dynamic structural equation models for directed cyclic graphs: the structural identifiability problem

Abstract

Network systems are commonly encountered and investigated in various disciplines, and network dynamics that refer to collective node state changes over time are one area of particular interests of many researchers. Recently, dynamic structural equation model (DSEM) has been introduced into the field of network dynamics as a powerful statistical inference tool. In this study, in recognition that parameter identifiability is the prerequisite of reliable parameter inference, a general and efficient approach is proposed for the first time to address the structural parameter identifiability problem of linear DSEMs for cyclic networks. The key idea is to transform a DSEM to an equivalent frequency domain representation, then Masons gain is employed to deal with feedback loops in cyclic networks when generating identifiability equations. The identifiability result of every unknown parameter is obtained with the identifiability matrix method. The proposed approach is computationally efficient because no symbolic or expensive numerical computations are involved, and can be applicable to a broad range of linear DSEMs. Finally, selected benchmark examples of brain networks, social networks and molecular interaction networks are given to illustrate the potential application of the proposed method, and we compare the results from DSEMs, state-transition models and ordinary differential equation models.