Magnetic order in spin-1 and spin-$$\frac{3} {2}$$ interpolating square-triangle Heisenberg antiferromagnets

We consider coevolution of site state and network structures from different initial substrates: a one dimensional Ising chain, a scale free network and network with non-linear degree dependence. The dynamics is governed by a preassigned stability parameter S, and a rewiring factor φ, that determines whether the Ising spin at the chosen site flips or whether the site gets rewired to another site in the system. We have observed the steady state average stability and magnetisation for both kinds of systems to have an idea about the effect of initial network topology. Although the average stability shows almost similar behaviour, the magnetisation depends on the initial condition we start from. Apart from the local dynamics, the global effect on the dynamics has also been studied. These studies show interesting variations in the steady state values of average stability and magnetisation for different values of S and φ, which helps in indicating the gradual change of existing social networks.     

Epidemic dynamics on an adaptive network

Many real-world networks are characterized by adaptive changes in their topology depending on the state of their nodes. Here we study epidemic dynamics on an adaptive network, where the susceptibles are able to avoid contact with the infected by rewiring their network connections. This gives rise to assortative degree correlation, oscillations, hysteresis, and first order transitions. We propose a low-dimensional model to describe the system and present a full local bifurcation analysis. Our results indicate that the interplay between dynamics and topology can have important consequences for the spreading of infectious diseases and related applications.     

Disease spreading on fitness-rewired complex networks

As people travel, human contact networks may change topologically from time to time. In this paper, we study the problem of epidemic spreading on this kind of dynamic network, specifically the one in which the rewiring dynamics of edges are carried out to preserve the degree of each node (called fitness rewiring). We also consider the adaptive rewiring of edges, which encourages disconnections from and discourages connections to infected nodes and eventually leads to the isolation of the infected from the susceptible with only a small number of links between them. We find that while the threshold of epidemic spreading remains unchanged and prevalence increases in the fitness rewiring dynamics, meeting of the epidemic threshold is delayed and prevalence is reduced (if adaptive dynamics are included). To understand these different behaviors, we introduce a new measure called the “mean change of effective links” and find that creation and deletion of pathways for pathogen transmission are the dominant factors in fitness and adaptive rewiring dynamics, respectively.     

Contagion dynamics on adaptive multiplex networks with awareness-dependent rewiring

Over the last few years, the interplay between contagion dynamics of social influences (e.g., human awareness, risk perception, and information dissemination) and biological infections has been extensively investigated within the framework of multiplex networks. The vast majority of existing multiplex network spreading models typically resort to heterogeneous mean-field approximation and microscopic Markov chain approaches. Such approaches usually manifest richer dynamical properties on multiplex networks than those on simplex networks; however, they fall short of a subtle analysis of the variations in connections between nodes of the network and fail to account for the adaptive behavioral changes among individuals in response to epidemic outbreaks. To transcend these limitations, in this paper we develop a highly integrated effective degree approach to modeling epidemic and awareness spreading processes on multiplex networks coupled with awareness-dependent adaptive rewiring. This approach keeps track of the number of nearest neighbors in each state of an individual; consequently, it allows for the integration of changes in local contacts into the multiplex network model. We derive a formula for the threshold condition of contagion outbreak. Also, we provide a lower bound for the threshold parameter to indicate the effect of adaptive rewiring. The threshold analysis is confirmed by extensive simulations. Our results show that awareness-dependent link rewiring plays an important role in enhancing the transmission threshold as well as lowering the epidemic prevalence. Moreover, it is revealed that intensified awareness diffusion in conjunction with enhanced link rewiring makes a greater contribution to disease prevention and control. In addition, the critical phenomenon is observed in the dependence of the epidemic threshold on the awareness diffusion rate, supporting the metacritical point previously reported in literature. This work may shed light on understanding of the interplay between epidemic dynamics and social contagion on adaptive networks.     

Adaptive random walks on the class of Web graphs

