No abstract

Complex networks are a recent type of framework used to study complex systems with many interacting elements, such as self-organized criticality (SOC). The network nodes' tendency to link to other nodes of similar type is characterized by assortative mixing. Real networks exhibit assortative mixing by vertex degree, however, typical random network models, such as the Erdős-Rényi or the Barabási-Albert model, show no assortative arrangements. In this paper we introduce the notion of neighborhood assortativity as the tendency of a node to belong to a community (its neighborhood) showing an average property similar to its own. Imposing neighborhood assortative mixing by degree in a network toy model, SOC dynamics can be found. These dynamics are driven only by the network topology. The long-range correlations resulting from criticality have been characterized by means of fluctuation analysis and show an anticorrelation in the node's activity. The model contains only one parameter and its statistics plots for different values of the parameter can be collapsed into a single curve. The simplicity of the model allows us to perform numerical simulations and also to study analytically the statistics for a specific value of the parameter, making use of the Markov chains.

This work considers the timescales associated with the global order parameter and the interlayer synchronization of coupled Kuramoto oscillators on multiplexes. For the two-layer multiplexes with initially high degree of synchronization in each layer, the difference between the average phases in each layer is analyzed from two different perspectives: the spectral analysis and the non-linear Kuramoto model. Both viewpoints confirm that the prior timescales are inversely proportional to the interlayer coupling strength. Thus, increasing the interlayer coupling always shortens the transient regimes of both the global order parameter and the interlayer synchronization. Surprisingly, the analytical results show that the convergence of the global order parameter is faster than the interlayer synchronization, and the latter is generally faster than the global synchronization of the multiplex. The formalism also outlines the effects of frequencies on the difference between the average phases of each layer, and identifies the conditions for an oscillatory behavior. Computer simulations are in fairly good agreement with the analytical findings and reveal that the timescale of the global order parameter is at least half times smaller than timescale of the multiplex.

Abstract. Degree ssortativity is the tendency for nodes of high degree (resp. low degree) in a graph to be connected to high degree nodes (resp. to low degree ones). It is usually quantified by the Pearson correlation coefficient of the degree-degree correlation. Here we extend this concept to account for the effect of second neighbours to a given node in a graph. That is, we consider the two-walks degree of a node as the sum of all the degrees of its adjacent nodes. The two-walks degree assortativity of a graph is then the Pearson correlation coefficient of the two-walks degree-degree correlation. We found here analytical expression for this two-walks degree assortativity index as a function of contributing subgraphs. We then study all the 261,000 connected graphs with 9 nodes and observe the existence of assortative-assortative and disassortative-disassortative graphs according to degree and two-walks degree, respectively. More surprinsingly, we observe a class of graphs which are degree disassortative and two-walks degree assortative. We explain the existence of some of these graphs due to the presence of certain topological features, such as a node of low-degree connected to high-degree ones. More importantly, we study a series of 49 real-world networks, where we observe the existence of the disassortative-assortative class in several of them. In particular, all biological networks studied here were in this class. We also conclude that no graphs/networks are possible with assortative-disassortative structure.