Generating directed networks with predetermined assortativity measures
From MaRDI portal
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.
Recommendations
- Assortativity measures for weighted and directed networks
- Construction of directed assortative configuration graphs
- Assortativity in complex networks
- Generation of arbitrary two-point correlated directed networks with given modularity
- Convergence of rank based degree-degree correlations in random directed networks
Cites work
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Are extreme value estimation methods useful for network data?
- Assortativity in complex networks
- Assortativity measures for weighted and directed networks
- Community detection and stochastic block models: recent developments
- Degree-degree dependencies in directed networks with heavy-tailed degrees
- Directed scale-free graphs
- Emergence of Scaling in Random Networks
- Fitting the linear preferential attachment model
- Measuring reciprocity in a directed preferential attachment network
- On congruity of nodes and assortative information content in complex networks
- Power-law distributions in empirical data
- Random Graphs
- Random graphs and complex networks. Volume 1
- The Bass diffusion model on finite Barabasi-Albert networks
Cited in
(6)- Generation of arbitrary two-point correlated directed networks with given modularity
- Construction of directed assortative configuration graphs
- wdnet
- wdnet
- Assortativity measures for weighted and directed networks
- A strength and sparsity preserving algorithm for generating weighted, directed networks with predetermined assortativity
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)
