{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T03:58:26Z","timestamp":1768535906496,"version":"3.49.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030227401","type":"print"},{"value":"9783030227418","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-22741-8_20","type":"book-chapter","created":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T15:02:45Z","timestamp":1559919765000},"page":"276-289","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Personalized Ranking in Dynamic Graphs Using Nonbacktracking Walks"],"prefix":"10.1007","author":[{"given":"Eisha","family":"Nathan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Geoffrey","family":"Sanders","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Van Emden","family":"Henson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,8]]},"reference":[{"issue":"1","key":"20_CR1","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1137\/17M1112297","volume":"39","author":"P Grindrod","year":"2018","unstructured":"Grindrod, P., Higha, D.J., Noferini, V.: The deformed graph laplacian and its applications to network centrality analysis. SIAM J. Matrix Anal. Appl. 39(1), 310\u2013341 (2018)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"5","key":"20_CR2","doi-asserted-by":"publisher","first-page":"052808","DOI":"10.1103\/PhysRevE.90.052808","volume":"90","author":"T Martin","year":"2014","unstructured":"Martin, T., Zhang, X., Newman, M.E.J.: Localization and centrality in networks. Phys. Rev. E 90(5), 052808 (2014)","journal-title":"Phys. Rev. E"},{"issue":"2","key":"20_CR3","doi-asserted-by":"publisher","first-page":"023404","DOI":"10.1088\/1742-5468\/2016\/02\/023404","volume":"2016","author":"T Kawamoto","year":"2016","unstructured":"Kawamoto, T.: Localized eigenvectors of the non-backtracking matrix. J. Stat. Mech.: Theory Exp. 2016(2), 023404 (2016)","journal-title":"J. Stat. Mech.: Theory Exp."},{"key":"20_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139086547","volume-title":"Eigenspaces of Graphs","author":"D Cvetkovic","year":"1997","unstructured":"Cvetkovic, D., Cvetkovi\u0107, D.M., Rowlinson, P., Simic, S.: Eigenspaces of Graphs, vol. 66. Cambridge University Press, New York (1997)"},{"issue":"5","key":"20_CR5","doi-asserted-by":"publisher","first-page":"2447","DOI":"10.1016\/j.laa.2012.10.022","volume":"438","author":"M Benzi","year":"2013","unstructured":"Benzi, M., Estrada, E., Klymko, C.: Ranking hubs and authorities using matrix functions. Linear Algebra Appl. 438(5), 2447\u20132474 (2013)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"20_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz, L.: A new status index derived from sociometric analysis. Psychometrika 18(1), 39\u201343 (1953)","journal-title":"Psychometrika"},{"issue":"4","key":"20_CR7","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/j.socnet.2007.04.002","volume":"29","author":"P Bonacich","year":"2007","unstructured":"Bonacich, P.: Some unique properties of eigenvector centrality. Soc. Netw. 29(4), 555\u2013564 (2007)","journal-title":"Soc. Netw."},{"issue":"3","key":"20_CR8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1137\/140976649","volume":"57","author":"DF Gleich","year":"2015","unstructured":"Gleich, D.F.: Pagerank beyond the web. SIAM Rev. 57(3), 321\u2013363 (2015)","journal-title":"SIAM Rev."},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1093\/comnet\/cnv016","volume":"4","author":"M Aprahamian","year":"2016","unstructured":"Aprahamian, M., Higham, D.J., Higham, N.J.: Matching exponential-based and resolvent-based centrality measures. J. Complex Netw. 4, 157\u2013176 (2016)","journal-title":"J. Complex Netw."},{"issue":"5","key":"20_CR10","doi-asserted-by":"publisher","first-page":"056103","DOI":"10.1103\/PhysRevE.71.056103","volume":"71","author":"E Estrada","year":"2005","unstructured":"Estrada, E., Rodriguez-Velazquez, J.A.: Subgraph centrality in complex net. Phys. Rev. E 71(5), 056103 (2005)","journal-title":"Phys. Rev. E"},{"issue":"2","key":"20_CR11","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1093\/comnet\/cnt007","volume":"1","author":"M Benzi","year":"2013","unstructured":"Benzi, M., Klymko, C.: Total communicability as a centrality measure. J. Complex Netw. 1(2), 124\u2013149 (2013)","journal-title":"J. Complex Netw."},{"issue":"1","key":"20_CR12","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1093\/comnet\/cnx025","volume":"6","author":"F Arrigo","year":"2017","unstructured":"Arrigo, F., Grindrod, P., Higham, D.J., Noferini, V.: Non-backtracking walk centrality for directed networks. J. Complex Netw. 6(1), 54\u201378 (2017)","journal-title":"J. Complex Netw."},{"issue":"07","key":"20_CR13","doi-asserted-by":"publisher","first-page":"2303","DOI":"10.1142\/S0218127407018403","volume":"17","author":"U Brandes","year":"2007","unstructured":"Brandes, U., Pich, C.: Centrality estimation in large networks. Int. J. Bifurcat. Chaos 17(07), 2303\u20132318 (2007)","journal-title":"Int. J. Bifurcat. Chaos"},{"issue":"12","key":"20_CR14","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Nat. Acad. Sci. 99(12), 7821\u20137826 (2002)","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"52","key":"20_CR15","doi-asserted-by":"publisher","first-page":"20935","DOI":"10.1073\/pnas.1312486110","volume":"110","author":"F Krzakala","year":"2013","unstructured":"Krzakala, F.: Spectral redemption in clustering sparse networks. Proc. Nat. Acad. Sci. 110(52), 20935\u201320940 (2013)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"20_CR16","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2009)"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Kunegis, J.: Konect: the Koblenz network collection. In: Proceedings of the 22nd International Conference on World Wide Web, pp. 1343\u20131350. ACM (2013)","DOI":"10.1145\/2487788.2488173"},{"issue":"6749","key":"20_CR18","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1038\/43601","volume":"401","author":"R Albert","year":"1999","unstructured":"Albert, R., Jeong, H., Barab\u00e1si, A.-L.: Internet: diameter of the world-wide web. Nature 401(6749), 130\u2013131 (1999)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-22741-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T03:30:54Z","timestamp":1686108654000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-22741-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030227401","9783030227418"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22741-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"8 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Faro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}