Potential Accessibility
By considering the same valued graph matrix (L) than the previous example and the population matrix P, the potential accessibility matrix, P(G), can be calculated:
  • The value of all corresponding cells (A-A, B-B, etc.) equals the value of their respective attributes (P).
  • The value of all non-corresponding cells equals their attribute divided by the corresponding cell in the L-matrix.
The higher the value, the more a location is accessible, node C being the most accessible. The matrix being non-transposable, the summation of rows is different from the summation of columns, bringing forward the issue of attractiveness and emissiveness. Node C has more emissiveness than attractiveness (2525.7 versus 2121.3), while Node B has more attractiveness than emissiveness (1358.7 versus 1266.1).