Degree-Degree Dependencies in Directed Networks with Heavy-Tailed Degrees

DOI10.1080/15427951.2014.927038zbMath1461.68029arXiv1310.6528OpenAlexW2160951742MaRDI QIDQ4985779

Nelly Litvak, Pim Van der Hoorn

Publication date: 26 April 2021

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

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

Mathematics Subject Classification ID

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

Related Items

Assortativity and Bidegree Distributions on Bernoulli Random Graph Superpositions ⋮ Assortativity and bidegree distributions on Bernoulli random graph superpositions ⋮ Generating Maximally Disassortative Graphs with Given Degree Distribution ⋮ Assortativity in generalized preferential attachment models ⋮ Generating directed networks with predetermined assortativity measures ⋮ Limit theorems for assortativity and clustering in null models for scale-free networks

Uses Software

• WebGraph

Cites Work

• Unnamed Item
• Unnamed Item
• Convergence of rank based degree-degree correlations in random directed networks
• Convolution tails, product tails and domains of attraction
• Impact of degree mixing pattern on consensus formation in social networks
• On congruity of nodes and assortative information content in complex networks
• Statistical mechanics of complex networks
• The Structure and Function of Complex Networks
• Directed random graphs with given degree distributions
• Heavy-Tail Phenomena
• A NEW MEASURE OF RANK CORRELATION

This page was built for publication: Degree-Degree Dependencies in Directed Networks with Heavy-Tailed Degrees