Dynamic behaviors in directed networks

Tale of two emergent games: Opinion dynamics in dynamical directed networks

Unidirectional social interactions are ubiquitous in real social networks whereas undirected interactions are intensively studied. We establish a voter model in a dynamical directed network. We analytically obtain the degree distribution of the evolving network at any given time. Furthermore, we find that the average degree is captured by an emergent game. However, we find that the fate of opinions is captured by another emergent game. Beyond expectation, the two emergent games are typically different due to the unidirectionality of the evolving networks. The Nash equilibrium analysis of the two games facilitates us to give the criterion under which the minority opinion with few disciples initially takes over the population eventually for in-group bias. Our work fosters the understanding of opinion dynamics ranging from methodology to research content.

Synchronization enhancement subjected to adaptive blinking coupling

Synchronization holds a significant role, notably within chaotic systems, in various contexts where the coordinated behavior of systems plays a pivotal and indispensable role. Hence, many studies have been dedicated to investigating the underlying mechanism of synchronization of chaotic systems. Networks with time-varying coupling, particularly those with blinking coupling, have been proven essential. The reason is that such coupling schemes introduce dynamic variations that enhance adaptability and robustness, making them applicable in various real-world scenarios. This paper introduces a novel adaptive blinking coupling, wherein the coupling adapts dynamically based on the most influential variable exhibiting the most significant average disparity. To ensure an equitable selection of the most effective coupling at each time instance, the average difference of each variable is normalized to the synchronous solution's range. Due to this adaptive coupling selection, synchronization enhancement is expected to be observed. This hypothesis is assessed within networks of identical systems, encompassing Lorenz, Rössler, Chen, Hindmarsh-Rose, forced Duffing, and forced van der Pol systems. The results demonstrated a substantial improvement in synchronization when employing adaptive blinking coupling, particularly when applying the normalization process.

Coupling of link- and node-ordering in the coevolving voter model

We consider the process of reaching the final state in the coevolving voter model. There is a coevolution of state dynamics, where a node can copy a state from a random neighbor with probabilty 1-p and link dynamics, where a node can rewire its link to another node of the same state with probability p. That exhibits an absorbing transition to a frozen phase above a critical value of rewiring probability. Our analytical and numerical studies show that in the active phase mean values of magnetization of nodes n and links m tend to the same value that depends on initial conditions. In a similar way mean degrees of spins up and spins down become equal. The system obeys a special statistical conservation law since a linear combination of both types magnetizations averaged over many realizations starting from the same initial conditions is a constant of motion: Λ≡(1-p)μm(t)+pn(t)=const., where μ is the mean node degree. The final mean magnetization of nodes and links in the active phase is proportional to Λ while the final density of active links is a square function of Λ. If the rewiring probability is above a critical value and the system separates into disconnected domains, then the values of nodes and links magnetizations are not the same and final mean degrees of spins up and spins down can be different.

Network science approach to modelling the topology and robustness of supply chain networks: a review and perspective

Due to the increasingly complex and interconnected nature of global supply chain networks (SCNs), a recent strand of research has applied network science methods to model SCN growth and subsequently analyse various topological features, such as robustness. This paper provides: (1) a comprehensive review of the methodologies adopted in literature for modelling the topology and robustness of SCNs; (2) a summary of topological features of the real world SCNs, as reported in various data driven studies; and (3) a discussion on the limitations of existing network growth models to realistically represent the observed topological characteristics of SCNs. Finally, a novel perspective is proposed to mimic the SCN topologies reported in empirical studies, through fitness based generative network models.

Epidemic threshold in directed networks

