Degree-degree dependencies in directed networks with heavy-tailed degrees
From MaRDI portal
Publication:4985779
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.
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
Cites work
- scientific article; zbMATH DE number 5070369 (Why is no real title available?)
- A NEW MEASURE OF RANK CORRELATION
- Convergence of rank based degree-degree correlations in random directed networks
- Convolution tails, product tails and domains of attraction
- Directed random graphs with given degree distributions
- Heavy-Tail Phenomena
- Impact of degree mixing pattern on consensus formation in social networks
- Mixing patterns and community structure in networks
- On congruity of nodes and assortative information content in complex networks
- Statistical mechanics of complex networks
- The Structure and Function of Complex Networks
Cited in
(9)- Assortativity measures for weighted and directed networks
- Generating directed networks with predetermined assortativity measures
- Mixed degree-degree correlations in directed social networks
- Assortativity and bidegree distributions on Bernoulli random graph superpositions
- Limit theorems for assortativity and clustering in null models for scale-free networks
- Assortativity and Bidegree Distributions on Bernoulli Random Graph Superpositions
- Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees
- Generating maximally disassortative graphs with given degree distribution
- Convergence of rank based degree-degree correlations in random directed networks
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)
