Theoretical Analysis of DomiRank Centrality: Automorphism, Entropy, and Graph Transformations
DomiRank is a node-importance algorithm for unweighted networks, defined by a dynamical-system model whose steady state is governed by a competition-strength parameter, a dominance threshold, and a natural decay rate. We study its intrinsic relations with graph automorphism: vertices mapped to each other by an automorp...