Spanning Edge Betweenness in Practice

  • Andreia Sofia TeixeiraEmail author
  • Francisco C. Santos
  • Alexandre P. Francisco
Part of the Studies in Computational Intelligence book series (SCI, volume 644)


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.


Spanning 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.


  1. 1.
    Borgatti, S.P., Everet, M.G.: A Graph-theoretic perspective on centrality. Soc. Netw. 28(4), 466–484 (2006)CrossRefGoogle Scholar
  2. 2.
    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)CrossRefGoogle Scholar
  3. 3.
    Albert, R., Barabási, A.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Morone, F., Makse, H.A.: Influence maximization in complex networks through optimal percolation. Nature 524, 65–68 (2015)CrossRefGoogle Scholar
  5. 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
  6. 6.
    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)CrossRefGoogle Scholar
  7. 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
  8. 8.
    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)CrossRefGoogle Scholar
  9. 9.
    Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40, 35–41 (1977)CrossRefGoogle Scholar
  10. 10.
    Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99, 7821–7826 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    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)CrossRefGoogle Scholar
  12. 12.
    Barabási, A., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)Google Scholar
  13. 13.
    Grady, D., Thiemann, C., Brockmann, D.: Robust classification of salient links in complex networks. Nat. Commun. 3, 864 (2012)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Andreia Sofia Teixeira
    • 1
    Email author
  • Francisco C. Santos
    • 1
  • Alexandre P. Francisco
    • 1
  1. 1.INESC-ID/Instituto Superior TécnicoUniversidade de LisboaLisbonPortugal

Personalised recommendations