Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Borgatti, S.P., Everet, M.G.: A Graph-theoretic perspective on centrality. Soc. Netw. 28(4), 466–484 (2006)
Costa, L.A., Rodrigues, F.A., Travieso, G., Villas, P.R.: Boas, characterization of complex networks: a survey of measurements. Adv. Phys. 56, 167–242 (2007)
Albert, R., Barabási, A.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47 (2002)
Morone, F., Makse, H.A.: Influence maximization in complex networks through optimal percolation. Nature 524, 65–68 (2015)
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)
Teixeira, A.S., Monteiro, P.T., Carriço, J.A., Ramirez, M., Francisco, A.P.: not seeing the forest for the trees: size of the minimum spanning trees (msts) forest and branch significance in mst-based phylogenetic analysis. PLOS one 10(3), e0119315 (2015)
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)
Qi, X., Fuller, E., Luo, R., Zhang, C.: A novel centrality method for weighted networks based on the Kirchhoff polynomial. Pattern Recogn. Lett. 58, 51–60 (2015)
Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40, 35–41 (1977)
Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99, 7821–7826 (2002)
De Meo, P., Ferrara, E., Fiumara, G., Ricciardello, A.: A novel measure of edge centrality in social networks. Know. -Based Syst. 30, 136–150 (2012)
Barabási, A., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)
Grady, D., Thiemann, C., Brockmann, D.: Robust classification of salient links in complex networks. Nat. Commun. 3, 864 (2012)
Acknowledgments
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.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Teixeira, A.S., Santos, F.C., Francisco, A.P. (2016). Spanning Edge Betweenness in Practice. In: Cherifi, H., Gonçalves, B., Menezes, R., Sinatra, R. (eds) Complex Networks VII. Studies in Computational Intelligence, vol 644. Springer, Cham. https://doi.org/10.1007/978-3-319-30569-1_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-30569-1_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-30568-4
Online ISBN: 978-3-319-30569-1
eBook Packages: EngineeringEngineering (R0)