{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T06:34:14Z","timestamp":1770273254427,"version":"3.49.0"},"reference-count":30,"publisher":"Oxford University Press (OUP)","issue":"1","funder":[{"DOI":"10.13039\/100000774","name":"Defense Threat Reduction Agency","doi-asserted-by":"publisher","award":["DTRA1-15-1-0049"],"award-info":[{"award-number":["DTRA1-15-1-0049"]}],"id":[{"id":"10.13039\/100000774","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,2,1]]},"DOI":"10.1093\/comnet\/cnx021","type":"journal-article","created":{"date-parts":[[2017,6,13]],"date-time":"2017-06-13T11:09:11Z","timestamp":1497352151000},"page":"79-94","source":"Crossref","is-referenced-by-count":13,"title":["Fast link prediction for large networks using spectral embedding"],"prefix":"10.1093","volume":"6","author":[{"given":"Benjamin","family":"Pachev","sequence":"first","affiliation":[]},{"given":"Benjamin","family":"Webb","sequence":"additional","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2017,7,26]]},"reference":[{"key":"key\n\t\t\t\t20180127052705_B1","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: An Introduction","author":"Newman,","year":"2010"},{"key":"key\n\t\t\t\t20180127052705_B2","volume-title":"Adaptive Networks: Theory, Models and Applications","author":"Gross,","year":"2000"},{"key":"key\n\t\t\t\t20180127052705_B3","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":"2001","journal-title":"J. Amer. Soc. Inf. Sci. Tech."},{"key":"key\n\t\t\t\t20180127052705_B4","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1145\/2380718.2380750","article-title":"TweetLDA: supervised topic classification and link prediction in Twitter.","volume-title":"Proceedings of the 4th Annual ACM Web Science Conference","author":"Quercia,","year":"2012"},{"key":"key\n\t\t\t\t20180127052705_B5","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1038\/nbt.2601","article-title":"Network link prediction by global silencing of indirect correlations.","volume":"31","author":"Barzel,","year":"2013","journal-title":"Nature Biotechnol."},{"key":"key\n\t\t\t\t20180127052705_B6","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1038\/nature06830","article-title":"Hierarchical structure and the prediction of missing links in networks.","volume":"453","author":"Clauset,","year":"2008","journal-title":"Nature"},{"key":"key\n\t\t\t\t20180127052705_B7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-28922-9","volume-title":"Link Prediction in Social Networks-Role of Power Law Distribution","author":"Srinivas,","year":"2016"},{"key":"key\n\t\t\t\t20180127052705_B8","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1109\/TKDE.2007.46","article-title":"Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation.","volume":"19","author":"Fouss,","year":"2007","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"key\n\t\t\t\t20180127052705_B9","article-title":"The k closest pairs problem.","author":"Lenhof,","year":"1992"},{"key":"key\n\t\t\t\t20180127052705_B10","first-page":"1","article-title":"Link prediction in social networks: the state-of-the-art.","volume":"58","author":"Wang,","year":"2015","journal-title":"Sci. China Inf. Sci."},{"key":"key\n\t\t\t\t20180127052705_B11","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1145\/1835804.1835837","article-title":"New perspectives and methods in link prediction.","volume-title":"Proceedings of the 16th ACM SIGKDD International conference on Knowledge Discovery and Data Mining","author":"Lichtenwalter,","year":"2010"},{"key":"key\n\t\t\t\t20180127052705_B12","first-page":"2622","article-title":"Getting lost in space: Large sample analysis of the resistance distance,","volume-title":"Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010","author":"von Luxburg,","year":"2010"},{"key":"key\n\t\t\t\t20180127052705_B13","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1145\/1401890.1401948","article-title":"Microscopic evolution of social networks.","volume-title":"Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.","author":"Leskovec,","year":"2008"},{"key":"key\n\t\t\t\t20180127052705_B14","doi-asserted-by":"crossref","first-page":"1725","DOI":"10.1137\/140996768","article-title":"Predicting triadic closure in networks using communicability distance functions.","volume":"75","author":"Estrada,","year":"2015","journal-title":"SIAM J. Appl. Math."},{"key":"key\n\t\t\t\t20180127052705_B15","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\t20180127052705_B16","doi-asserted-by":"crossref","DOI":"10.5948\/UPO9781614440222","volume-title":"Random Walks in Electircal Networks","author":"Doyle,","year":"1984","edition":"1st edn"},{"key":"key\n\t\t\t\t20180127052705_B17","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1038\/scientificamerican0369-66","article-title":"Brownian motion and potential theory.","volume":"220","author":"Hersh,","year":"1969","journal-title":"Sci. Amer."},{"key":"key\n\t\t\t\t20180127052705_B18","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01164627","article-title":"Resistance distance.","volume":"12","author":"Klein,","year":"1993","journal-title":"J. Math. Chem.,"},{"key":"key\n\t\t\t\t20180127052705_B19","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1137\/050645452","article-title":"Minimizing effective resistance of a graph.","volume":"50","author":"Ghosh,","year":"2008","journal-title":"SIAM Rev.,"},{"key":"key\n\t\t\t\t20180127052705_B20","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1145\/73007.73062","article-title":"The electrical resistance of a graph captures its commute and cover times.","volume-title":"Proceeding STOC\u201989 Proceedings of the twenty-first annual ACM symposium on Theory of computing","author":"Chandra,","year":"1989"},{"key":"key\n\t\t\t\t20180127052705_B21","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/BF01270385","article-title":"The electrical resistance of a graph captures its commute and cover times.","volume":"6","author":"Hersh,","year":"1996","journal-title":"Comput. Complexity,"},{"key":"key\n\t\t\t\t20180127052705_B22","first-page":"449","article-title":"TRACEMIN-Fiedler: a parallel algorithm for computing the Fiedler vector.","volume-title":"International Conference on High Performance Computing for Computational Science \u2013 VECPAR 2010","author":"Manguoglu,","year":"2010"},{"key":"key\n\t\t\t\t20180127052705_B23","volume-title":"HSL MC73: A Fast Multilevel Fiedler and Profile Reduction Code","author":"Hu,","year":"2003"},{"key":"key\n\t\t\t\t20180127052705_B24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1217299.1217301","article-title":"Graph evolution: densification and shrinking diameters.","volume":"1","author":"Leskovec,","year":"2007","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"key\n\t\t\t\t20180127052705_B25","article-title":"arXiv hep-th network dataset\u2014KONECT.","author":"networks collection,","year":"2016"},{"key":"key\n\t\t\t\t20180127052705_B26","article-title":"arXiv hep-ph network dataset\u2014KONECT.","author":"networks collection,","year":"2016"},{"key":"key\n\t\t\t\t20180127052705_B27","article-title":"Facebook friendships network dataset\u2014KONECT.","author":"networks collection,","year":"2016"},{"key":"key\n\t\t\t\t20180127052705_B28","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/1592665.1592675","article-title":"On the evolution of user interaction in Facebook.","volume-title":"Proceedings of the 2nd ACM workshop on Online social networks (WOSN\u201909)","author":"Viswanath,","year":"2009"},{"key":"key\n\t\t\t\t20180127052705_B29","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1073\/pnas.98.2.404","article-title":"The structure of scientific collaboration networks.","volume":"98","author":"Newman,","year":"2001","journal-title":"Proc. Nat. Acad. Sci."},{"key":"key\n\t\t\t\t20180127052705_B30","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781316418321","volume-title":"Algorithms and Models for Network Data and Link Analysis","author":"Fouss,","year":"2016"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/6\/1\/79\/23676995\/cnx021.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,24]],"date-time":"2023-08-24T00:55:01Z","timestamp":1692838501000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/6\/1\/79\/4037122"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,26]]},"references-count":30,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2017,7,26]]},"published-print":{"date-parts":[[2018,2,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnx021","relation":{},"ISSN":["2051-1310","2051-1329"],"issn-type":[{"value":"2051-1310","type":"print"},{"value":"2051-1329","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2018,2]]},"published":{"date-parts":[[2017,7,26]]}}}