Centrality is most commonly thought of as a measure in which we assign a ranking of the vertices from most important to least important. The importance of a vertex is relative to the underlying process being carried out on the network. This is why there is a diverse amount of centrality measures addressing many such processes. We propose a measure that assigns a ranking in which interference is a property of the underlying process being carried out on the network.
Benowitz, Jarod P. and Peak, David, "Centrality Measures of Graphs utilizing Continuous Walks in Hilbert Space" (2015). Physics Capstone Project. Paper 18.