{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T19:24:45Z","timestamp":1783625085557,"version":"3.55.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,5,27]],"date-time":"2017-05-27T00:00:00Z","timestamp":1495843200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Event Dyn Syst"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s10626-017-0248-7","type":"journal-article","created":{"date-parts":[[2017,5,27]],"date-time":"2017-05-27T01:45:30Z","timestamp":1495849530000},"page":"3-33","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Ranking nodes in general networks: a Markov multi-chain approach"],"prefix":"10.1007","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5883-9683","authenticated-orcid":false,"given":"Joost","family":"Berkhout","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernd F.","family":"Heidergott","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,5,27]]},"reference":[{"key":"248_CR1","unstructured":"Aldous D, Fill J (2002) Reversible Markov Chains and Random Walks on Graphs. online version available at http:\/\/www.stat.berkeley.edu\/users\/aldous\/RWG\/book.html . Unfinished monograph, recompiled in 2014"},{"issue":"2","key":"248_CR2","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1080\/15326340600649052","volume":"22","author":"K Avrachenkov","year":"2006","unstructured":"Avrachenkov K, Litvak N (2006) The effect of new links on Google Pagerank. Stoch Model 22(2):319\u2013331","journal-title":"Stoch Model"},{"issue":"1-2","key":"248_CR3","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1080\/15427951.2008.10129300","volume":"5","author":"K Avrachenkov","year":"2008","unstructured":"Avrachenkov K, Litvak N, Pham KS (2008) A singular perturbation approach for choosing the PageRank damping factor. Internet Math 5(1-2):47\u201369","journal-title":"Internet Math"},{"issue":"1","key":"248_CR4","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1080\/15427951.2005.10129098","volume":"2","author":"P Berkhin","year":"2005","unstructured":"Berkhin P (2005) A survey on PageRank computing. Internet Math 2 (1):73\u2013120. doi: http:\/\/dx.doi.org\/10.1080\/15427951.2005.10129098","journal-title":"Internet Math"},{"key":"248_CR5","doi-asserted-by":"crossref","unstructured":"Berkhout J (2016) Google\u2019s PageRank algorithm for ranking nodes in general networks. In: Proceedings of the 13th international workshop on discrete event systems (WODES 2016), pp 153\u2013158","DOI":"10.1109\/WODES.2016.7497841"},{"key":"248_CR6","doi-asserted-by":"crossref","unstructured":"Berkhout J, Heidergott BF (2014) A series expansion approach to risk analysis of an inventory system with sourcing. In: Proceedings of the 12th international workshop on discrete event systems (WODES 2014), vol 12, pp 510\u2013515","DOI":"10.3182\/20140514-3-FR-4046.00095"},{"key":"248_CR7","doi-asserted-by":"publisher","first-page":"1818","DOI":"10.1016\/j.procs.2015.05.403","volume":"51","author":"J Berkhout","year":"2015","unstructured":"Berkhout J, Heidergott BF (2015) Efficient algorithm for computing the ergodic projector of Markov multi-chains. Procedia Comput Sci 51:1818\u20131827. doi: 10.1016\/j.procs.2015.05.403 . http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1877050915012119","journal-title":"Procedia Comput Sci"},{"issue":"1","key":"248_CR8","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/1052934.1052938","volume":"5","author":"M Bianchini","year":"2005","unstructured":"Bianchini M, Gori M, Scarselli F (2005) Inside PageRank. ACM Trans Internet Technol 5 (1):92\u2013128. doi: 10.1145\/1052934.1052938 . http:\/\/delivery.acm.org\/10.1145\/1060000\/1052938\/p92-bianchini.pdf?ip=208.165.55.137&id=1052938&acc=ACTIVESERVICE&key=842BC1E250410AEB.FDB887D4E02C11F2.4D4702B0C3E38B35.4D4702B0C3E38B35&CFID=710709363&CFTOKEN=16287877&__acm__=1441563203_9363b1527fecd54000","journal-title":"ACM Trans Internet Technol"},{"key":"248_CR9","doi-asserted-by":"publisher","unstructured":"Boldi P, Santini M, Vigna S (2005) PageRank as a function of the damping factor. In: Proceedings of the 14th international conference on World Wide Web - WWW \u201905 pp 557. doi: 10.1145\/1060745.1060827 . http:\/\/portal.acm.org\/citation.cfm?doid=1060745.1060827","DOI":"10.1145\/1060745.1060827"},{"issue":"4","key":"248_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1629096.1629097","volume":"27","author":"P Boldi","year":"2009","unstructured":"Boldi P, Santini M, Vigna S (2009) PageRank: functional dependencies. ACM Trans Inf Syst 27(4):1\u201323. doi: 10.1145\/1629096.1629097","journal-title":"ACM Trans Inf Syst"},{"issue":"3-4","key":"248_CR11","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1080\/15427951.2013.865686","volume":"10","author":"P Boldi","year":"2014","unstructured":"Boldi P, Vigna S (2014) Axioms for centrality. Internet Math 10(3-4):222\u2013262","journal-title":"Internet Math"},{"issue":"2","key":"248_CR12","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.jda.2009.11.001","volume":"8","author":"M Bressan","year":"2010","unstructured":"Bressan M, Peserico E (2010) Choose the damping, choose the ranking? J Discret Algorithms 8(2):199\u2013213. doi: 10.1016\/j.jda.2009.11.001","journal-title":"J Discret Algorithms"},{"issue":"1-7","key":"248_CR13","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin S, Page L (1998) The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems 30(1-7):107\u2013117. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S016975529800110X","journal-title":"Computer Networks and ISDN Systems"},{"issue":"1","key":"248_CR14","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S1389-1286(00)00083-9","volume":"33","author":"A Broder","year":"2000","unstructured":"Broder A, Kumar R, Maghoul F, Raghavan P, Rajagopalan S, Stata R, Tomkins A, Wiener J (2000) Graph structure in the Web. Comput Netw 33 (1):309\u2013320. doi: 10.1016\/S1389-1286(00)00083-9","journal-title":"Comput Netw"},{"issue":"6","key":"248_CR15","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/1953122.1953146","volume":"54","author":"M Franceschet","year":"2011","unstructured":"Franceschet M (2011) PageRank: standing on the shoulders of giants. Commun ACM 54(6):92\u2013101. http:\/\/dl.acm.org\/citation.cfm?id=1953146","journal-title":"Commun ACM"},{"issue":"5-6","key":"248_CR16","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1002\/asmb.656","volume":"22","author":"HH Fu","year":"2006","unstructured":"Fu HH, Lin DKJ, Tsai HT (2006) Damping factor in Google page ranking. Appl Stoch Model Bus Ind 22(5-6):431\u2013444. doi: 10.1002\/asmb.656","journal-title":"Appl Stoch Model Bus Ind"},{"issue":"3","key":"248_CR17","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. doi: 10.1137\/140976649 . arXiv: 1407.5107","journal-title":"SIAM Rev"},{"issue":"3","key":"248_CR18","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1017\/S0269964807000034","volume":"21","author":"BF Heidergott","year":"2007","unstructured":"Heidergott BF, Hordijk A, van Uitert M (2007) Series expansions for finite-state Markov chains. Probab Eng Informational Sci 21(3):381\u2013400. doi: 10.1017\/S0269964807000034 . http:\/\/dl.acm.org\/citation.cfm?id=1291117.1291120","journal-title":"Probab Eng Informational Sci"},{"key":"248_CR19","doi-asserted-by":"crossref","unstructured":"Kartashov NV (1996) Strong stable markov chains. TBIMC Scientific Publishers, VSP","DOI":"10.1515\/9783110917765"},{"key":"248_CR20","volume-title":"Finite Markov chains: With a New Appendix \u201cGeneralization of a Fundamental Matrix","author":"JG Kemeny","year":"1976","unstructured":"Kemeny JG, Snell JL (1976) Finite Markov chains: With a New Appendix \u201cGeneralization of a Fundamental Matrix. Springer, New York. http:\/\/books.google.nl\/books\/about\/Finite_markov_chains.html?id=WORLAAAAMAAJ&pgis=1"},{"key":"248_CR21","volume-title":"Fiddling with PageRank. CRSC- TR03-34","author":"AN Langville","year":"2003","unstructured":"Langville AN, Meyer CD (2003) Fiddling with PageRank. CRSC- TR03-34. North Carolina State University, Raleigh, NC. http:\/\/www.ncsu.edu\/crsc\/reports\/reports03.html Tech. rep."},{"issue":"3","key":"248_CR22","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1080\/15427951.2004.10129091","volume":"1","author":"AN Langville","year":"2004","unstructured":"Langville AN, Meyer CD (2004) Deeper inside PageRank. Internet Math 1(3):335\u2013380. doi: 10.1080\/15427951.2004.10129091","journal-title":"Internet Math"},{"issue":"1","key":"248_CR23","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/S0036144503424786","volume":"47","author":"AN Langville","year":"2005","unstructured":"Langville AN, Meyer CD (2005) A survey of eigenvector methods for web information retrieval. SIAM Rev 47(1):135\u2013161. doi: 10.1137\/S0036144503424786","journal-title":"SIAM Rev"},{"key":"248_CR24","unstructured":"Langville AN, Meyer CD (2011) Google\u2019s pagerank and beyond: The science of search engine rankings. Princeton University Press"},{"key":"248_CR25","doi-asserted-by":"crossref","unstructured":"Langville AN, Meyer CD (2012) Do the math: why no ranking system is no. 1. Sci Am 307(1)","DOI":"10.1038\/scientificamerican0712-21"},{"key":"248_CR26","unstructured":"Leskovec J, Krevl A (2014). SNAP Datasets: Stanford Large Network Dataset Collection, Webpage: https:\/\/snap.stanford.edu\/data\/wiki-Vote.html"},{"issue":"3","key":"248_CR27","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1137\/1017044","volume":"17","author":"CD Meyer","year":"1975","unstructured":"Meyer CD (1975) The role of the group generalized inverse in the theory of finite Markov chains. SIAM Rev 17(3):443\u2013464. doi: 10.1137\/1017044","journal-title":"SIAM Rev"},{"key":"248_CR28","first-page":"50","volume-title":"Recent Applications of Generalized Inverses, Research Notes in Mathematics, vol 66","author":"CD Meyer","year":"1982","unstructured":"Meyer CD (1982) Analysis of finite Markov chains by group inversion techniques. In: Campbell SL (ed) Recent applications of generalized inverses, research notes in mathematics, vol 66. Pitman, Boston, London, pp 50\u201381"},{"issue":"2","key":"248_CR29","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"RE Tarjan","year":"1972","unstructured":"Tarjan RE (1972) Depth-first search and linear graph algorithms. SIAM J Comput 1(2):146\u2013160","journal-title":"SIAM J Comput"},{"key":"248_CR30","unstructured":"Xia L, Glynn PW (2016) A generalized fundamental matrix for computing fundamental quantities of Markov systems. arXiv: 1604.04343v2 [math.OC]. 1604.04343"}],"container-title":["Discrete Event Dynamic Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10626-017-0248-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-017-0248-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-017-0248-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T01:24:35Z","timestamp":1569374675000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10626-017-0248-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,27]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["248"],"URL":"https:\/\/doi.org\/10.1007\/s10626-017-0248-7","relation":{},"ISSN":["0924-6703","1573-7594"],"issn-type":[{"value":"0924-6703","type":"print"},{"value":"1573-7594","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,27]]}}}