Generating directed networks with predetermined assortativity measures

DOI10.1007/S11222-022-10161-8zbMATH Open1497.62018arXiv2201.03451OpenAlexW4303986194MaRDI QIDQ80586FDOQ80586

Panpan Zhang, Yelie Yuan, Panpan Zhang, Tiandong Wang, Tiandong Wang, Yelie Yuan, Jun Yan

Publication date: October 2022

Published in: Statistics and Computing (Search for Journal in Brave)

Abstract: Assortativity coefficients are important metrics to analyze both directed and undirected networks. In general, it is not guaranteed that the fitted model will always agree with the assortativity coefficients in the given network, and the structure of directed networks is more complicated than the undirected ones. Therefore, we provide a remedy by proposing a degree-preserving rewiring algorithm, called DiDPR, for generating directed networks with given directed assortativity coefficients. We construct the joint edge distribution of the target network by accounting for the four directed assortativity coefficients simultaneously, provided that they are attainable, and obtain the desired network by solving a convex optimization problem.Our algorithm also helps check the attainability of the given assortativity coefficients. We assess the performance of the proposed algorithm by simulation studies with focus on two different network models, namely Erd"os--R'enyi and preferential attachment random networks. We then apply the algorithm to a Facebook wall post network as a real data example. The codes for implementing our algorithm are publicly available in R package wdnet.

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

zbMATH Keywords

convex optimizationdegree-preserving rewiringdirected assortativitydirected network generation

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Convex programming (90C25) Random graphs (graph-theoretic aspects) (05C80)

Cites Work

• Power-Law Distributions in Empirical Data
• Directed scale-free graphs
• Title not available (Why is that?)
• Assortativity measures for weighted and directed networks
• On congruity of nodes and assortative information content in complex networks
• Are extreme value estimation methods useful for network data?
• The Bass diffusion model on finite Barabasi-Albert networks
• Fitting the linear preferential attachment model
• Random graphs and complex networks. Volume 1
• Emergence of Scaling in Random Networks
• Title not available (Why is that?)
• Community Detection and Stochastic Block Models
• Assortativity in complex networks
• Degree-Degree Dependencies in Directed Networks with Heavy-Tailed Degrees
• Measuring reciprocity in a directed preferential attachment network
• Random Graphs

Cited In (3)

• wdnet
• wdnet
• A strength and sparsity preserving algorithm for generating weighted, directed networks with predetermined assortativity

Uses Software

• R
• ECOS
• KONECT
• poweRlaw
• CVXR
• plfit

This page was built for publication: Generating directed networks with predetermined assortativity measures

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