{"title":"Google's PageRank algorithm for ranking nodes in general networks","authors":"J. Berkhout","doi":"10.1109/WODES.2016.7497841","DOIUrl":null,"url":null,"abstract":"This paper extends the random surfer approach of Google's PageRank algorithm to general finite Markov chains that may consist of several ergodic classes and possible transient states. We will introduce the new concept of an extended ergodic projector of a Markov chain and we will show how the extended ergodic projector allows for intuitive better ranking of transient states. Numerical examples are provided to illustrate the effect of this new ranking approach.","PeriodicalId":268613,"journal":{"name":"2016 13th International Workshop on Discrete Event Systems (WODES)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 13th International Workshop on Discrete Event Systems (WODES)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WODES.2016.7497841","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11
Abstract
This paper extends the random surfer approach of Google's PageRank algorithm to general finite Markov chains that may consist of several ergodic classes and possible transient states. We will introduce the new concept of an extended ergodic projector of a Markov chain and we will show how the extended ergodic projector allows for intuitive better ranking of transient states. Numerical examples are provided to illustrate the effect of this new ranking approach.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
