(Formal) Proofs of Node Centrality Properties Despite there being relatively frequent discourse regarding the usage and effectiveness of various node centralities when analysing the influential spreaders of a graph, I have thus far struggled to find any formal treatments of such discussions. For example, betweeness centrality is theoretically well-defined and is popular in practice for finding influential spreading members, but is there any proof of its effectiveness in this capacity (e.g. compared to any other centrality)? All the arguments I have witnessed thus far have been largely simulation/virtual-experiment based. My question is: is there anywhere I can more formal treatments of this subject matter?

Whilst I am generally curious to see if possible formal discussions around graph analysis efficacy could exist, I have my suspicions as to why this is not already the case given that formal comparisons of this nature could be infeasible... but perhaps this is not true?

Example papers/articles:
https://www.nature.com/articles/nphys1746.pdf
https://www.nature.com/articles/srep19307.pdf
https://cambridge-intelligence.com/keylines-faqs-social-network-analysis/
There are many papers dealing with the algorithmic aspects of these measures, with formal proofs, complexity analysis, and so on. However, I understand that this is not really what you are looking for.
There are only few formal works on their actual relevance for describing features of interest in practice.
Pagerank is a notable exception, though. Its connections to random walks, Markov chains, and matrices, as well as its wide use and mere features, make it a great metric for formal analysis. I particularly recommend the book Google's PageRank and Beyond: The Science of Search Engine Rankings, by
Amy N. Langville and Carl D. Meyer. It deals with many aspects, putting together practical concerns as well as theoretical analysis.
Node degree distribution is another important exception, although one may consider it too basic to be a valid answer here. Still, there are many formal works showing the importance of high degree nodes in random graphs that model real-world complex networks. See for instance our survey entitled Impact of random failures and attacks on Poisson and power-law random networks.