{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T02:33:30Z","timestamp":1774060410603,"version":"3.50.1"},"reference-count":93,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2022,6,29]],"date-time":"2022-06-29T00:00:00Z","timestamp":1656460800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"name":"European Union\u2019s Horizon 2020 research"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,29]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Centrality measures are used in network science to assess the centrality of vertices or the position they occupy in a network. There are a large number of centrality measures according to some criterion. However, the generalizations of the most well-known centrality measures for weighted networks, degree centrality, closeness centrality and betweenness centrality have solely assumed the edge weights to be constants. This article proposes a methodology to generalize degree, closeness and betweenness centralities taking into account the variability of edge weights in the form of closed intervals (interval-weighted networks, IWN). We apply our centrality measures approach to two real-world IWN. The first is a commuter network in mainland Portugal, between the 23 NUTS 3 Regions. The second focuses on annual merchandise trade between 28 European countries, from 2003 to 2015.<\/jats:p>","DOI":"10.1093\/comnet\/cnac031","type":"journal-article","created":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T09:18:29Z","timestamp":1658481509000},"source":"Crossref","is-referenced-by-count":5,"title":["Centrality measures in interval-weighted networks"],"prefix":"10.1093","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8423-4653","authenticated-orcid":false,"given":"H\u00e9lder","family":"Alves","sequence":"first","affiliation":[{"name":"Instituto Superior de Servi\u00e7o Social do Porto & LIAAD-INESC TEC ISSSP, , Porto, Portugal"}]},{"given":"Paula","family":"Brito","sequence":"additional","affiliation":[{"name":"Faculdade de Economia, Universidade do Porto & LIAAD-INESC TEC FEP, , Porto, Portugal"}]},{"given":"Pedro","family":"Campos","sequence":"additional","affiliation":[{"name":"Faculdade de Economia, Universidade do Porto & LIAAD-INESC TEC FEP, , Porto, Portugal"}]}],"member":"286","published-online":{"date-parts":[[2022,7,22]]},"reference":[{"key":"2022072209181700700_B1","volume-title":"Network Science","author":"Barabasi,","year":"2016"},{"key":"2022072209181700700_B2","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.socnet.2004.11.008","article-title":"Centrality and network flow","volume":"27","author":"Borgatti,","year":"2005","journal-title":"Soc. Netw."},{"key":"2022072209181700700_B3","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/j.socnet.2007.11.001","article-title":"On variants of shortest-path betweenness centrality and their generic computation","volume":"30","author":"Brandes,","year":"2008","journal-title":"Soc. Netw."},{"key":"2022072209181700700_B4","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/j.socnet.2015.08.003","article-title":"Maintaining the duality of closeness and betweenness centrality","volume":"44","author":"Brandes,","year":"2016","journal-title":"Social Networks"},{"key":"2022072209181700700_B5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1140\/epjds\/s13688-019-0195-7","article-title":"Centrality in modular networks","volume":"8","author":"Ghalmane,","year":"2019","journal-title":"EPJ Data Sci."},{"key":"2022072209181700700_B6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2016.06.007","article-title":"Vital nodes identification in complex networks","volume":"650","author":"Lu,","year":"2016","journal-title":"Phys. Rep."},{"key":"2022072209181700700_B7","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198805090.001.0001","volume-title":"Networks","author":"Newman,","year":"2018","edition":"2nd edn"},{"key":"2022072209181700700_B8","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":"2022072209181700700_B9","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1016\/j.socnet.2005.11.005","article-title":"A Graph-theoretic perspective on centrality","volume":"28","author":"Borgatti,","year":"2006","journal-title":"Soc. Netw."},{"key":"2022072209181700700_B10","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":"2022072209181700700_B11","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":"2022072209181700700_B12","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/978-3-319-78512-7_10","article-title":"Network centrality: an introduction","volume-title":"A Mathematical Modeling Approach from Nonlinear Dynamics to Complex Systems","author":"Rodrigues,","year":"2019"},{"key":"2022072209181700700_B13","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":"2022072209181700700_B14","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1080\/0022250X.1972.9989806","article-title":"Factoring and weighting approaches to status scores and clique identification","volume":"2","author":"Bonacich,","year":"1972","journal-title":"J. Math. Sociol."},{"key":"2022072209181700700_B15","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":"2022072209181700700_B16","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF02289026","article-title":"A new status index derived from sociometric analysis","volume":"18","author":"Katz,","year":"1953","journal-title":"Psychometrika"},{"key":"2022072209181700700_B17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0378-8733(89)90016-6","article-title":"Rethinking centrality: methods and examples","volume":"11","author":"Stephenson,","year":"1989","journal-title":"Soc. Netw."},{"key":"2022072209181700700_B18","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0378-8733(91)90017-N","article-title":"Centrality in valued graphs: a measure of betweenness based on network flow","volume":"13","author":"Freeman,","year":"1991","journal-title":"Soc. Netw."},{"key":"2022072209181700700_B19","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0378-8733(97)00007-5","article-title":"Integration and radiality: measuring the extent of an individual\u2019s connectedness and reachability in a network","volume":"20","author":"Valente,","year":"1998","journal-title":"Soc. Netw."},{"key":"2022072209181700700_B20","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0165-4896(03)00028-3","article-title":"Centrality and power in social networks - a game theoretic approach","volume":"46","author":"G\u00f3mez,","year":"2003","journal-title":"Math. Soc. Sci."},{"key":"2022072209181700700_B21","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.socnet.2004.11.009","article-title":"A measure of betweenness centrality based on random walks","volume":"27","author":"Newman,","year":"2005","journal-title":"Soc. Netw."},{"key":"2022072209181700700_B22","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/j.ejor.2012.11.027","article-title":"Modeling centrality measures in social network analysis using bi-criteria network flow optimization problems","volume":"226","author":"G\u00f3mez,","year":"2013","journal-title":"Eur. J. Oper. Res."},{"key":"2022072209181700700_B23","doi-asserted-by":"crossref","first-page":"052808","DOI":"10.1103\/PhysRevE.90.052808","article-title":"Localization and centrality in networks","volume":"90","author":"Martin,","year":"2014","journal-title":"Phys. Rev. E"},{"key":"2022072209181700700_B24","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.physa.2013.12.031","article-title":"A new method of identifying influential nodes in complex networks based on TOPSIS","volume":"399","author":"Du,","year":"2014","journal-title":"Physica A"},{"key":"2022072209181700700_B25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/ncomms10168","article-title":"The H-index of a network node and its relation to degree and coreness","volume":"7","author":"Lu,","year":"2016","journal-title":"Nat. Commun."},{"key":"2022072209181700700_B26","doi-asserted-by":"crossref","first-page":"614","DOI":"10.3390\/e19110614","article-title":"How to identify the most powerful node in complex networks? A novel entropy centrality approach","volume":"19","author":"Qiao,","year":"2017","journal-title":"Entropy"},{"key":"2022072209181700700_B27","doi-asserted-by":"crossref","first-page":"15407","DOI":"10.1073\/pnas.1801378116","article-title":"A tensor-based framework for studying eigenvector multicentrality in multilayer networks","volume":"116","author":"Wu,","year":"2019","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2022072209181700700_B28","first-page":"600","article-title":"A variant of the current flow betweenness centrality and its application in urban networks","volume":"347","author":"Agryzkov,","year":"2019","journal-title":"Appl. Math. Comput."},{"key":"2022072209181700700_B29","doi-asserted-by":"crossref","first-page":"022304","DOI":"10.1103\/PhysRevE.101.022304","article-title":"Resilience centrality in complex networks","volume":"101","author":"Zhang,","year":"2020","journal-title":"Phys. Rev. E"},{"key":"2022072209181700700_B30","doi-asserted-by":"crossref","first-page":"3747","DOI":"10.1073\/pnas.0400087101","article-title":"The architecture of complex weighted networks","volume":"101","author":"Barrat,","year":"2004","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2022072209181700700_B31","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","article-title":"A faster algorithm for betweenness centrality","volume":"25","author":"Brandes,","year":"2001","journal-title":"J. Math. Sociol."},{"key":"2022072209181700700_B32","doi-asserted-by":"crossref","first-page":"016132","DOI":"10.1103\/PhysRevE.64.016132","article-title":"Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality","volume":"64","author":"Newman,","year":"2001","journal-title":"Phys. Rev. E"},{"key":"2022072209181700700_B33","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.socnet.2010.03.006","article-title":"Node centrality in weighted networks: generalizing degree and shortest paths","volume":"32","author":"Opsahl,","year":"2010","journal-title":"Soc. Netw."},{"key":"2022072209181700700_B34","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":"2022072209181700700_B35","doi-asserted-by":"crossref","first-page":"210","DOI":"10.4153\/CJM-1957-024-0","article-title":"A simple algorithm for finding maximal network flows and an application to the Hitchcock problem","volume":"9","author":"Ford,","year":"1957","journal-title":"Can. J. Math."},{"key":"2022072209181700700_B36","volume-title":"Flows in Networks","author":"Ford,","year":"1962"},{"key":"2022072209181700700_B37","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0360-8352(93)90242-P","article-title":"Order relation between intervals and its application to shortest path problem","volume":"25","author":"Okada,","year":"1993","journal-title":"Comput. Indus. Eng."},{"key":"2022072209181700700_B38","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0165-0114(99)00090-1","article-title":"A fuzzy max-\u00f4\u2013\u00b0\u00bcflow min-cut theorem","volume":"119","author":"Diamond,","year":"2001","journal-title":"Fuzzy Sets Syst."},{"key":"2022072209181700700_B39","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s10700-005-3665-2","article-title":"Shortest path problem on a network with imprecise edge weight","volume":"4","author":"Nayeem,","year":"2005","journal-title":"Fuzzy Optim. Decis. Mak."},{"key":"2022072209181700700_B40","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10700-005-4916-y","article-title":"Solving the shortest path problem with interval arcs","volume":"5","author":"Sengupta,","year":"2006","journal-title":"Fuzzy Optim. Decis. Mak."},{"key":"2022072209181700700_B41","first-page":"1","article-title":"The p-center problem on fuzzy networks and reduction of cost","volume":"5","author":"Nayeem,","year":"2008","journal-title":"Iran. J. Fuzzy Syst."},{"key":"2022072209181700700_B42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-84800-326-2_8","article-title":"Interval-weighted graphs and flow networks","volume-title":"Knowledge Processing with Interval and Soft Computing","author":"Hu,","year":"2008"},{"key":"2022072209181700700_B43","first-page":"120","article-title":"Fuzzy partial-order relations for intervals and interval weighted graphs","volume-title":"IEEE Symposium on Foundations of Computational Intelligence (FOCI)","author":"Hu,","year":"2007"},{"key":"2022072209181700700_B44","first-page":"18","article-title":"Method and algorithm for interval maximum expected flow in a network","volume":"1","author":"Hossain,","year":"2010","journal-title":"Inform. Technol. Control"},{"key":"2022072209181700700_B45","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1142\/S0218488511006897","article-title":"A new approach for solving the minimum cost flow problem with interval and fuzzy data","volume":"19","author":"Ghiyasvand,","year":"2011","journal-title":"Int. J. Uncertain. Fuzziness Knowl. Based Syst."},{"key":"2022072209181700700_B46","first-page":"2","article-title":"A polynomial interval shortest-route algorithm for acyclic network","volume":"4","author":"Hossain,","year":"2012","journal-title":"Inform. Technol. Control"},{"key":"2022072209181700700_B47","doi-asserted-by":"crossref","first-page":"347","DOI":"10.3233\/IFS-151760","article-title":"On solving maximum and quickest interval-valued flows over time","volume":"30","author":"Rostami,","year":"2016","journal-title":"J. Intell. Fuzzy Syst."},{"key":"2022072209181700700_B48","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.mcm.2011.03.040","article-title":"A genetic algorithm for solving fuzzy shortest path problems with mixed fuzzy arc lengths","volume":"57","author":"Hassanzadeh,","year":"2013","journal-title":"Math. Comput. Model."},{"key":"2022072209181700700_B49","first-page":"203","article-title":"Particle swarm optimisation algorithm for solving shortest path problems with mixed fuzzy arc weights","volume":"8","author":"Ebrahimnejad,","year":"2015","journal-title":"Int. J. Appl. Decis. Sci."},{"key":"2022072209181700700_B50","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.measurement.2016.06.050","article-title":"A novel artificial bee colony algorithm for shortest path problems with fuzzy arc weights","volume":"93","author":"Ebrahimnejad,","year":"2016","journal-title":"Measurement"},{"key":"2022072209181700700_B51","doi-asserted-by":"crossref","first-page":"1527","DOI":"10.1007\/s40747-021-00278-0","article-title":"Modified artificial bee colony algorithm for solving mixed interval-valued fuzzy shortest path problem","volume":"7","author":"Ebrahimnejad,","year":"2021","journal-title":"Complex Intell. Syst."},{"key":"2022072209181700700_B52","doi-asserted-by":"crossref","first-page":"S1767","DOI":"10.1051\/ro\/2020033","article-title":"An acceptability index based approach for solving shortest path problem on a network with interval weights","volume":"55","author":"Ebrahimnejad,","year":"2021","journal-title":"RAIRO Oper. Res."},{"key":"2022072209181700700_B53","volume-title":"Knowledge Processing with Interval and Soft Computing","author":"Hu,","year":"2008"},{"key":"2022072209181700700_B54","volume-title":"Symbolic Data Analysis: Conceptual Statistics and Data Mining","author":"Billard,","year":"2007"},{"key":"2022072209181700700_B55","doi-asserted-by":"crossref","first-page":"1502","DOI":"10.1016\/j.ijar.2013.07.002","article-title":"Statistical reasoning with set-valued information: ontic vs. epistemic views","volume":"55","author":"Couso,","year":"2014","journal-title":"Int. J. Approx. Reason."},{"key":"2022072209181700700_B56","first-page":"269","article-title":"The sign test for interval-valued data","volume-title":"Soft Methods for Data Science. SMPS 2016. Advances in Intelligent Systems and Computing","author":"Grzegorzewski,","year":"2017"},{"key":"2022072209181700700_B57","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717716","volume-title":"Introduction to Interval Analysis","author":"Moore,","year":"2009"},{"key":"2022072209181700700_B58","author":"Dawood,","year":"2011","journal-title":"Theories of Interval Arithmetic"},{"key":"2022072209181700700_B59","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1057\/jors.2012.151","article-title":"Uncertain constrained optimization by interval-oriented algorithm","volume":"65","author":"Karmakar,","year":"2014","journal-title":"J. Oper. Res. Soc."},{"key":"2022072209181700700_B60","doi-asserted-by":"crossref","first-page":"1931","DOI":"10.1007\/s00500-012-0866-9","article-title":"A comparison index for interval ordering based on generalized Hukuhara difference","volume":"16","author":"Guerra,","year":"2012","journal-title":"Soft Comput."},{"key":"2022072209181700700_B61","doi-asserted-by":"crossref","first-page":"351","DOI":"10.3934\/jimo.2006.2.351","article-title":"A novel approach in uncertain programming part I: New arithmetic and order relation for interval numbers","volume":"2","author":"Hu,","year":"2006","journal-title":"J. Indus. Manag. Optim."},{"key":"2022072209181700700_B62","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-89915-0","volume-title":"Fuzzy Preference Ordering of Interval Numbers in Decision Problems","author":"Sengupta,","year":"2009"},{"key":"2022072209181700700_B63","doi-asserted-by":"crossref","first-page":"113","DOI":"10.3390\/axioms8040113","article-title":"Interval analysis and calculus for interval-valued functions of a single variable. Part I: Partial orders, gH-derivative, monotonicity","volume":"8","author":"Stefanini,","year":"2019","journal-title":"Axioms"},{"key":"2022072209181700700_B64","first-page":"38","article-title":"A comparative study of different order relations of intervals","volume":"16","author":"Karmakar,","year":"2012","journal-title":"Reliable Comput."},{"key":"2022072209181700700_B65","first-page":"81","article-title":"Most reliable route method and algorithm based on interval possibilities for a cyclic network","volume":"9","author":"Hossain,","year":"2009","journal-title":"Cybern. Inform. Technol."},{"key":"2022072209181700700_B66","doi-asserted-by":"crossref","first-page":"1360","DOI":"10.1086\/225469","article-title":"The strength of weak ties","volume":"78","author":"Granovetter,","year":"1973","journal-title":"Am. J. Sociol."},{"key":"2022072209181700700_B67","doi-asserted-by":"crossref","first-page":"083030","DOI":"10.1088\/1367-2630\/14\/8\/083030","article-title":"A k-shell decomposition method for weighted networks","volume":"14","author":"Garas,","year":"2012","journal-title":"N. J. Phys."},{"key":"2022072209181700700_B68","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1007\/978-3-540-31856-9_44","article-title":"Centrality measures based on current flow","volume-title":"STACS 2005, Proceedings","author":"Brandes,","year":"2005"},{"key":"2022072209181700700_B69","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2018.01.001","article-title":"Human mobility: models and applications","volume":"734","author":"Barbosa,","year":"2018","journal-title":"Phys. Rep."},{"key":"2022072209181700700_B70","article-title":"Computing the minimum cut and maximum flow of undirected graphs","author":"Schroeder,","year":"2004"},{"key":"2022072209181700700_B71","volume-title":"Network Flows","author":"Ahuja,","year":"1993"},{"key":"2022072209181700700_B72","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-41618-2","volume-title":"Flows in Networks Under Fuzzy Conditions","author":"Bozhenyuk,","year":"2017"},{"key":"2022072209181700700_B73","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1007\/s12046-012-0100-6","article-title":"Solving the minimum flow problem with interval bounds and flows","volume":"37","author":"Ghiyasvand,","year":"2012","journal-title":"Sadhana"},{"key":"2022072209181700700_B74","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connection with graphs","volume":"1","author":"Dijkstra,","year":"1959","journal-title":"Numer. Math."},{"key":"2022072209181700700_B75","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/978-3-319-19003-7_2","article-title":"Measuring centralities for transportation networks beyond structures","volume-title":"Applications of Social Media and Social Network Analysis","author":"Cheng,","year":"2015"},{"key":"2022072209181700700_B76","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1068\/b32128","article-title":"The structure of interurban traffic: a weighted network analysis","volume":"34","author":"De Montis,","year":"2007","journal-title":"Environ. Plan. B"},{"key":"2022072209181700700_B77","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10109-010-0130-8","article-title":"Time evolution of complex networks: commuting systems in insular Italy","volume":"13","author":"De Montis,","year":"2011","journal-title":"J. Geogr. Syst."},{"key":"2022072209181700700_B78","article-title":"Commission Regulation (EU) 2016\/2066 of 21 November 2016 amending the annexes to Regulation (EC) No 1059\/2003 of the European Parliament and of the Council on the establishment of a common classification of territorial units for statistics (NUTS)","year":"2016"},{"key":"2022072209181700700_B79","article-title":"Merchandise trade matrix \u2013 detailed products, exports in thousands of United States dollars, annual","year":"2016"},{"key":"2022072209181700700_B80","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1103\/PhysRevE.88.042810","article-title":"Community core detection in transportation networks","volume":"88","author":"De Leo,","year":"2013","journal-title":"Phys. Rev. E"},{"key":"2022072209181700700_B81","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1140\/epjst\/e2013-01716-4","article-title":"Commuter networks and community detection: a method for planning sub regional areas","volume":"215","author":"De Montis,","year":"2013","journal-title":"Eur. Phys. J. Spec. Top."},{"key":"2022072209181700700_B82","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s11067-007-9027-6","article-title":"Network analysis of commuting flows: a comparative static approach to German data","volume":"7","author":"Patuelli,","year":"2007","journal-title":"Netw. Spatial Econ."},{"key":"2022072209181700700_B83","doi-asserted-by":"crossref","DOI":"10.1038\/s41598-019-48295-x","article-title":"Reconstructing commuters network using machine learning and urban indicators","author":"Spadon,","year":"2019"},{"key":"2022072209181700700_B84","doi-asserted-by":"crossref","first-page":"033404","DOI":"10.1088\/1742-5468\/2016\/03\/033404","article-title":"Network structure of subway passenger flows","volume":"2016","author":"Xu,","year":"2016","journal-title":"J. Stat. Mech."},{"key":"2022072209181700700_B85","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2018\/5961090","article-title":"A passenger flow control method for subway network based on network controllability","volume":"2018","author":"Zeng,","year":"2018","journal-title":"Discrete Dyn. Nat. Soc."},{"key":"2022072209181700700_B86","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1002\/widm.1133","article-title":"Symbolic data analysis: another look at the interaction of data mining and statistics","volume":"4","author":"Brito,","year":"2014","journal-title":"Wiley Interdiscip. Rev. Data Mining and Knowl. Discov."},{"key":"2022072209181700700_B87","doi-asserted-by":"crossref","first-page":"2051","DOI":"10.1016\/j.physa.2011.02.004","article-title":"Identifying the community structure of the international-trade multi-network","volume":"390","author":"Barigozzi,","year":"2011","journal-title":"Physica A"},{"key":"2022072209181700700_B88","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-06391-1","volume-title":"Algorithms and Dynamical Models for Communities and Reputation in Social Networks","author":"Traag,","year":"2014"},{"key":"2022072209181700700_B89","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1109\/SASO.2015.15","article-title":"Distributed current flow betweenness centrality","author":"Lulli,","year":"2015","journal-title":"2015 IEEE 9th International Conference on Self-Adaptive and Self-Organizing Systems"},{"key":"2022072209181700700_B90","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1068\/b38141","article-title":"Understanding urban traffic-flow characteristics: a rethinking of betweenness centrality","volume":"40","author":"Gao,","year":"2012","journal-title":"Environ. Plan. B"},{"key":"2022072209181700700_B91","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/978-3-319-19003-7_2","article-title":"Measuring centralities for transportation networks beyond structures","volume-title":"Applications of Social Media and Social Network Analysis","author":"Cheng,","year":"2015"},{"key":"2022072209181700700_B92","doi-asserted-by":"crossref","first-page":"e40575","DOI":"10.1371\/journal.pone.0040575","article-title":"Network centrality of metro systems","volume":"7","author":"Derrible,","year":"2012","journal-title":"PLoS One"},{"key":"2022072209181700700_B93","doi-asserted-by":"crossref","first-page":"e15923","DOI":"10.1371\/journal.pone.0015923","article-title":"Structure of urban movements: polycentric activity and entangled hierarchical flows","volume":"6","author":"Roth,","year":"2011","journal-title":"PLoS One"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/10\/4\/cnac031\/45047219\/cnac031.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/10\/4\/cnac031\/45047219\/cnac031.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T09:19:43Z","timestamp":1658481583000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/doi\/10.1093\/comnet\/cnac031\/6648332"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,29]]},"references-count":93,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,6,29]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnac031","relation":{},"ISSN":["2051-1329"],"issn-type":[{"value":"2051-1329","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2022,8,1]]},"published":{"date-parts":[[2022,6,29]]},"article-number":"cnac031"}}