The analysis of real-life networks, such as the internet, biometrical networks, and social networks, is challenged by the constantly changing structure of these networks. Typically, such networks consist of multiple weakly connected subcomponents and efficiently updating the importance of network nodes, as captured by the ergodic projector of a random walk on these networks, is a challenging task. In this paper, new approximations are introduced that allow to efficiently update the ergodic projector of Markov multi-chains. Properties such as convergence and error bounds for approximations are established. The numerical applicability is illustrated with a real-life social network example.

Additional Metadata
Keywords Ergodic projector, Markov models, Markov multi-chain, Networks, Ranking nodes, Resolvent
Persistent URL
Journal IFAC-PapersOnLine
Berkhout, J, & Heidergott, B.F. (2018). Efficient updating of node importance in dynamic real-life networks. IFAC-PapersOnLine, 51(7), 64–69. doi:10.1016/j.ifacol.2018.06.280