Search Results for:

A measure of connectivity that considers the relationship between the number of observed links and the number of possible links. The value of gamma is between 0 and 1, where a value of 1 indicates a completely connected network and would be extremely unlikely in reality. Gamma is an efficient

A measure of connectivity that evaluates the number of cycles in a graph compared to the maximum number of cycles. The higher the alpha index, the more a network is connected. Trees and simple networks will have a value of 0. A value of 1 indicates a completely connected network.

The Beta Index measures the level of connectivity in a graph and is expressed by the relationship between the number of links (e) over the number of nodes (v). Trees and simple networks have a Beta value of less than one. A connected network with one cycle has a value

The Theta index measures the function of a node, that is, the average amount of traffic per intersection. The higher the index is, the greater the load of the network. The measure can also be applied to the number of links (edges).

Eta is the average length per link. Adding new nodes will cause a decrease in Eta as the average length per link declines.

Source: Adapted from Kansky (1963), p. 23. The Pi index is the ratio between the diameter (d; vertical axis) and length of the network (horizontal axis). A low Pi index is linked with a low level of network development (such as simple corridors), and a high value of Pi is

The physical attributes of space, such as the topography, influence the route selection process since they impose a variable friction on movements. Consequently, a route between two locations (1 and 3, but also using intermediate location 2) may use a path that is not necessarily the most direct, but less

The cost in a graph represents the total length of the network measured in real transport distances where aij is the presence (1) or absence (0) of a link between i and j and lij is the length of the link. This measure can also be calculated based on two other

The maximum number of independent cycles in a graph (u) is estimated through the number of nodes (v), links (e) and of sub-graphs (p). Trees and simple networks have a value of 0 since they have no cycles. The more complex a network is, the higher the value of u,