A two-level gradient-flow algorithm computes the minimal Frobenius-norm perturbation that makes the top m eigenvector-centrality entries coalesce.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Changing the ranking in eigenvector centrality of a weighted graph by small perturbations
A two-level gradient-flow algorithm computes the minimal Frobenius-norm perturbation that makes the top m eigenvector-centrality entries coalesce.