LaTeX
\begin{equation}
C_{B}(v)=\sum_{s\neq v\neq t\in V}\frac{\sigma_{st}(v)}{\sigma_{st}}\nonumber \\
\end{equation}
Where \(\sigma_{st}\) is the total number of geodesic paths from \(s\) to \(t\) and \(\sigma_{st}(v)\) is the number of geodesic paths from \(s\) to \(t\) which pass through \(v\) \citep{freeman1977set}\cite{anthonisse1971rush}
Pagerank centrality measures the probability of arriving at specific node by traversing edges. Thus the higher the value of a node, the more "important" it is. Essentially this becomes a measure of centrality derived from a nodes neighbors, proportional to their out-degree.