Epidemics have so far been mostly studied in undirected networks. However, many real-world networks, such as the online social network Twitter and the world wide web, on which information, emotion, or malware spreads, are directed networks, composed of both unidirectional links and bidirectional links. We define the directionality ξ as the percentage of unidirectional links. The epidemic threshold τ(c) for the susceptible-infected-susceptible (SIS) epidemic is lower bounded by 1/λ(1) in directed networks, where λ(1), also called the spectral radius, is the largest eigenvalue of the adjacency matrix. In this work, we propose two algorithms to generate directed networks with a given directionality ξ. The effect of ξ on the spectral radius λ(1), principal eigenvector x(1), spectral gap (λ(1)-|λ(2)|), and algebraic connectivity μ(N-1) is studied. Important findings are that the spectral radius λ(1) decreases with the directionality ξ, whereas the spectral gap and the algebraic connectivity increase with the directionality ξ. The extent of the decrease of the spectral radius depends on both the degree distribution and the degree-degree correlation ρ(D). Hence, in directed networks, the epidemic threshold is larger and a random walk converges to its steady state faster than that in undirected networks with the same degree distribution.

Sampling properties of directed networks

For many real-world networks only a small "sampled" version of the original network may be investigated; those results are then used to draw conclusions about the actual system. Variants of breadth-first search (BFS) sampling, which are based on epidemic processes, are widely used. Although it is well established that BFS sampling fails, in most cases, to capture the IN component(s) of directed networks, a description of the effects of BFS sampling on other topological properties is all but absent from the literature. To systematically study the effects of sampling biases on directed networks, we compare BFS sampling to random sampling on complete large-scale directed networks. We present new results and a thorough analysis of the topological properties of seven complete directed networks (prior to sampling), including three versions of Wikipedia, three different sources of sampled World Wide Web data, and an Internet-based social network. We detail the differences that sampling method and coverage can make to the structural properties of sampled versions of these seven networks. Most notably, we find that sampling method and coverage affect both the bow-tie structure and the number and structure of strongly connected components in sampled networks. In addition, at a low sampling coverage (i.e., less than 40%), the values of average degree, variance of out-degree, degree autocorrelation, and link reciprocity are overestimated by 30% or more in BFS-sampled networks and only attain values within 10% of the corresponding values in the complete networks when sampling coverage is in excess of 65%. These results may cause us to rethink what we know about the structure, function, and evolution of real-world directed networks.

Effect of synaptic plasticity on the structure and dynamics of disordered networks of coupled neurons

In an all-to-all network of integrate-and-fire neurons in which there is a disorder in the intrinsic oscillatory frequencies of the neurons, we show that through spike-timing-dependent plasticity the synapses which have the high-frequency neurons as presynaptic tend to be potentiated while the links originated from the low-frequency neurons are weakened. The emergent effective flow of directed connections introduces the high-frequency neurons as the more influential elements in the network and facilitates synchronization by decreasing the synaptic cost for onset of synchronization.

Early fragmentation in the adaptive voter model on directed networks

We consider voter dynamics on a directed adaptive network with fixed out-degree distribution. A transition between an active phase and a fragmented phase is observed. This transition is similar to the undirected case if the networks are sufficiently dense and have a narrow out-degree distribution. However, if a significant number of nodes with low out degree is present, then fragmentation can occur even far below the estimated critical point due to the formation of self-stabilizing structures that nucleate fragmentation. This process may be relevant for fragmentation in current political opinion formation processes.

Enhancing synchronization by directionality in complex networks

We propose a method called the residual edge-betweenness gradient (REBG) to enhance the synchronizability of networks by assigning the link direction while keeping the topology and link weights unchanged. Direction assignment has been shown to improve the synchronizability of undirected networks in general, but we find that in some cases incommunicable components emerge and networks fail to synchronize. We show that the REBG method improves the residual degree gradient (RDG) method by effectively avoiding the synchronization failure. Further experiments show that the REBG method enhances the synchronizability in networks with a community structure compared with the RDG method.

Voter model on a directed network: role of bidirectional opinion exchanges

