<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Raschke M</dc:creator>
  <dc:creator>Schläpfer M</dc:creator>
  <dc:creator>Nibali R</dc:creator>
  <dc:date>2010</dc:date>
  <dc:description xmlns:ns0="xml" ns0:lang="en">The Pearson correlation coefficient is commonly used for quantifying the global level of degree-degree association in complex networks. Here, we use a probabilistic representation of the underlying network structure for assessing the applicability of different association measures to heavy-tailed degree distributions. Theoretical arguments together with our numerical study indicate that Pearson's coefficient often depends on the size of networks with equal association structure, impeding a systematic comparison of real-world networks. In contrast, Kendall-Gibbons' τ{b} is a considerably more robust measure of the degree-degree association.</dc:description>
  <dc:format>application/pdf</dc:format>
  <dc:identifier>https://sonar.ch/global/documents/154740</dc:identifier>
  <dc:language>eng</dc:language>
  <dc:relation>info:eu-repo/semantics/altIdentifier/doi/10.1103/PhysRevE.82.037102</dc:relation>
  <dc:relation>info:eu-repo/semantics/altIdentifier/pmid/21230212</dc:relation>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:source>Physical review. E, Statistical, nonlinear, and soft matter physics. - 2010</dc:source>
  <dc:subject xmlns:ns1="xml" ns1:lang="en">Models, Theoretical</dc:subject>
  <dc:subject xmlns:ns2="xml" ns2:lang="en">Probability</dc:subject>
  <dc:subject xmlns:ns3="xml" ns3:lang="en">Stochastic Processes</dc:subject>
  <dc:title xmlns:ns4="xml" ns4:lang="en">Measuring degree-degree association in networks.</dc:title>
  <dc:type>http://purl.org/coar/resource_type/c_6501</dc:type>
</oai_dc:dc>
