Degree correlation is a crucial measure in networks, significantly impacting network
topology and dynamical behavior. The degree sequence of a network is a significant …

In this paper we introduce a new fast degree-preserving network rewiring algorithm.
Commonly used existing algorithms require a large number of iterations, in particular in the …

Understanding how the underlying network structure and interconnectivity impact on the
robustness of the interdependent networks is a major challenge in complex networks …

Many real-world systems can be described by scale-free networks with power-law degree
distributions. Scale-free networks show a “robust yet fragile” feature due to their …

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 …

Ecologists developed a strong interest for network theory, as it allowed to make sense of
some of the complexity of ecological communities. In contrast to early approaches on …

As the robustness of network is mainly determined by the number of redundant paths in the
network, many networks perform well in some robustness metrics just because of their large …

A robust system should perform well under random failures or targeted attacks, and
networks have been widely used to model the underlying structure of complex systems such …

It has been recently proposed that natural connectivity can be used to efficiently characterize
the robustness of complex networks. The natural connectivity has an intuitive physical …

Random rewiring is used to generate null networks for the purpose of analyzing the
topological properties of scale-free networks, yet the effects of random rewiring on the …