On the priority maximum matching of structural controllability of temporal networks

Temporal networks are such networks where nodes and interactions may appear and disappear at various time scales. The empirical analyses of temporal networks indicate that insufficient attentions have been paid to the embedded temporal features, and to the most interest of this paper, the study on structural controllability of temporal networks is absent. We propose the Priority Maximum Matching method in this paper to explore structural controllability of temporal networks, with which we locate as-least-as-possible driven nodes required by the structural controllability. We also verify the feasibility and reliability of the proposed method with several data sets of empirical temporal networks, which shade new light on the study of controllability without wiping out the temporal information.