Related papers: Network rewiring in the $r$-$K$ plane
Random networks are intensively used as null models to investigate properties of complex networks. We describe an efficient and accurate algorithm to generate arbitrarily two-point correlated undirected random networks without self- or…
By employing a recently introduced optimization algorithm we explicitely design optimally synchronizable (unweighted) networks for any given scale-free degree distribution. We explore how the optimization process affects degree-degree…
We analyze growing networks that are built by enhanced redirection. Nodes are sequentially added and each incoming node attaches to a randomly chosen 'target' node with probability 1-r, or to the parent of the target node with probability…
By constructing a multicanonical Monte Carlo simulation, we obtain the full probability distribution $\rho_N(r)$ of the degree assortativity coefficient $r$ on configuration networks of size $N$ by using the multiple histogram reweighting…
Contrary to many recent models of growing networks, we present a model with fixed number of nodes and links, where it is introduced a dynamics favoring the formation of links between nodes with degree of connectivity as different as…
Fractal scale-free networks are empirically known to exhibit disassortative degree mixing. It is, however, not obvious whether a negative degree correlation between nearest neighbor nodes makes a scale-free network fractal. Here we examine…
We introduce a model for the randomization of complex networks with geometric structure. The geometric randomization (GR) model assumes a homogeneous distribution of the nodes in an underlying similarity space and uses rewirings of the…
We provide arguments for the property of the degree-degree correlations of giant components formed by the percolation process on uncorrelated random networks. Using the generating functions, we derive a general expression for the…
In this paper we introduce a new, fast, degree-preserving rewiring algorithm for altering the assortativity of complex networks, which we call \textit{Fast total link (FTL) rewiring} algorithm. Commonly used existing algorithms require a…
The degree distribution is a key statistical indicator in network theory, often used to understand how information spreads across connected nodes. In this paper, we focus on non-growing networks formed through a rewiring algorithm and…
Synchronization is critical for system level behaviour in physical, chemical, biological and social systems. Empirical evidence has shown that the network topology strongly impacts the synchronizablity of the system, and the analysis of…
We numerically investigate the robustness of networks with degree-degree correlations between nodes separated by distance $l=2$ in terms of shortest path length. The degree-degree correlation between the $l$-th nearest neighbors can be…
In recent years there has been considerable interest in the structure and dynamics of complex networks. One of the most studied networks is the linear Barab\'asi-Albert model. Here we investigate the nonlinear Barab\'asi-Albert growing…
Many real-world complex networks simultaneously exhibit topological features of scale-free behaviour and hierarchical organization. In this regard, deterministic scale-free [A.-L. Barab\'asi \etal, Physica A, 299, 3 (2001)] and…
Complex networks have abundant and extensive applications in real life. Recently, researchers have proposed a number of complex networks, in which some are deterministic and others are random. Compared with deterministic networks, random…
We present a link rewiring mechanism to produce surrogates of a network where both the degree distribution and the rich--club connectivity are preserved. We consider three real networks, the AS--Internet, the protein interaction and the…
We find that transport on scale-free random networks depends strongly on degree-correlated network topologies whereas transport on Erd$\ddot{o}$s-R$\acute{e}$nyi networks is insensitive to the degree correlation. An approach for the tuning…
We introduce, and analyze, three measures for degree-degree dependencies, also called degree assortativity, in directed random graphs, based on Spearman's rho and Kendall's tau. We proof statistical consistency of these measures in general…
With complex networks emerging as an effective tool to tackle multidisciplinary problems, models of network generation have gained an importance of their own. These models allow us to extensively analyze the data obtained from real-world…
Network reconstruction consists in determining the unobserved pairwise couplings between $N$ nodes given only observational data on the resulting behavior that is conditioned on those couplings -- typically a time-series or independent…