2 citations · 3 across the 3 of their papers we have counts for
3 papers
math.NA2026
Convergence and acceleration of a nonlinear fixed-point iteration for computing the Fitness Centrality of general graphs
Nikita Deniskin, Michele Benzi
We establish the global convergence of the (non-homogeneous) Fitness Centrality algorithm for general graphs, deriving an explicit convergence bound for the corresponding fixed-poi…
math.CO2021★ 1 cited
New results and open problems on subgraph centrality
Nikita Deniskin, Michele Benzi
Subgraph centrality, introduced by Estrada and Rodríguez-Velázquez in [12], has become a widely used centrality measure in the analysis of networks, with applications in biology, n…
math.CO2020★ 2 cited
Vertex distinction with subgraph centrality: a proof of Estrada's conjecture and some generalizations
Francesco Ballini, Nikita Deniskin
Centrality measures are used in network science to identify the most important vertices for transmission of information and dynamics on a graph. One of these measures, introduced b…