We study random walk with adaptive move strategies on a class of directed graphs with variable wiring diagram. The graphs are grown from the evolution rules compatible with the dynamics of the world-wide Web [B. Tadić, Physica A 293, 273 (2001)], and are characterized by a pair of power-law distributions of out- and in-degree for each value of the parameter β, which measures the degree of rewiring in the graph. The walker adapts its move strategy according to locally available information both on out-degree of the visited node and in-degree of target node. A standard random walk, on the other hand, uses the out-degree only. We compute the distribution of connected subgraphs visited by an ensemble of walkers, the average access time and survival probability of the walks. We discuss these properties of the walk dynamics relative to the changes in the global graph structure when the control parameter β is varied. For β≥ 3, corresponding to the world-wide Web, the access time of the walk to a given level of hierarchy on the graph is much shorter compared to the standard random walk on the same graph. By reducing the amount of rewiring towards rigidity limit β↦β_c≲ 0.1, corresponding to the range of naturally occurring biochemical networks, the survival probability of adaptive and standard random walk become increasingly similar. The adaptive random walk can be used as an efficient message-passing algorithm on this class of graphs for large degree of rewiring.     

Shift of percolation thresholds for epidemic spread between static and dynamic small-world networks

The study compares the epidemic spread on static and dynamic small-world networks. They are constructed as a 2-dimensional Newman and Watts model (500 × 500 square lattice with additional shortcuts), where the dynamics involves rewiring shortcuts in every time step of the epidemic spread. We assume susceptible-infectious-removed (SIR) model of the disease. We study the behaviour of the epidemic over the range of shortcut probability per underlying bond ϕ = 0–0.5. We calculate percolation thresholds for the epidemic outbreak, for which numerical results are checked against an approximate analytical model. We find a significant lowering of percolation thresholds on the dynamic network in the parameter range given. The result shows the behaviour of the epidemic on dynamic network is that of a static small world with the number of shortcuts increased by 20.7±1.4 %, while the overall qualitative behaviour stays the same. We derive corrections to the analytical model which account for the effect. For both dynamic and static small worlds we observe suppression of the average epidemic size dependence on network size in comparison with the finite-size scaling known for regular lattice. We also study the effect of dynamics for several rewiring rates relative to infectious period of the disease.     

Effect of local rewiring in adaptive epidemic networks

We investigate the dynamics of a susceptible-infected-susceptible (SIS) epidemic model on adaptive (co-evolutionary) networks. In most of these models, the rewiring mechanism is based on information known globally. Here, we propose local rewiring where rewiring decision is based on local information around a given node. Our results show that there are phase overlaps between local and global rewirings. The results suggest that under a certain circumstance, even with limited local information, outcomes from both rewirings are statistically similar. Furthermore, we found that the epidemic threshold does not depend on the amount of information. This could be useful for planned intervention of an epidemic spreading using minimal information.     

Symbiotic relationship between brain structure and dynamics

Background  

Brain structure and dynamics are interdependent through processes such as activity-dependent neuroplasticity. In this study, we aim to theoretically examine this interdependence in a model of spontaneous cortical activity. To this end, we simulate spontaneous brain dynamics on structural connectivity networks, using coupled nonlinear maps. On slow time scales structural connectivity is gradually adjusted towards the resulting functional patterns via an unsupervised, activity-dependent rewiring rule. The present model has been previously shown to generate cortical-like, modular small-world structural topology from initially random connectivity. We provide further biophysical justification for this model and quantitatively characterize the relationship between structure, function and dynamics that accompanies the ensuing self-organization.     

Flat-head power-law, size-independent clustering, and scaling of coevolutionary scale-free networks

Scale-free topology and high clustering coexist in some real networks, and keep invariant for growing sizes of the systems. Previous models could hardly give out size-independent clustering with selforganized mechanism when succeeded in producing power-law degree distributions. Always ignored, some empirical statistic results display flat-head power-law behaviors. We modify our recent coevolutionary model to explain such phenomena with the inert property of nodes to retain small portion of unfavorable links in self-organized rewiring process. Flat-head power-law and size-independent clustering are induced as the new characteristics by this modification. In addition, a new scaling relation is found as the result of interplay between node state growth and adaptive variation of connections.     

Time scales in evolutionary game on adaptive networks

Most previous studies concerning spatial games have assumed strategy updating occurs with a fixed ratio relative to interactions. We here set up a coevolutionary model to investigate how different ratio affects the evolution of cooperation on adaptive networks. Simulation results demonstrate that cooperation can be significantly enhanced under our rewiring mechanism, especially with slower natural selection. Meanwhile, slower selection induces larger network heterogeneity. Strong selection contracts the parameter area where cooperation thrives. Therefore, cooperation prevails whenever individuals are offered enough chances to adapt to the environment. Robustness of the results has been checked under rewiring cost or varied networks.     

