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

DOI10.1080/15427951.2014.927038zbMATH Open1461.68029arXiv1310.6528OpenAlexW2160951742MaRDI QIDQ4985779FDOQ4985779

Authors: Pim Van der Hoorn, Nelly Litvak 

Publication date: 26 April 2021

Published in: Internet Mathematics (Search for Journal in Brave)

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 with realistic parameters, Pearson's correlation coefficients converge to a non-negative number in the infinite network size limit. We propose alternative measures for degree-degree dependencies in directed networks based on Spearman's rho and Kendall's tau. Using examples and calculations on the Wikipedia graphs for nine different languages, we show why these rank correlation measures are more suited for measuring degree assortativity in directed graphs with heavy-tailed degrees.

Full work available at URL: https://arxiv.org/abs/1310.6528

Recommendations

• Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees
• Convergence of rank based degree-degree correlations in random directed networks
• Assortativity measures for weighted and directed networks
• Assortativity in complex networks
• Mixed degree-degree correlations in directed social networks

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex degrees (05C07) Internet topics (68M11)

Cites Work

• Statistical mechanics of complex networks
• A NEW MEASURE OF RANK CORRELATION
• On congruity of nodes and assortative information content in complex networks
• The Structure and Function of Complex Networks
• Heavy-Tail Phenomena
• Convolution tails, product tails and domains of attraction
• Convergence of rank based degree-degree correlations in random directed networks
• Mixing patterns and community structure in networks
• Title not available (Why is that?)
• Directed random graphs with given degree distributions
• Impact of degree mixing pattern on consensus formation in social networks

Cited In (10)

• Convergence of rank based degree-degree correlations in random directed networks
• Mixed degree-degree correlations in directed social networks
• Assortativity in generalized preferential attachment models
• Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees
• Generating maximally disassortative graphs with given degree distribution
• Assortativity measures for weighted and directed networks
• Generating directed networks with predetermined assortativity measures
• Assortativity and Bidegree Distributions on Bernoulli Random Graph Superpositions
• Assortativity and bidegree distributions on Bernoulli random graph superpositions
• Limit theorems for assortativity and clustering in null models for scale-free networks

Uses Software

• WebGraph

This page was built for publication: Degree-degree dependencies in directed networks with heavy-tailed degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4985779)