absorbing_centrality.compute_transition_matrix¶

compute_transition_matrix(G)[source]¶

Builds the random transition matrix P. The probability of going from node i to node`j` is equal to:

\[P_{i,j} = \frac{1}{\text{degree}(i)}\]

Parameters:	G (NetworkX graph) –
Returns:	P – The random transition probability matrix.
Return type:	scipy.sparse matrix