Network evolution by nonlinear preferential rewiring of edges

The mathematical framework for small-world networks proposed in a seminal paper by Watts and Strogatz sparked a widespread interest in modeling complex networks in the past decade. However, most of research contributing to static models is in contrast to real-world dynamic networks, such as social and biological networks, which are characterized by rearrangements of connections among agents. In this paper, we study dynamic networks evolved by nonlinear preferential rewiring of edges. The total numbers of vertices and edges of the network are conserved, but edges are continuously rewired according to the nonlinear preference. Assuming power-law kernels with exponents α and β, the network structures in stationary states display a distinct behavior, depending only on β. For β>1, the network is highly heterogeneous with the emergence of starlike structures. For β<1, the network is widely homogeneous with a typical connectivity. At β=1, the network is scale free with an exponential cutoff.     

Impact of delays and rewiring on the dynamics of small-world neuronal networks with two types of coupling

We study synchronization transitions and pattern formation on small-world networks consisting of Morris-Lecar excitable neurons in dependence on the information transmission delay and the rewiring probability. In addition, networks formed via gap junctional connections and coupling via chemical synapses are considered separately. For gap-junctionally coupled networks we show that short delays can induce zigzag fronts of excitations, whereas long delays can further detriment synchronization due to a dynamic clustering anti-phase synchronization transition. For the synaptically coupled networks, on the other hand, we find that the clustering anti-phase synchronization can appear as a direct consequence of the prolongation of information transmission delay, without being accompanied by zigzag excitatory fronts. Irrespective of the coupling type, however, we show that an appropriate small-world topology can always restore synchronized activity if only the information transmission delays are short or moderate at most. Long information transmission delays always evoke anti-phase synchronization and clustering, in which case the fine-tuning of the network topology fails to restore the synchronization of neuronal activity.     

Key role of time-delay and connection topology in shaping the dynamics of noisy genetic regulatory networks

This paper focuses on a paced genetic regulatory small-world network with time-delayed coupling. How the dynamical behaviors including temporal resonance and spatial synchronization evolve under the influence of time-delay and connection topology is explored through numerical simulations. We reveal the phenomenon of delay-induced resonance when the network topology is fixed. For a fixed time-delay, temporal resonance is shown to be degraded by increasing the rewiring probability of the network. On the other hand, for small rewiring probability, temporal resonance can be enhanced by an appropriately tuned small delay but degraded by a large delay, while conversely, temporal resonance is always reduced by time-delay for large rewiring probability. Finally, an optimal spatial synchrony is detected by a proper combination of time-delay and connection topology.     

A Generalization of Hawking’s Black Hole Topology Theorem to Higher Dimensions

Hawking’s theorem on the topology of black holes asserts that cross sections of the event horizon in 4-dimensional asymptotically flat stationary black hole spacetimes obeying the dominant energy condition are topologically 2-spheres. This conclusion extends to outer apparent horizons in spacetimes that are not necessarily stationary. In this paper we obtain a natural generalization of Hawking’s results to higher dimensions by showing that cross sections of the event horizon (in the stationary case) and outer apparent horizons (in the general case) are of positive Yamabe type, i.e., admit metrics of positive scalar curvature. This implies many well-known restrictions on the topology, and is consistent with recent examples of five dimensional stationary black hole spacetimes with horizon topology S ² × S ¹. The proof is inspired by previous work of Schoen and Yau on the existence of solutions to the Jang equation (but does not make direct use of that equation).     

有倾向性重连产生的反匹配网络

在具有网络结构的系统中度关联属性对于动力学行为具有重要的影响, 所以产生适当度关联网络的方法对于大量网络系统的研究具有重要的作用. 尽管产生正匹配网络的方法已经得到很好的验证, 但是产生反匹配网络的方法还没有被系统的讨论过. 重新连接网络中的边是产生度关联网络的一个常用方法. 这里我们研究使用重连方法产生反匹配无标度网络的有效性. 我们的研究表明, 有倾向的重连可以增强网络的反匹配属性. 但是有倾向重连不能使皮尔森度相关系数下降到-1, 而是存在一个依赖于网络参数的最小值. 我们研究了网络的主要参数对于网络度相关系数的影响, 包括网络尺寸, 网络的连接密度和网络节点的度差异程度. 研究表明在网络尺寸大的情况下和节点度差异性强的情况下, 重连的效果较差. 我们研究了真实Internet网络, 发现模型产生的网络经过重连不能达到真实网络的度关联系数.     

