Statistics
| Branch: | Revision:

root / latex / note_w01.tex @ d1ed66aa

History | View | Annotate | Download (920 Bytes)

1 d1ed66aa Quynh PX Nguyen
%!TEX root = note.tex
2
3
%%%%%%%%%%%%%%%%%%
4
% WEEK 1
5
%%%%%%%%%%%%%%%%%%
6
\section{Week 1}
7
    \subsection{Brandes 2001}
8
        \subsubsection{Counting the number of shortest paths}
9
            Explanation on k-th power of the adjacency matrix equals the number of paths from vertex \texttt{u} to vertex \texttt{v} \footnote{https://www.quora.com/What-is-an-intuitive-explanation-for-why-raising-an-adjacency-matrix-to-the-power-of-n-gives-a-new-matrix-with-the-number-of-n-paths}
10
11
            \textbf{Floyd/Warshall algorithm}
12
13
        \subsubsection{Code for shortest-path betweenness centrality}
14
            https://github.com/networkx/networkx/blob/master/networkx/algorithms/centrality/betweenness.py
15
16
            Line 116
17
            \begin{itemize}
18
            \item S
19
            \item P
20
            \item sigma
21
            \end{itemize}
22
23
            $c_B(v) =\sum_{s,t \in V} \frac{\sigma(s, t|v)}{\sigma(s, t)}$