In complex networks a common task is to identify the most important or “central” nodes. There are several definitions, often called centrality measures, which often lead to different results. Here, we introduce fingerprints of networks, which we define as correlation plots of local and...

We have developed a method to analyze and interpret emerging structures in a set of data which lacks some information. It has been conceived to be applied to the problem of getting information about people who disappeared in the Argentine state of Tucumán from 1974 to 1981. Even if the military...

In this paper, by both simulations and theoretical predictions we study two and three node (or degree) correlations in random Apollonian network (RAN), which have small-world and scale-free topologies. Using the rate equation approach under the assumption of continuous degree, we first give the...

We present the modification of natural visibility graph (NVG) algorithm used for the mapping of the time series to the complex networks (graphs). We propose the parametric natural visibility graph (PNVG) algorithm. The PNVG consists of NVG links, which satisfy an additional constraint determined...

In the present study we consider relations between companies in Poland taking into account common branches they belong to. It is clear that companies belonging to the same branch compete for similar customers, so the market induces correlations between them. On the other hand two branches can be...

Considering the microscopic characteristics (vehicle speed, road length etc.) of links and macroscopic behaviors of traffic systems, we derive the critical flow generation rate in scale-free networks. And the dynamics of traffic congestion is studied numerically in this paper. It is shown that...

With the help of the recurrence relations derived from the self-similar structure, we obtain the closed-form solution for the average path length of a class of scale-free fractal hierarchical lattices (HLs) with a general parameter q, which are simultaneously scale-free, self-similar and...

We consider a finite set S={x1,…,xr} and associate to each element xi a probability pi. We then form sequences (N-strings) by drawing at random N elements from S with respect to the probabilities assigned to them. Each N-string generates a network where the elements of S are represented as...

We study the synchronization of Kuramoto's oscillators in small parts of networks known as motifs. We first report on the system dynamics for the case of a scale-free network and show the existence of a non-trivial critical point. We compute the probability that network motifs synchronize, and...

In this paper we present a study of the connectivity degrees of the threshold preferential attachment model, a generalization of the Barabási–Albert model to heterogeneous complex networks. The threshold model incorporates the states of the nodes in its preferential linking rule and assumes...