Cyclic dominance in adaptive networks

The Rock-Paper-Scissors (RPS) game is a paradigmatic model for cyclic dominance in biological systems. Here we consider this game in the social context of competition between opinions in a networked society. In our model, every agent has an opinion which is drawn from the three choices: rock, paper or scissors. In every timestep a link is selected randomly and the game is played between the nodes connected by the link. The loser either adopts the opinion of the winner or rewires the link. These rules define an adaptive network on which the agents’ opinions coevolve with the network topology of social contacts. We show analytically and numerically that nonequilibrium phase transitions occur as a function of the rewiring strength. The transitions separate four distinct phases which differ in the observed dynamics of opinions and topology. In particular, there is one phase where the population settles to an arbitrary consensus opinion. We present a detailed analysis of the corresponding transitions revealing an apparently paradoxical behavior. The system approaches consensus states where they are unstable, whereas other dynamics prevail when the consensus states are stable.     

Synchronization of coupled stochastic oscillators: The effect of topology

We study sets of genetic networks having stochastic oscillatory dynamics. Depending on the coupling topology we find regimes of phase synchronization of the dynamical variables. We consider the effect of time-delay in the interaction and show that for suitable choices of delay parameter, either in-phase or anti-phase synchronization can occur.      

Delay-induced synchronization transitions in small-world neuronal networks with hybrid electrical and chemical synapses

We study the dependence of synchronization transitions in small-world networks of bursting neurons with hybrid electrical–chemical synapses on the information transmission delay, the probability of electrical synapses, and the rewiring probability. It is shown that, irrespective of the probability of electrical synapses, the information transmission delay can always induce synchronization transitions in small-world neuronal networks, i.e., regions of synchronization and nonsynchronization appear intermittently as the delay increases. In particular, all these transitions to burst synchronization occur approximately at integer multiples of the bursting period of individual neurons. In addition, for larger probability of electrical synapses, the intermittent synchronization transition is more profound, due to the stronger synchronization ability of electrical synapses compared with chemical ones. More importantly, chemical and electrical synapses can perform complementary roles in the synchronization of hybrid small-world neuronal networks: the larger the electrical synapse strength is, the smaller the chemical synapse strength needed to achieve burst synchronization. Furthermore, the small-world topology has a significant effect on the synchronization transition in hybrid neuronal networks. It is found that increasing the rewiring probability can always enhance the synchronization of neuronal activity. The results obtained are instructive for understanding the synchronous behavior of neural systems.     

一种基于元胞自动机的自适应网络病毒传播模型

自适应网络是节点动力学和网络动力学相互作用和反馈的演化网络. 基于元胞自动机建立自适应网络中易感-感染-易感(susceptible-infected-susceptible)的病毒传播模型,研究节点为了规避病毒传播所采取的多种网络重连规则对病毒传播及网络统计特征的影响. 结果表明:自适应网络中的重连规则可以有效减缓病毒传播速度,降低病毒传播规模;随机重连规则使得网络统计特征趋于随机网络;基于元胞自动机建立的传播模型清晰地表达了病毒在传播过程中的双稳态现象. 关键词： 自适应网络 传播动力学 网络动力学 元胞自动机     

Mean first-passage time for random walks on undirected networks

In this paper, by using two different techniques we derive an explicit formula for the mean first-passage time (MFPT) between any pair of nodes on a general undirected network, which is expressed in terms of eigenvalues and eigenvectors of an associated matrix similar to the transition matrix. We then apply the formula to derive a lower bound for the MFPT to arrive at a given node with the starting point chosen from the stationary distribution over the set of nodes. We show that for a correlated scale-free network of size N with a degree distribution P(d) ∼ d ^−γ , the scaling of the lower bound is N ^1−1/γ . Also, we provide a simple derivation for an eigentime identity. Our work leads to a comprehensive understanding of recent results about random walks on complex networks, especially on scale-free networks.