{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T14:20:47Z","timestamp":1761920447724,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,3,29]],"date-time":"2018-03-29T00:00:00Z","timestamp":1522281600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,3,29]],"date-time":"2018-03-29T00:00:00Z","timestamp":1522281600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1339745","1535058"],"award-info":[{"award-number":["1339745","1535058"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s13278-018-0504-3","type":"journal-article","created":{"date-parts":[[2018,4,4]],"date-time":"2018-04-04T03:15:09Z","timestamp":1522811709000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Incrementally updating Katz centrality in dynamic graphs"],"prefix":"10.1007","volume":"8","author":[{"given":"Eisha","family":"Nathan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David A.","family":"Bader","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,29]]},"reference":[{"issue":"6749","key":"504_CR1","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 AL (1999) Internet: diameter of the world-wide web. Nature 401(6749):130\u2013131","journal-title":"Nature"},{"issue":"3","key":"504_CR2","doi-asserted-by":"publisher","first-page":"173","DOI":"10.14778\/1929861.1929864","volume":"4","author":"B Bahmani","year":"2010","unstructured":"Bahmani B, Chowdhury A, Goel A (2010) Fast incremental and personalized pagerank. Proc VLDB Endow 4(3):173\u2013184","journal-title":"Proc VLDB Endow"},{"key":"504_CR3","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1121\/1.1906679","volume":"22","author":"A Bavelas","year":"1950","unstructured":"Bavelas A (1950) Communication patterns in task-oriented groups. J Acoust Soc Am 22:723\u2013730","journal-title":"J Acoust Soc Am"},{"issue":"5","key":"504_CR4","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 (2013) Ranking hubs and authorities using matrix functions. Linear Algebra Appl 438(5):2447\u20132474","journal-title":"Linear Algebra Appl"},{"key":"504_CR5","unstructured":"Benzi, M, Klymko C (2014) A matrix analysis of different centrality measures. arXiv preprint arXiv:1312.6722"},{"key":"504_CR6","doi-asserted-by":"crossref","unstructured":"Chakrabarti D, Zhan Y, Faloutsos C (2004) R-mat: a recursive model for graph mining. In: SDM, vol\u00a04. SIAM, pp 442\u2013446","DOI":"10.1137\/1.9781611972740.43"},{"key":"504_CR7","doi-asserted-by":"crossref","unstructured":"Chen YY, Gan Q, Suel T (2004) Local methods for estimating PageRank values. In: Proceedings of the thirteenth ACM international conference on Information and knowledge management. ACM, pp 381\u2013389","DOI":"10.1145\/1031171.1031248"},{"key":"504_CR8","unstructured":"Chien S, Dwork C, Kumar R, Sivakumar D (2001) Towards exploiting link evolution"},{"key":"504_CR9","doi-asserted-by":"crossref","unstructured":"Erd\u00f6s P, R\u00e9nyi A (1959) On random graphs, I. Publicationes Mathematicae (Debrecen) 6:290\u2013297","DOI":"10.5486\/PMD.1959.6.3-4.12"},{"issue":"1","key":"504_CR10","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40(1):35\u201341","journal-title":"Sociometry"},{"issue":"3","key":"504_CR11","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1137\/140976649","volume":"57","author":"DF Gleich","year":"2015","unstructured":"Gleich DF (2015) Pagerank beyond the web. SIAM Rev 57(3):321\u2013363","journal-title":"SIAM Rev"},{"key":"504_CR12","unstructured":"Green O, McColl R, Bader DA (2012) A fast algorithm for streaming between ness centrality. In: Privacy, security, risk and trust (PASSAT), 2012 international conference on and 2012 international conference on social computing (SocialCom). IEEE, pp 11\u201320"},{"key":"504_CR13","unstructured":"Gy\u00f6ngyi Z, Garcia-Molina H, Pedersen J (2004) Combating web spam with trust rank. In: Proceedings of the thirtieth international conference on very large data bases, vol\u00a030. VLDB Endowment, pp 576\u2013587"},{"key":"504_CR14","doi-asserted-by":"crossref","unstructured":"Higham NJ (2002) Accuracy and stability of numerical algorithms. SIAM","DOI":"10.1137\/1.9780898718027"},{"key":"504_CR15","doi-asserted-by":"crossref","unstructured":"Higham NJ (2008) Functions of matrices: theory and computation. SIAM","DOI":"10.1137\/1.9780898717778"},{"issue":"1","key":"504_CR16","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz L (1953) A new status index derived from sociometric analysis. Psychometrika 18(1):39\u201343","journal-title":"Psychometrika"},{"key":"504_CR17","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"issue":"3","key":"504_CR18","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1002\/nla.743","volume":"18","author":"E Kokiopoulou","year":"2011","unstructured":"Kokiopoulou E, Chen J, Saad Y (2011) Trace optimization and eigenproblems in dimension reduction methods. Numer Linear Algebra Appl 18(3):565\u2013602","journal-title":"Numer Linear Algebra Appl"},{"key":"504_CR19","doi-asserted-by":"crossref","unstructured":"Kunegis J (2013) Konect: the koblenz network collection. In: Proceedings of the 22nd international conference on World Wide Web. ACM, pp 1343\u20131350","DOI":"10.1145\/2487788.2488173"},{"key":"504_CR20","unstructured":"Langville AN, Meyer CD (2002) Updating PageRank using the group inverse and stochastic complementation. Informe t\u00e9cnico crsc02-tr32"},{"key":"504_CR21","unstructured":"Langville AN, Meyer CD (2004) Updating the stationary vector of an irreducible Markov chain with an eye on Googles PageRank. SIMAX, Citeseer"},{"key":"504_CR22","doi-asserted-by":"crossref","unstructured":"Nathan E, Bader DA (2017) A dynamic algorithm for updating katz centrality in graphs. In: Proceedings of the 2017 IEEE\/ACM international conference on advances in social networks analysis and mining, Sydney, Australia, vol\u00a031","DOI":"10.1145\/3110025.3110034"},{"key":"504_CR23","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) The PageRank citation ranking: bringing order to the web. Technical Report, Stanford InfoLab"},{"key":"504_CR24","doi-asserted-by":"crossref","unstructured":"Riedy J (2016) Updating pagerank for streaming graphs. In: IEEE international parallel and distributed processing symposium workshops, 2016, pp 877\u2013884","DOI":"10.1109\/IPDPSW.2016.22"},{"key":"504_CR25","doi-asserted-by":"crossref","unstructured":"Saad Y (2003) Iterative methods for sparse linear systems. SIAM","DOI":"10.1137\/1.9780898718003"},{"key":"504_CR26","doi-asserted-by":"crossref","unstructured":"Sariyuce AE, Kaya K, Saule E, Catalyurek UV (2013) Incremental algorithms for closeness centrality. In: IEEE international conference on big data, 2013, pp 487\u2013492","DOI":"10.1109\/BigData.2013.6691611"},{"issue":"3","key":"504_CR27","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/1970392.1970397","volume":"58","author":"AD Sarma","year":"2011","unstructured":"Sarma AD, Gollapudi S, Panigrahy R (2011) Estimating PageRank on graph streams. JACM 58(3):13","journal-title":"JACM"},{"key":"504_CR28","volume-title":"Real time closeness and betweenness centrality calculations on streaming network data","author":"W Wei","year":"2014","unstructured":"Wei W, Carley K (2014) Real time closeness and betweenness centrality calculations on streaming network data. Academy of Science and Engineering, Los Angeles, USA"},{"key":"504_CR29","unstructured":"Wilkinson JH (1994) Rounding errors in algebraic processes. Courier Corporation"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-018-0504-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-018-0504-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-018-0504-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T22:34:53Z","timestamp":1693607693000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-018-0504-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,29]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["504"],"URL":"https:\/\/doi.org\/10.1007\/s13278-018-0504-3","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"type":"print","value":"1869-5450"},{"type":"electronic","value":"1869-5469"}],"subject":[],"published":{"date-parts":[[2018,3,29]]},"assertion":[{"value":"1 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"26"}}