Advertisement

An Entropic Edge Assortativity Measure

  • Cheng YeEmail author
  • Richard C. Wilson
  • Edwin R. Hancock
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9069)

Abstract

Assortativity or assortative mixing is the tendency of a network’s vertices to connect to others with similar characteristics, and has been shown to play a vital role in the structural properties of complex networks. Most of the existing assortativity measures have been developed on the basis of vertex degree information. However, there is a significant amount of additional information residing in the edges in a network, such as the edge directionality and weights. Moreover, the von Neumann entropy has proved to be an efficient entropic complexity level characterization of the structural and functional properties of both undirected and directed networks. Hence, in this paper we aim to combine these two methods and propose a novel edge assortativity measure which quantifies the entropic preference of edges to form connections between similar vertices in undirected and directed graphs. We apply our novel assortativity characterization to both artificial random graphs and real-world networks. The experimental results demonstrate that our measure is effective in characterizing the structural complexity of networks and classifying networks that belong to different complexity classes.

Keywords

Assortative mixing Von Neumann entropy Entropic edge assortativity 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chung, F.: Laplacians and the cheeger inequailty for directed graphs. Annals of Combinatorics 9, 1–19 (2005)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Cuzzocrea, A., Papadimitriou, A., Katsaros, D., Manolopoulos, Y.: Edge betweenness centrality: A novel algorithm for qos-based topology control over wireless sensor networks. Journal of Network and Computer Applications 35(4), 1210–1217 (2012)CrossRefGoogle Scholar
  3. 3.
    Foster, J.G., Foster, D.V., Grassberger, P., Paczuski, M.: Edge direction and the structure of networks. Proceedings of the National Academy of Sciences of the United States of America 107(24), 10815–10820 (2010)CrossRefGoogle Scholar
  4. 4.
    Han, L., Escolano, F., Hancock, E.R., Wilson, R.C.: Graph characterizations from von neumann entropy. Pattern Recognition Letters 33, 1958–1967 (2012)CrossRefGoogle Scholar
  5. 5.
    Leskovec, J., Huttenlocher, D., Kleinberg, J.: Signed networks in social media. In: CHI (2010)Google Scholar
  6. 6.
    Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: Densification laws, shrinking diameters and possible explanations. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2005)Google Scholar
  7. 7.
    Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: Densification and shrinking diameters. ACM Transactions on Knowledge Discovery from Data (ACM TKDD) 1 (2007)Google Scholar
  8. 8.
    Newman, M.: Assortative mixing in networks. Phys. Rev. Lett. 89(208701) (2002)Google Scholar
  9. 9.
    Passerini, F., Severini, S.: The von neumann entropy of networks. International Journal of Agent Technologies and Systems, 58–67 (2008)Google Scholar
  10. 10.
    Ripeanu, M., Foster, I., Iamnitchi, A.: Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design. IEEE Internet Computing Journal (2002)Google Scholar
  11. 11.
    Ye, C., Wilson, R.C., Comin, C.H., da F. Costa, L., Hancock, E.R.: Entropy and heterogeneity measures for directed graphs. In: Hancock, E., Pelillo, M. (eds.) SIMBAD 2013. LNCS, vol. 7953, pp. 219–234. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  12. 12.
    Ye, C., Wilson, R.C., Hancock, E.R.: Entropic graph embedding via multivariate degree distributions. In: Fränti, P., Brown, G., Loog, M., Escolano, F., Pelillo, M. (eds.) S+SSPR 2014. LNCS, vol. 8621, pp. 163–172. Springer, Heidelberg (2014)CrossRefGoogle Scholar
  13. 13.
    Ye, C., Wilson, R.C., Hancock, E.R.: Graph characterization from entropy component analysis. In: 22nd International Conference on Pattern Recognition, ICPR 2014, Stockholm, Sweden, August 24-28, pp. 3845–3850 (2014)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Cheng Ye
    • 1
    Email author
  • Richard C. Wilson
    • 1
  • Edwin R. Hancock
    • 1
  1. 1.Department of Computer ScienceUniversity of YorkYorkUK

Personalised recommendations