Spanning Edge Betweenness in Practice
In this paper we present a study about spanning edge betweenness, an edge-based metric for complex network analysis that is defined as the probability of an edge being part of a minimum spanning tree. This probability reflects how redundant an edge is in what concerns the connectivity of a given network and, hence, its value gives information about the network topology. We apply this metric to distinct empirical networks and random graph models, showing that spanning edge betweenness allows us to identify those edges that are more relevant for connectivity and how removing them leads to disruption in network structure.
KeywordsSpanning edge betweenness Network analysis Edge centrality measures
This work was partly supported by national funds through FCT—Fundação para a Ciência e Tecnologia, under projects Incentivo/EEI/LA0021/2014, EXCL/EEI-ESS/0257/2012, UID/CEC/50021/2013, PTDC/EEI-SII/5081/2014, and PTDC/MA T/STA/3358/2014.
- 5.Teixeira, A.S., Monteiro, P.T., Carriço, J.A., Ramirez, M., Francisco, A.P.: Spanning edge betweenness. In: Eleventh Workshop on Mining and Learning with Graphs (2013)Google Scholar
- 7.Mavroforakis, C., Garcia-Lebron, R., Koutis, I., Terzi, E.: Spanning edge centrality: large-scale computation and applications. In: Proceedings of the 24th International Conference on World Wide Web (WWW ’15), PP. 732–742 (2015)Google Scholar
- 12.Barabási, A., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)Google Scholar