For each document cluster, LEXRANK builds a graph G = (V, E) with nodes V corresponding to sentences and (undirected) edges E whose weights are computed based on similarity.
matrix E represents edge weights where each element E i,j corresponds to the transition probability from vertex i to vertex j.