{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T11:26:17Z","timestamp":1769945177131,"version":"3.49.0"},"reference-count":75,"publisher":"Oxford University Press (OUP)","issue":"7","license":[{"start":{"date-parts":[[2018,4,25]],"date-time":"2018-04-25T00:00:00Z","timestamp":1524614400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/about_us\/legal\/notices"}],"funder":[{"name":"IDOLE"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,7,1]]},"DOI":"10.1093\/comjnl\/bxy040","type":"journal-article","created":{"date-parts":[[2018,4,6]],"date-time":"2018-04-06T11:40:50Z","timestamp":1523014850000},"page":"998-1014","source":"Crossref","is-referenced-by-count":5,"title":["Discriminative Distance-Based Network Indices with Application to Link Prediction"],"prefix":"10.1093","volume":"61","author":[{"given":"Mostafa","family":"Haghir Chehreghani","sequence":"first","affiliation":[{"name":"LTCI, T\u00e9l\u00e9com ParisTech, Universit\u00e9 Paris-Saclay, Paris, France"}]},{"given":"Albert","family":"Bifet","sequence":"additional","affiliation":[{"name":"LTCI, T\u00e9l\u00e9com ParisTech, Universit\u00e9 Paris-Saclay, Paris, France"}]},{"given":"Talel","family":"Abdessalem","sequence":"additional","affiliation":[{"name":"LTCI, T\u00e9l\u00e9com ParisTech, Universit\u00e9 Paris-Saclay, Paris, France"}]}],"member":"286","published-online":{"date-parts":[[2018,4,25]]},"reference":[{"key":"key\n\t\t\t\t20180702082800_bxy040C1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0378-8733(98)00010-0","article-title":"Centrality measures for disease transmission networks","volume":"21","author":"Bell","year":"1999","journal-title":"Soc. Netw."},{"key":"key\n\t\t\t\t20180702082800_bxy040C2","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1145\/505659.505663","article-title":"Analysis of the autonomous system network topology","volume":"31","author":"Magoni","year":"2001","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"key\n\t\t\t\t20180702082800_bxy040C3","doi-asserted-by":"crossref","first-page":"100","DOI":"10.3390\/a6010100","article-title":"Computing the eccentricity distribution of large graphs","volume":"6","author":"Takes","year":"2013","journal-title":"Algorithms"},{"key":"key\n\t\t\t\t20180702082800_bxy040C4","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1186\/1756-0381-4-10","article-title":"Using graph theory to analyze biological networks","volume":"4","author":"Pavlopoulos","year":"2011","journal-title":"BioData Mining"},{"key":"key\n\t\t\t\t20180702082800_bxy040C5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis: Methods and Applications (Structural Analysis in the Social Sciences)","author":"Wasserman","year":"1994"},{"key":"key\n\t\t\t\t20180702082800_bxy040C6","first-page":"70","article-title":"A complement-derived centrality index for disconnected graphs","volume":"26","author":"Cornwell","year":"2005","journal-title":"Connections"},{"key":"key\n\t\t\t\t20180702082800_bxy040C7","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/S0378-4371(00)00311-3","article-title":"Harmony in the small-world","volume":"285","author":"Marchiori","year":"2000","journal-title":"Physics A"},{"key":"key\n\t\t\t\t20180702082800_bxy040C8","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":"key\n\t\t\t\t20180702082800_bxy040C9","author":"Shun","year":"2015"},{"key":"key\n\t\t\t\t20180702082800_bxy040C10","author":"Kosch\u00fctzki","year":"2004"},{"key":"key\n\t\t\t\t20180702082800_bxy040C11","author":"Kang","year":"2011"},{"key":"key\n\t\t\t\t20180702082800_bxy040C12","author":"Bergamini","year":"2016"},{"key":"key\n\t\t\t\t20180702082800_bxy040C13","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","article-title":"The structure and function of complex networks","volume":"45","author":"Newman","year":"2003","journal-title":"SIAM Rev."},{"key":"key\n\t\t\t\t20180702082800_bxy040C14","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/(SICI)1097-0037(199612)28:4<181::AID-NET2>3.0.CO;2-H","article-title":"On eccentric vertices in graphs","volume":"28","author":"Chartrand","year":"1996","journal-title":"Networks"},{"key":"key\n\t\t\t\t20180702082800_bxy040C15","author":"Husfeldt","year":"2017"},{"key":"key\n\t\t\t\t20180702082800_bxy040C16","author":"Williams","year":"2012"},{"key":"key\n\t\t\t\t20180702082800_bxy040C17","doi-asserted-by":"crossref","first-page":"39","DOI":"10.7155\/jgaa.00081","article-title":"Fast approximation of centrality","volume":"8","author":"Eppstein","year":"2004","journal-title":"J. Graph Alg. Appl."},{"key":"key\n\t\t\t\t20180702082800_bxy040C18","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1142\/S0218127407018403","article-title":"Centrality estimation in large networks","volume":"17","author":"Brandes","year":"2007","journal-title":"Intl. J. Bifurcation Chaos"},{"key":"key\n\t\t\t\t20180702082800_bxy040C19","author":"Cohen","year":"2014"},{"key":"key\n\t\t\t\t20180702082800_bxy040C20","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1145\/331605.331610","article-title":"Polylog-time and near-linear work approximation scheme for undirected shortest paths","volume":"47","author":"Cohen","year":"2000","journal-title":"J. ACM"},{"key":"key\n\t\t\t\t20180702082800_bxy040C21","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1137\/0220006","article-title":"High probability parallel transitive-closure algorithms","volume":"20","author":"Ullman","year":"1991","journal-title":"SIAM J. Comput."},{"key":"key\n\t\t\t\t20180702082800_bxy040C22","first-page":"196","author":"Olsen","year":"2014"},{"key":"key\n\t\t\t\t20180702082800_bxy040C23","author":"Okamoto","year":"2008"},{"key":"key\n\t\t\t\t20180702082800_bxy040C24","author":"Tarkowski","year":"2016"},{"key":"key\n\t\t\t\t20180702082800_bxy040C25","first-page":"41","article-title":"The average eccentricity of a graph and its subgraphs","volume":"65","author":"Dankelmann","year":"2004","journal-title":"Utilitas Math."},{"key":"key\n\t\t\t\t20180702082800_bxy040C26","author":"Roditty","year":"2013"},{"key":"key\n\t\t\t\t20180702082800_bxy040C27","first-page":"1041","author":"Chechik","year":"2014"},{"key":"key\n\t\t\t\t20180702082800_bxy040C28","doi-asserted-by":"crossref","first-page":"1371","DOI":"10.1093\/comjnl\/bxu003","article-title":"An efficient algorithm for approximate betweenness centrality computation","volume":"57","author":"Chehreghani","year":"2014","journal-title":"Comput. J."},{"key":"key\n\t\t\t\t20180702082800_bxy040C29","first-page":"12","author":"Chehreghani","year":"2018"},{"key":"key\n\t\t\t\t20180702082800_bxy040C30","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1080\/10556788.2016.1167892","article-title":"Finding groups with maximum betweenness centrality","volume":"32","author":"Veremyev","year":"2017","journal-title":"Optim. Methods Software"},{"key":"key\n\t\t\t\t20180702082800_bxy040C31","author":"Chehreghani","year":"2014"},{"key":"key\n\t\t\t\t20180702082800_bxy040C32","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":"key\n\t\t\t\t20180702082800_bxy040C33","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":"key\n\t\t\t\t20180702082800_bxy040C34","author":"Haveliwala","year":"2002"},{"key":"key\n\t\t\t\t20180702082800_bxy040C35","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1038\/30918","article-title":"Collective dynamics of small-world\u2019networks","volume":"393","author":"Watts","year":"1998","journal-title":"Nature"},{"key":"key\n\t\t\t\t20180702082800_bxy040C36","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00167196","article-title":"A study of travel time and reliability on arterial routes","volume":"8","author":"Polus","year":"1979","journal-title":"Transportation"},{"key":"key\n\t\t\t\t20180702082800_bxy040C37","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0968-090X(98)00003-5","article-title":"Validating the results of a route choice simulator","volume":"5","author":"Bonsall","year":"1997","journal-title":"Transport. Res. C Emerg. Technol."},{"key":"key\n\t\t\t\t20180702082800_bxy040C38","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/MCOM.2017.1600263","article-title":"Vehicular social networks: enabling smart mobility","volume":"55","author":"Ning","year":"2017","journal-title":"IEEE Commun. Mag."},{"key":"key\n\t\t\t\t20180702082800_bxy040C39","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1214\/aoap\/1034625252","article-title":"Epidemics with two levels of mixing","volume":"7","author":"Ball","year":"1997","journal-title":"Ann. Appl. Prob."},{"key":"key\n\t\t\t\t20180702082800_bxy040C40","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1007\/s00285-010-0386-0","article-title":"Epidemic growth rate and household reproduction number in communities of households, schools and workplaces","volume":"63","author":"Pellis","year":"2011","journal-title":"J. Math. Biol."},{"key":"key\n\t\t\t\t20180702082800_bxy040C41","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1209\/epl\/i2004-10550-5","article-title":"Epidemic spreading in community networks","volume":"72","author":"Liu","year":"2005","journal-title":"Europhys. Lett."},{"key":"key\n\t\t\t\t20180702082800_bxy040C42","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"key\n\t\t\t\t20180702082800_bxy040C43","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph Theory","author":"Diestel","year":"2010","edition":"4th ed"},{"key":"key\n\t\t\t\t20180702082800_bxy040C44","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","article-title":"Probability inequalities for sums of bounded random variables","volume":"58","author":"Hoeffding","year":"1963","journal-title":"J. Am. Stat. Assoc."},{"key":"key\n\t\t\t\t20180702082800_bxy040C45","author":"Berlingerio","year":"2009"},{"key":"key\n\t\t\t\t20180702082800_bxy040C46","author":"Gjoka","year":"2010"},{"key":"key\n\t\t\t\t20180702082800_bxy040C47","author":"McAuley","year":"2012"},{"key":"key\n\t\t\t\t20180702082800_bxy040C48","first-page":"361","article-title":"RCV1: a new benchmark collection for text categorization research","volume":"5","author":"Lewis","year":"2004","journal-title":"J. Mach. Learn. Res."},{"key":"key\n\t\t\t\t20180702082800_bxy040C49","author":"Kunegis","year":"2013"},{"key":"key\n\t\t\t\t20180702082800_bxy040C50","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","article-title":"Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters","volume":"6","author":"Leskovec","year":"2009","journal-title":"Internet Math."},{"key":"key\n\t\t\t\t20180702082800_bxy040C51","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1038\/43601","article-title":"The diameter of the world wide web","volume":"401","author":"Albert","year":"1999","journal-title":"Nature"},{"key":"key\n\t\t\t\t20180702082800_bxy040C52","article-title":"Citeulike: a researcher\u2019s social bookmarking service","volume":"51","author":"Emamy","year":"2007","journal-title":"Ariadne"},{"key":"key\n\t\t\t\t20180702082800_bxy040C53","author":"Massa","year":"2005"},{"key":"key\n\t\t\t\t20180702082800_bxy040C54","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7287.001.0001","volume-title":"WordNet: An Electronic Lexical Database","author":"Fellbaum","year":"1998"},{"key":"key\n\t\t\t\t20180702082800_bxy040C55","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1186\/s40537-017-0076-5","article-title":"Identification of top-k nodes in large networks using katz centrality","volume":"4","author":"Zhan","year":"2017","journal-title":"J. Big Data"},{"key":"key\n\t\t\t\t20180702082800_bxy040C56","doi-asserted-by":"crossref","first-page":"69:1","DOI":"10.1145\/3012704","article-title":"A survey of link prediction in complex networks","volume":"49","author":"Mart\u00ednez","year":"2016","journal-title":"ACM Comput. Surv."},{"key":"key\n\t\t\t\t20180702082800_bxy040C57","doi-asserted-by":"crossref","first-page":"025102","DOI":"10.1103\/PhysRevE.64.025102","article-title":"Clustering and preferential attachment in growing networks","volume":"64","author":"Newman","year":"2001","journal-title":"Phys. Rev. E"},{"key":"key\n\t\t\t\t20180702082800_bxy040C58","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1002\/asi.20591","article-title":"The link-prediction problem for social networks","volume":"58","author":"Liben-Nowell","year":"2007","journal-title":"J. Am. Soc. Inf. Sci. Technol."},{"key":"key\n\t\t\t\t20180702082800_bxy040C59","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-60795-5_10","article-title":"Link prediction using top-k shortest distances","author":"Lebedev","year":"2017"},{"key":"key\n\t\t\t\t20180702082800_bxy040C60","volume-title":"Introduction to Modern Information Retrieval","author":"Salton","year":"1986"},{"key":"key\n\t\t\t\t20180702082800_bxy040C61","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1016\/S0378-4371(02)00736-7","article-title":"Evolution of the social network of scientific collaborations","volume":"311","author":"Barabasi","year":"2002","journal-title":"Physics A"},{"key":"key\n\t\t\t\t20180702082800_bxy040C62","author":"Jeh","year":"2002"},{"key":"key\n\t\t\t\t20180702082800_bxy040C63","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","article-title":"Friends and neighbors on the web","volume":"25","author":"Adamic","year":"2001","journal-title":"Soc. Netw."},{"key":"key\n\t\t\t\t20180702082800_bxy040C64","first-page":"4459","article-title":"A link prediction algorithm based on socialized semi-local information","volume":"10","author":"Zhang","year":"2014","journal-title":"J. Comput. Inform. Syst."},{"key":"key\n\t\t\t\t20180702082800_bxy040C65","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","article-title":"Link prediction in complex networks: a survey","volume":"390","author":"Lu","year":"2011","journal-title":"Physics A"},{"key":"key\n\t\t\t\t20180702082800_bxy040C66","author":"Hasan","year":"2006"},{"key":"key\n\t\t\t\t20180702082800_bxy040C67","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1093\/comnet\/cnu034","article-title":"Generating online social networks based on socio-demographic attributes","volume":"2","author":"Pasta","year":"2014","journal-title":"J. Complex Netw."},{"key":"key\n\t\t\t\t20180702082800_bxy040C68","author":"Chehreghani","year":"2016"},{"key":"key\n\t\t\t\t20180702082800_bxy040C69","author":"Paranjape","year":"2017"},{"key":"key\n\t\t\t\t20180702082800_bxy040C70","author":"Leskovec","year":"2010"},{"key":"key\n\t\t\t\t20180702082800_bxy040C71","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1002\/asi.21015","article-title":"Patterns and dynamics of users\u2019 behavior and interaction: network analysis of an online community","volume":"60","author":"Panzarasa","year":"2009","journal-title":"JASIST"},{"key":"key\n\t\t\t\t20180702082800_bxy040C72","first-page":"475","article-title":"Measuring the robustness of link prediction algorithms under noisy environment","volume":"6","author":"Zhang","year":"2016","journal-title":"Sci. Rep."},{"key":"key\n\t\t\t\t20180702082800_bxy040C73","first-page":"1","article-title":"A cooperative quality-aware service access system for social Internet of vehicles","volume":"PP","author":"Ning","year":"2017","journal-title":"IEEE Internet Things J."},{"key":"key\n\t\t\t\t20180702082800_bxy040C74","first-page":"1","article-title":"A social-aware group formation framework for information diffusion in narrowband internet of things","volume":"PP","author":"Ning","year":"2017","journal-title":"IEEE Internet Things J."},{"key":"key\n\t\t\t\t20180702082800_bxy040C75","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ipl.2016.11.002","article-title":"Upper and lower bounds for the q-entropy of network models with application to network model selection","volume":"119","author":"Chehreghani","year":"2017","journal-title":"Inform. Process. Lett."}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/61\/7\/998\/25113860\/bxy040.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,14]],"date-time":"2019-10-14T07:04:52Z","timestamp":1571036692000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/61\/7\/998\/4985553"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,25]]},"references-count":75,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2018,4,25]]},"published-print":{"date-parts":[[2018,7,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxy040","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2018,7]]},"published":{"date-parts":[[2018,4,25]]}}}