5 citations · 10 across the 4 of their papers we have counts for
4 papers
Eigenvector Centrality and Uniform Dominant Eigenvalue of Graph Components
Collins Anguzu, Christopher Engström, John Magero Mango +3
Eigenvector centrality is one of the outstanding measures of central tendency in graph theory. In this paper we consider the problem of calculating eigenvector centrality of graph…
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…
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…
PageRank for evolving link structures
Christopher Engström, Sergei Silvestrov
In this article we will look at the PageRank algorithm used as part of the ranking process of different Internet pages in search engines by for example Google. This article has its…