Generating directed networks with predetermined assortativity measures

DOI10.1007/S11222-022-10161-8zbMath1497.62018arXiv2201.03451OpenAlexW4303986194MaRDI QIDQ80586

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

Publication date: October 2022

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

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) Random graphs (graph-theoretic aspects) (05C80) Convex programming (90C25)

Related Items (3)

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

Uses Software

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

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Emergence of Scaling in Random Networks
• Power-Law Distributions in Empirical Data
• Directed scale-free graphs
• Community Detection and Stochastic Block Models
• Assortativity in complex networks
• Assortativity measures for weighted and directed networks
• Degree-Degree Dependencies in Directed Networks with Heavy-Tailed Degrees
• Measuring reciprocity in a directed preferential attachment network
• Random Graphs

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