The voter model with the node update rule is numerically investigated on a directed network. We start from a directed hierarchical tree, and split and rewire each incoming arc at the probability p . In order to discriminate the better and worse opinions, we break the Z2 symmetry (σ=±1) by giving a little more preference to the opinion σ=1 . It is found that as p becomes larger, introducing more complicated pattern of information flow channels, and as the network size N becomes larger, the system eventually evolves to the state in which more voters agree on the better opinion, even though the voter at the top of the hierarchy keeps the worse opinion. We also find that the pure hierarchical tree makes opinion agreement very fast, while the final absorbing state can easily be influenced by voters at the higher ranks. On the other hand, although the ordering occurs much slower, the existence of complicated pattern of bidirectional information flow allows the system to agree on the better opinion.

Dynamics and directionality in complex networks

We investigate how we can improve the synchronizability of complex networks simply by changing the link direction while conserving the local link weights and topology. Performing the linear stability analysis of synchronization and numerical simulation of the Kuramoto model in the directed networks, we find that while a random assignment of link directions generally weakens the degree of synchronization, a properly organized directionality can systematically enhance the network synchronization. In this respect, we suggest a simple method of changing the link direction according to the larger residual degree starting from small residual degree nodes. This result provides plausible applications to control the synchronizability of systems in various fields.

Disease spread in small-size directed networks: epidemic threshold, correlation between links to and from nodes, and clustering

Network epidemiology has mainly focused on large-scale complex networks. It is unclear whether findings of these investigations also apply to networks of small size. This knowledge gap is of relevance for many biological applications, including meta-communities, plant-pollinator interactions and the spread of the oomycete pathogen Phytophthora ramorum in networks of plant nurseries. Moreover, many small-size biological networks are inherently asymmetrical and thus cannot be realistically modelled with undirected networks. We modelled disease spread and establishment in directed networks of 100 and 500 nodes at four levels of connectance in six network structures (local, small-world, random, one-way, uncorrelated, and two-way scale-free networks). The model was based on the probability of infection persistence in a node and of infection transmission between connected nodes. Regardless of the size of the network, the epidemic threshold did not depend on the starting node of infection but was negatively related to the correlation coefficient between in- and out-degree for all structures, unless networks were sparsely connected. In this case clustering played a significant role. For small-size scale-free directed networks to have a lower epidemic threshold than other network structures, there needs to be a positive correlation between number of links to and from nodes. When this correlation is negative (one-way scale-free networks), the epidemic threshold for small-size networks can be higher than in non-scale-free networks. Clustering does not necessarily have an influence on the epidemic threshold if connectance is kept constant. Analyses of the influence of the clustering on the epidemic threshold in directed networks can also be spurious if they do not consider simultaneously the effect of the correlation coefficient between in- and out-degree.

A network model of E. coli O157 transmission within a typical UK dairy herd: the effect of heterogeneity and clustering on the prevalence of infection

Cattle are considered to be the main reservoir for Vero cytotoxin-producing Escherichia coli (VTEC) O157, a cause of food-poisoning (and even death) in humans. Here, the transmission of E. coli O157 within a typical UK dairy herd is modelled using a semi-stochastic network model. The model incorporates demographic as well as infection processes. Indirect transmission is modelled homogeneously, while direct transmission is modelled via a dynamic contact network. The aim was to investigate the effects of heterogeneity and clustering on the prevalence of infection within the herd and discover whether, particularly in terms of choosing an intervention strategy, it is necessary to include heterogeneity in direct contacts when modelling this sort of system. Results show that heterogeneity in direct contacts can make it more difficult for the pathogen to persist, particularly when the average number of contacts (per animal) in each group is small. They also show that the relationship between clustering and prevalence is not simple. For example, increasing the average number of contacts can increase clustering and prevalence. However, when the average number of contacts in each group is sufficiently high, higher clustering leads to lower prevalence. It would seem that clustering can aid the flow of infection under certain circumstances, but hinder it under others (probably by preventing wider dissemination). Further results show that indirect transmission (as it is modelled here) effectively removes the effect of heterogeneity in direct contacts. In terms of investigating proposed interventions, the results suggest that a network model would only be required if there was evidence to suggest that direct transmission was the major source of infection.