• Corpus ID: 245836762

An Efficient Algorithm for Generating Directed Networks with Predetermined Assortativity Measures

@inproceedings{Wang2022AnEA,
  title={An Efficient Algorithm for Generating Directed Networks with Predetermined Assortativity Measures},
  author={Tiandong Wang and Jun Yan and Yelie Yuan and Panpan Zhang},
  year={2022}
}
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… 

References

SHOWING 1-10 OF 31 REFERENCES

Finding optimal assortativity configurations in directed networks

TLDR
A random directed network is considered and numerically trained the assortativity profiles of the four components of the digraphs case by applying degree-preserving rewiring, but it is found that the widely used two-swap method is severely limited.

Assortativity measures for weighted and directed networks

TLDR
A class of assortativity coefficients is proposed that capture the assortative characteristics and structure of weighted and directed networks more precisely and reveals interesting insights that would not be obtained by using existing ones.

Assortativity in complex networks

TLDR
The concept of assortativity is surveyed, starting from its original definition by Newman in 2002 and providing a new scope of research to incorporate directed graphs and weighted links.

Exploring the assortativity-clustering space of a network's degree sequence.

  • P. HolmeJ. Zhao
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2007
TLDR
This work argues that this ensemble of graphs with the same set of degrees can give more information about the original network than effective values of network structural quantities, and finds that high clustering might be a force in the evolution of protein interaction networks.

Weighted assortative and disassortative networks model

Edge direction and the structure of networks

TLDR
This work defines a set of four directed assortativity measures and assigns statistical significance by comparison to randomized networks and applies these measures to three network classes—online/social networks, food webs, and word-adjacency networks.

Mechanisms for tuning clustering and degree-correlations in directed networks

TLDR
This work introduces methods, based on degree preserving rewiring, that can be used to tune the clustering and degree-correlations in directed networks with random and scale-free topologies and provides null-models to investigate the role of the mentioned properties along with their strengths and limitations.

Uncovering disassortativity in large scale-free networks.

TLDR
It is concluded that rank correlations provide a suitable and informative method for uncovering network mixing patterns and much stronger negative degree-degree dependencies in Web graphs than was previously thought.

Measuring reciprocity in a directed preferential attachment network

TLDR
It is seen that with certain choices of parameters, the proportion of reciprocal edges in a directed PA network is close to 0, which points out one potential problem of fitting a classical PA model to a given network dataset with high reciprocity, and indicates that alternative models need to be considered.