{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:13:43Z","timestamp":1760710423908,"version":"3.41.2"},"reference-count":31,"publisher":"Oxford University Press (OUP)","issue":"5","license":[{"start":{"date-parts":[[2021,9,18]],"date-time":"2021-09-18T00:00:00Z","timestamp":1631923200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior (CAPES), Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,9,18]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Time-varying graphs (TVGs) enable the study and understanding of the dynamics of many real-world networked systems. The notion of centrality in TVG scenarios generally refers to metrics that assess the relative importance of nodes over time in the evolution of a complex dynamic network. In contrast, the notion of Time Centrality, which evaluates the relative importance of time instants in dynamic complex networks, is still little explored. Indeed, the few works on Time Centrality base their findings on the study of diffusion processes, for example, identifying the best time instant to start the dissemination of a message envisaging a more efficient diffusion given the expected network dynamics. In contrast, in this work, we study Time Centrality from a network connectivity perspective. In this context, we propose two connectivity-based metrics to identify the most important time instants in the network. The first metric is the Time Degree Centrality that, analogously to node degree centrality, computes the number of connections that each time instant has. The second metric, Time PageRank Centrality, searches for the time instants that receive the largest number of accumulated connections since they are considered weights at each time instant. To validate the metrics, we model a public multimodal transport network considering time as an aspect of each node. We then apply the proposed metrics and analyse the results from a connectivity-based time centrality perspective. Our results show that the two metrics can identify the most important time instants in different scenarios of complex network dynamics.<\/jats:p>","DOI":"10.1093\/comnet\/cnaa048","type":"journal-article","created":{"date-parts":[[2020,12,21]],"date-time":"2020-12-21T21:16:54Z","timestamp":1608585414000},"source":"Crossref","is-referenced-by-count":2,"title":["Connectivity-based time centrality in time-varying graphs"],"prefix":"10.1093","volume":"9","author":[{"given":"Ana","family":"Cludia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"de Souza","sequence":"additional","affiliation":[{"name":"Education and Technology Department, Instituto Federal do Sudeste de Minas Gerais (IF SUDESTE MG), Juiz de Fora, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex Borges","family":"Vieira","sequence":"additional","affiliation":[{"name":"Computer Science Department, Universidade Federal de Juiz de Fora (UFJF), Juiz de Fora, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus","family":"Wehmuth","sequence":"additional","affiliation":[{"name":"Department of Computational and Mathematical Methods, National Laboratory for Scientific Computing (LNCC), Petr\u00f3polis, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Artur","family":"Ziviani","sequence":"additional","affiliation":[{"name":"Department of Computational and Mathematical Methods, National Laboratory for Scientific Computing (LNCC), Petr\u00f3polis, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2021,9,18]]},"reference":[{"key":"2021091810210904900_B1","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1007\/978-3-642-22450-8_27","article-title":"Time-varying graphs and dynamic networks","volume-title":"Ad-hoc, Mobile, and Wireless Networks","author":"Casteigts,","year":"2011"},{"key":"2021091810210904900_B2","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":"2021091810210904900_B3","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1016\/j.physa.2008.11.021","article-title":"Temporal graphs","volume":"388","author":"Kostakos,","year":"2009","journal-title":"Physica A"},{"key":"2021091810210904900_B4","first-page":"1","article-title":"A unifying model for representing time-varying graphs","volume-title":"Proceedings of the IEEE International Conference on Data Science and Advanced Analytics (DSAA)","author":"Wehmuth,","year":"2015"},{"key":"2021091810210904900_B5","doi-asserted-by":"crossref","first-page":"1170","DOI":"10.1086\/228631","article-title":"Power and centrality: a family of measures","volume":"92","author":"Bonacich,","year":"1987","journal-title":"Am. J. Sociol."},{"key":"2021091810210904900_B6","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","article-title":"Centrality in social networks conceptual clarification","volume":"1","author":"Freeman,","year":"1979","journal-title":"Soc. Netw."},{"key":"2021091810210904900_B7","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","article-title":"The anatomy of a large-scale hypertextual Web search engine","volume":"30","author":"Brin,","year":"1998","journal-title":"Comput. Netw. ISDN Syst."},{"key":"2021091810210904900_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":"2021091810210904900_B9","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1038\/35075138","article-title":"Lethality and centrality in protein networks","volume":"411","author":"Jeong,","year":"2001","journal-title":"Nature"},{"key":"2021091810210904900_B10","doi-asserted-by":"crossref","first-page":"1","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"},{"key":"2021091810210904900_B11","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1145\/2615569.2615687","article-title":"Centrality rankings in multiplex networks","volume-title":"Proceedings of the 2014 ACM Conference on Web science","author":"Sol\u00e9-Ribalta,","year":"2014"},{"key":"2021091810210904900_B12","doi-asserted-by":"crossref","first-page":"026107","DOI":"10.1103\/PhysRevE.85.026107","article-title":"Temporal node centrality in complex networks","volume":"85","author":"Kim,","year":"2012","journal-title":"Phys. Rev. E"},{"key":"2021091810210904900_B13","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/978-3-642-36461-7_2","article-title":"Graph metrics for temporal networks","volume-title":"Temporal Networks","author":"Nicosia,","year":"2013"},{"key":"2021091810210904900_B14","doi-asserted-by":"crossref","first-page":"1550023","DOI":"10.1142\/S021952591550023X","article-title":"Time centrality in dynamic complex networks","volume":"18","author":"Costa,","year":"2015","journal-title":"Adv. Complex Syst. (ACS)"},{"key":"2021091810210904900_B15","doi-asserted-by":"crossref","first-page":"140056","DOI":"10.1038\/sdata.2014.56","article-title":"The multilayer temporal network of public transport in great britain","volume":"2","author":"Gallotti,","year":"2015","journal-title":"Sci. Data"},{"key":"2021091810210904900_B16","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.tcs.2016.08.017","article-title":"On multiaspect graphs","volume":"651","author":"Wehmuth,","year":"2016","journal-title":"Theoret. Comput. Sci."},{"key":"2021091810210904900_B17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"Bondy,","year":"2008"},{"key":"2021091810210904900_B18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph Theory","author":"Diestel,","year":"2010"},{"volume-title":"Digraphs: Theory, Algorithms and Applications","year":"2007","author":"Bang-Jansen,","key":"2021091810210904900_B19"},{"key":"2021091810210904900_B20","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: An Introduction","author":"Newman,","year":"2010"},{"key":"2021091810210904900_B21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3390\/a10010001","article-title":"Multiaspect graphs: algebraic representation and algorithms","volume":"10","author":"Wehmuth,","year":"2017","journal-title":"Algorithms"},{"key":"2021091810210904900_B22","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1121\/1.1906679","article-title":"Communication patterns in task-oriented groups","volume":"22","author":"Bavelas,","year":"1950","journal-title":"J. Acoust. Soc. Am."},{"key":"2021091810210904900_B23","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/BF02289527","article-title":"The centrality index of a graph","volume":"31","author":"Sabidussi,","year":"1966","journal-title":"Psychometrika"},{"key":"2021091810210904900_B24","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/3033543","article-title":"A set of measures of centrality based on betweenness","volume":"40","author":"Freeman,","year":"1977","journal-title":"Sociometry"},{"key":"2021091810210904900_B25","article-title":"Centrality in social networks conceptual clarification","volume":"215","author":"Freeman,","year":"1978","journal-title":"Soc. Netw."},{"key":"2021091810210904900_B26","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","article-title":"The anatomy of a large-scale hypertextual web search engine","volume":"30","author":"Brin,","year":"1998","journal-title":"Comput. Netw. ISDN Syst."},{"journal-title":"National Public Transport Data Repository (NPTDR)","year":"2017","key":"2021091810210904900_B27"},{"journal-title":"Innovata LLC","year":"2017","key":"2021091810210904900_B28"},{"key":"2021091810210904900_B29","article-title":"Analysing information flows and key mediators through temporal centrality metrics","volume":"3","author":"Tang,","journal-title":"Proceedings of the 3rd Workshop on Social Network Systems"},{"key":"2021091810210904900_B30","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1109\/CCDC.2017.7978752","article-title":"Ranking the key nodes with temporal degree deviation centrality on complex networks","author":"Wang,","year":"2017","journal-title":"2017 29th Chinese Control And Decision Conference (CCDC)"},{"key":"2021091810210904900_B31","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1093\/comnet\/cnu016","article-title":"Multilayer networks","volume":"2","author":"Kivel,","year":"2014","journal-title":"J. Complex Netw."}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/9\/5\/cnaa048\/40408118\/cnaa048.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/9\/5\/cnaa048\/40408118\/cnaa048.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,18]],"date-time":"2021-09-18T10:21:46Z","timestamp":1631960506000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/doi\/10.1093\/comnet\/cnaa048\/6372188"}},"subtitle":[],"editor":[{"given":"Petter","family":"Holme","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2021,9,18]]},"references-count":31,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,9,18]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnaa048","relation":{},"ISSN":["2051-1310","2051-1329"],"issn-type":[{"type":"print","value":"2051-1310"},{"type":"electronic","value":"2051-1329"}],"subject":[],"published-other":{"date-parts":[[2021,10,1]]},"published":{"date-parts":[[2021,9,18]]},"article-number":"cnaa048"}}