1) Node degree
Node degree is the number of links adjacent to a node. Node degree is a measure of the number of branches in a network. A node with degree 0 is not connected to the network. Terminal nodes have degree 1. A node connected to every node (including itself) has degree equal to the number of nodes in the network. Average node degree is system wide metric used to describe the number of connected links in a network.
2) Betweenness centrality
Betweenness centrality is the fraction of shortest paths that pass through each node. Betweenness coefficient is a value between 0 and 1. Central point dominance is the average difference in betweenness centrality of the most central point (having the maximum betweenness centrality) and all other nodes.
3) Weight
Weight is based on the drainage capacity in terms of flow rate using Manning’s Eq. (Assumptions: concrete, circular, no free surface)
by Yeowon Kim (yeowon.kim@asu.edu)
1) Node degree Node degree is the number of links adjacent to a node. Node degree is a measure of the number of branches in a network. A node with degree 0 is not connected to the network. Terminal nodes have degree 1. A node connected to every node (including itself) has degree equal to the number of nodes in the network. Average node degree is system wide metric used to describe the number of connected links in a network. 2) Betweenness centrality Betweenness centrality is the fraction of shortest paths that pass through each node. Betweenness coefficient is a value between 0 and 1. Central point dominance is the average difference in betweenness centrality of the most central point (having the maximum betweenness centrality) and all other nodes. 3) Weight Weight is based on the drainage capacity in terms of flow rate using Manning’s Eq. (Assumptions: concrete, circular, no free surface)