{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T07:32:34Z","timestamp":1771659154591,"version":"3.50.1"},"reference-count":47,"publisher":"Oxford University Press (OUP)","issue":"5","license":[{"start":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T00:00:00Z","timestamp":1552003200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,10,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In many approaches developed for defining complex networks, the main assumption is that the network is in a relatively stable state that can be approximated with a fixed topology. However, in several applications, this approximation is not adequate because (a) the system modelled is dynamic by nature, and (b) the changes are an essential characteristic that cannot be approximated. Temporal networks capture changes in the topology of networks by including the temporal information associated with their structural connections, that is, links or edges. Here, we focus on controllability of temporal networks, that is, the study of steering the state of a network to any desired state at deadline $t_f$ within $\\Delta t=t_f - t_0$ steps through stimulating key nodes called driver nodes. Recent studies provided analytical approaches to find a maximum controllable subspace for an arbitrary set of driver nodes. However, finding the minimum number of driver nodes $N_c$ required to reach full control is computationally prohibitive. In this article, we propose a heuristic algorithm that quickly finds a suboptimal set of driver nodes with size $N_s \\geq N_c$. We conduct experiments on synthetic and real-world temporal networks induced from ant colonies and e-mail communications of a manufacturing company. The empirical results in both cases show the heuristic algorithm efficiently identifies a small set of driver nodes that can fully control the networks. Also, as shown in the case of ants\u2019 interactions networks, the driver nodes tend to have a large degree in temporal networks. Furthermore, we analyze the behavior of driver nodes within the context of their datasets, through which, we observe that queen ants tend to avoid becoming a driver node.<\/jats:p>","DOI":"10.1093\/comnet\/cnz004","type":"journal-article","created":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T04:22:17Z","timestamp":1547785337000},"page":"720-748","source":"Crossref","is-referenced-by-count":19,"title":["Identifying and using driver nodes in temporal networks"],"prefix":"10.1093","volume":"7","author":[{"given":"Babak","family":"Ravandi","sequence":"first","affiliation":[{"name":"Department of Computer and Information Technology, Purdue University, West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fatma","family":"Mili","sequence":"additional","affiliation":[{"name":"College of Computing and Informatics, University of North Carolina at Charlotte, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John A","family":"Springer","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Technology, Purdue University, West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2019,3,8]]},"reference":[{"key":"2019101609185807000_B1","volume-title":"Sync: The Emerging Science of Spontaneous Order","author":"Strogatz","year":"2003"},{"key":"2019101609185807000_B2","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1016\/j.neuroimage.2009.10.003","article-title":"Complex network measures of brain connectivity: uses and interpretations","volume":"52","author":"Rubinov,","year":"2010","journal-title":"Neuroimage"},{"key":"2019101609185807000_B3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-79992-4_37","article-title":"The Heart Pacemaker by Cellular Automata on Complex Networks","volume-title":"Cellular Automata. ACRI","author":"Makowiec","year":"2008"},{"key":"2019101609185807000_B4","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0010-8545(03)00126-7","article-title":"Polycatenation, polythreading and polyknotting in coordination network chemistry","volume":"246","author":"Carlucci,","year":"2003","journal-title":"Coord. Chem. Rev."},{"key":"2019101609185807000_B5","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1093\/comnet\/cnu051","article-title":"Controllability of complex networks for sustainable system dynamics","volume":"3","author":"Benavides,","year":"2015","journal-title":"J. Complex Netw."},{"key":"2019101609185807000_B6","doi-asserted-by":"crossref","first-page":"2447","DOI":"10.1038\/ncomms3447","article-title":"Exact controllability of complex networks","volume":"4","author":"Yuan,","year":"2013","journal-title":"Nat. Commun."},{"key":"2019101609185807000_B7","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1093\/comnet\/cnu029","article-title":"Analysis of critical and redundant nodes in controlling directed and undirected complex networks using dominating sets","volume":"2","author":"Nacher,","year":"2014","journal-title":"J. Complex Netw."},{"key":"2019101609185807000_B8","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","article-title":"Temporal networks","volume":"519","author":"Holme,","year":"2012","journal-title":"Phys. Rep."},{"key":"2019101609185807000_B9","doi-asserted-by":"crossref","first-page":"016105","DOI":"10.1103\/PhysRevE.84.016105","article-title":"Path lengths, correlations, and centrality in temporal networks","volume":"84","author":"Pan,","year":"2011","journal-title":"Phys. Rev. E Stat. Nonlin. Soft. Matter. Phys."},{"key":"2019101609185807000_B10","doi-asserted-by":"crossref","first-page":"5024","DOI":"10.1038\/ncomms6024","article-title":"Causality-driven slow-down and speed-up of diffusion in non-Markovian temporal networks","volume":"5","author":"Scholtes,","year":"2014","journal-title":"Nat. Commun."},{"key":"2019101609185807000_B11","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1093\/bib\/bbp057","article-title":"Toward the dynamic interactome: it\u2019s about time","volume":"11","author":"Przytycka,","year":"2010","journal-title":"Brief. Bioinform."},{"key":"2019101609185807000_B12","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/j.jneumeth.2010.08.027","article-title":"Tracking brain dynamics via time-dependent network analysis","volume":"193","author":"Dimitriadis,","year":"2010","journal-title":"J. Neurosci. Meth."},{"key":"2019101609185807000_B13","doi-asserted-by":"crossref","first-page":"025102","DOI":"10.1103\/PhysRevE.83.025102","article-title":"Small but slow world: How network topology and burstiness slow down spreading","volume":"83","author":"Karsai,","year":"2011","journal-title":"Phys. Rev. E Stat. Nonlin. Soft. Matter. Phys."},{"key":"2019101609185807000_B14","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1109\/TAC.1974.1100557","article-title":"Structural controllability","volume":"19","author":"Lin,","year":"1974","journal-title":"IEEE Trans. Automat. Contr."},{"key":"2019101609185807000_B15","article-title":"Matrices and matroids for systems analysis","volume-title":"Algorithms and combinatorics","author":"Murota,","year":"2000"},{"key":"2019101609185807000_B16","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1126\/science.aai7488","article-title":"The fundamental advantages of temporal networks","volume":"358","author":"Li,","year":"2017","journal-title":"Science"},{"key":"2019101609185807000_B17","doi-asserted-by":"crossref","first-page":"123055","DOI":"10.1088\/1367-2630\/16\/12\/123055","article-title":"Structural controllability of temporal networks","volume":"16","author":"P\u00f3sfai,","year":"2014","journal-title":"New J. Phys."},{"key":"2019101609185807000_B18","article-title":"Controllability of temporal networks: an analysis using higher-order networks","author":"Zhang,","year":"2017"},{"key":"2019101609185807000_B19","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: An Introduction","author":"Newman,","year":"2010"},{"key":"2019101609185807000_B20","doi-asserted-by":"crossref","first-page":"1037","DOI":"10.1145\/3097983.3098145","article-title":"When is a network a network?: Multi-order graphical model selection in pathways and temporal networks","volume-title":"Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"Scholtes,","year":"2017"},{"key":"2019101609185807000_B21","doi-asserted-by":"crossref","first-page":"8422","DOI":"10.1038\/srep08422","article-title":"Intrinsic dynamics induce global symmetry in network controllability","volume":"5","author":"Zhao,","year":"2015","journal-title":"Sci. Rep."},{"key":"2019101609185807000_B22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1371\/journal.pone.0038398","article-title":"Nodal dynamics, not degree distributions, determine the structural controllability of complex networks","volume":"7","author":"Cowan,","year":"2012","journal-title":"PLoS One"},{"key":"2019101609185807000_B23","doi-asserted-by":"crossref","first-page":"4630","DOI":"10.1038\/ncomms5630","article-title":"Memory in network flows and its effects on spreading dynamics and community detection","volume":"5","author":"Rosvall,","year":"2014","journal-title":"Nat. Commun."},{"key":"2019101609185807000_B24","volume-title":"Applied Nonlinear Control","author":"Slotine,","year":"1991"},{"key":"2019101609185807000_B25","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/TCNS.2014.2310254","article-title":"Controllability metrics, limitations and algorithms for complex networks","volume":"1","author":"Pasqualetti,","year":"2014","journal-title":"IEEE Trans. Control Netw. Syst."},{"key":"2019101609185807000_B26","doi-asserted-by":"crossref","first-page":"5379","DOI":"10.1038\/srep05379","article-title":"Connecting core percolation and controllability of complex networks","volume":"4","author":"Jia,","year":"2014","journal-title":"Sci. Rep."},{"key":"2019101609185807000_B27","doi-asserted-by":"crossref","first-page":"2668","DOI":"10.1109\/TAC.2014.2328757","article-title":"Controllability and observability of network-of-networks via cartesian products","volume":"59","author":"Chapman,","year":"2014","journal-title":"IEEE Trans. Automat. Cont."},{"key":"2019101609185807000_B28","doi-asserted-by":"publisher","first-page":"5743","DOI":"10.1109\/ACC.2009.5160170","article-title":"Structural controllability of multi-agent systems","volume-title":"2009 American Control Conference","author":"Zamani,","year":"2009"},{"key":"2019101609185807000_B29","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1137\/0301010","article-title":"Mathematical description of linear dynamical systems","volume":"1","author":"Kalman,","year":"1963","journal-title":"J. Soc. Ind. Appl. Math. Contr."},{"key":"2019101609185807000_B30","volume-title":"Introduction to Algorithms","author":"Cormen,","year":"2001","edition":"2nd edn"},{"key":"2019101609185807000_B31","doi-asserted-by":"crossref","first-page":"39978","DOI":"10.1038\/srep39978","article-title":"Trade-offs between driving nodes and time-to-control in complex networks","volume":"7","author":"Pequito,","year":"2017","journal-title":"Sci. Rep."},{"key":"2019101609185807000_B32","volume-title":"Linear Optimal Control Systems","author":"Kwakernaak,","year":"1972"},{"key":"2019101609185807000_B33","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"Garey,","year":"1979"},{"key":"2019101609185807000_B34","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","article-title":"Reducibility among Combinatorial Problems","volume-title":"Complexity of Computer Computations","author":"Karp,","year":"1972"},{"key":"2019101609185807000_B35","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1137\/1.9781611973105.24","article-title":"Poly-logarithmic approximation for maximum node disjoint paths with constant congestion","volume-title":"Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms","author":"Chekuri,","year":"2013"},{"key":"2019101609185807000_B36","first-page":"628","article-title":"Edge disjoint paths revisited","volume-title":"Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms","author":"Chekuri,","year":"2003"},{"key":"2019101609185807000_B37","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1145\/938985.938999","article-title":"Minimum energy disjoint path routing in wireless ad-hoc networks","volume-title":"Proceedings of the 9th Annual International Conference on Mobile Computing and Networking","author":"Srinivas,","year":"2003"},{"key":"2019101609185807000_B38","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","article-title":"Maximal flow through a network","volume":"8","author":"Ford,","year":"1956","journal-title":"Can. J. Math."},{"key":"2019101609185807000_B39","first-page":"77","volume-title":"Population-Based Heuristics","author":"Salhi,","year":"2017"},{"key":"2019101609185807000_B40","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1371\/journal.pone.0020298","article-title":"Time-ordered networks reveal limitations to information flow in ant colonies","volume":"6","author":"Blonder,","year":"2011","journal-title":"PLoS One"},{"key":"2019101609185807000_B41","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/978-3-642-21863-7_17","article-title":"Matching organizational structure and social network extracted from email communication","volume-title":"Business Information Systems","author":"Michalski,","year":"2011"},{"key":"2019101609185807000_B42","year":"2018"},{"key":"2019101609185807000_B43","doi-asserted-by":"crossref","first-page":"3002","DOI":"10.1038\/ncomms3002","article-title":"Emergence of bimodality in controlling complex networks","volume":"4","author":"Jia,","year":"2013","journal-title":"Nat. Commun."},{"key":"2019101609185807000_B44","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.physa.2018.09.146","article-title":"Altering control modes of complex networks based on edge removal","volume":"516","author":"Zhang,","year":"2019","journal-title":"Phys. Stat. Mech. Appl."},{"key":"2019101609185807000_B45","doi-asserted-by":"crossref","first-page":"38209","DOI":"10.1038\/srep38209","article-title":"Input graph: the hidden geometry in controlling complex networks","volume":"6","author":"Zhang,","year":"2016","journal-title":"Sci. Rep."},{"key":"2019101609185807000_B46","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1038\/nature10011","article-title":"Controllability of complex networks","volume":"473","author":"Liu,","year":"2011","journal-title":"Nature"},{"key":"2019101609185807000_B47","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195124415.001.0001","volume-title":"Complexity: A Guided Tour","author":"Mitchell,","year":"2009"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/7\/5\/720\/30157045\/cnz004.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/7\/5\/720\/30157045\/cnz004.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,14]],"date-time":"2024-07-14T05:38:14Z","timestamp":1720935494000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/7\/5\/720\/5372353"}},"subtitle":[],"editor":[{"given":"Petter","family":"Holme","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2019,3,8]]},"references-count":47,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2019,3,8]]},"published-print":{"date-parts":[[2019,10,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnz004","relation":{},"ISSN":["2051-1329"],"issn-type":[{"value":"2051-1329","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2019,10]]},"published":{"date-parts":[[2019,3,8]]}}}