where n jk [i] is the number of shortest paths between surrounding nodes j and k that pass through i and n jk is the total number of shortest paths between the same nodes j and k.
Specification of Gravity Accessibility with an Exponential Distance DecayFunction, Following Handy and Niemeier (1997) ,!]