3 citations · 4 across the 2 of their papers we have counts for
2 papers
math.PR2019★ 1 cited
Perturbed Markov Chains and Information Networks
Benard Abola, Pitos Seleka Biganda, Sergei Silvestrov +4
The paper is devoted to studies of perturbed Markov chains commonly used for description of information networks. In such models, the matrix of transition probabilities for the cor…
cs.DS2016★ 3 cited
Graph partitioning and a componentwise PageRank algorithm
Christopher Engström, Sergei Silvestrov
In this article we will present a graph partitioning algorithm which partitions a graph into two different types of components: the well-known `strongly connected components' as we…