Degree-degree correlations in directed networks with heavy-tailed degrees

W.L.F. van der Hoorn, Nelli Litvak

Research output: Book/ReportReportProfessional

332 Downloads (Pure)

Abstract

In network theory, Pearson's correlation coefficients are most commonly used to measure the degree assortativity of a network. We investigate the behavior of these coefficients in the setting of directed networks with heavy-tailed degree sequences. We prove that for graphs where the in- and out-degree sequences satisfy a power law, Pearson's correlation coefficients converge to a non-negative number in the infinite network size limit. We propose alternative measures for degree-degree correlations in directed networks based on Spearman's rho and Kendall's tau. Using examples and calculations on the Wikipedia graphs for nine dfferent languages, we show why these rank correlation measures are more suited for measuring degree assortativity in directed graphs with heavy-tailed degrees.
Original languageUndefined
Place of PublicationEnschede
PublisherUniversity of Twente, Department of Applied Mathematics
Number of pages25
Publication statusPublished - Nov 2013

Publication series

NameMemorandum
PublisherUniversity of Twente, Department of Applied Mathematics
No.2018
ISSN (Print)1874-4850
ISSN (Electronic)1874-4850

Keywords

  • Degree-degree correlations
  • Degree assortativity
  • Rank correlations
  • Scale free directed networks
  • Power laws
  • EWI-23905
  • METIS-302554
  • IR-87650

Cite this