A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Subgraph centrality and walk-regularity
[article]
2019
arXiv
pre-print
Matrix-based centrality measures have enjoyed significant popularity in network analysis, in no small part due to our ability to rigorously analyze their behavior as parameters vary. Recent work has considered the relationship between subgraph centrality, which is defined using the matrix exponential f(x) = (x), and the walk structure of a network. In a walk-regular graph, the number of closed walks of each length must be the same for all nodes, implying uniform f-subgraph centralities for any
arXiv:1804.05966v3
fatcat:vwbqpvjuozczxaibjlc7v2e77a