Two Novel Methods to Enhance Network Synchronizability

In this paper, we propose two methods to enhance the synchronizability of a class of complex networks which do not hold the positive correlation between betweenness centrality （BC） and degree of a node, and observe other topology characteristics of the network affected by the methods. Numerical simulations show that both methods can effectively enhance the synchronizability of this kind of networks. Furthermore, we show that the maximal BC of all edges is an important factor to affect the network synchronizability, although it is not the unique factor.     

Phase synchronization on small-world networks with community structure

In this paper, we propose a simple model that can generate small-world network with community structure. The network is introduced as a tunable community organization with parameter r, which is directly measured by the ratio of inter- to intra-community connectivity, and a smaller r corresponds to a stronger community structure. The structure properties, including the degree distribution, clustering, the communication efficiency and modularity are also analysed for the network. In addition, by using the Kuramoto model, we investigated the phase synchronization on this network, and found that increasing the fuzziness of community structure will markedly enhance the network synchronizability; however, in an abnormal region (r ≤ 0.001), the network has even worse synchronizability than the case of isolated communities (r = 0). Furthermore, this network exhibits a remarkable synchronization behaviour in topological scales: the oscillators of high densely interconnected communities synchronize more easily, and more rapidly than the whole network.     

Enhancing synchronizability by rewiring networks

<正>According to different forms of synchronized region,complex networks are divided into typeⅠ(unbounded synchronization region) and typeⅡ(bounded synchronization region) networks.This paper presents a rewiring algorithm to enhance the synchronizability of typeⅠand typeⅡnetworks.By utilizing the algorithm for an unweighted and undirected network,a better synchronizability of network with the same number of nodes and edges can be obtained. Numerical simulations on several different network models are used to support the proposed procedure.The relationship between different topological properties of the networks and the number of rewirings are shown.It finds that the final optimized network is independent of the initial network,and becomes homogeneous.In addition the optimized networks have similar structural properties in the sense of degree,and node and edge betweenness centralities.However,they do not have similar cluster coefficients for typeⅡnetworks.The research may be useful for designing more synchronizable networks and understanding the synchronization behaviour of networks.     

Pinning-controlled synchronization of complex networks with bounded or unbounded synchronized regions

This paper studies pinning-controlled synchronization of complex networks with bounded or unbounded synchronized regions. To study a state-feedback pinning-controlled network with N nodes, it first converts the controlled network to an extended network of N+1 nodes without controls. It is shown that the controlled synchronizability of the given network is determined by the real part of the smallest nonzero eigenvalue of the coupling matrix of its extended network when the synchronized region is unbounded; but it is determined by the ratio of the real parts of the largest and the smallest nonzero eigenvalues of the coupling matrix when the synchronized region is bounded. Both theoretical analysis and numerical simulation show that the portion of controlled nodes has no critical values when the synchronized region is unbounded, but it has a critical value when the synchronized region is bounded. In the former case, therefore, it is possible to control the network to achieve synchronization by pinning only one node. In the latter case, the network can achieve controlled synchronization only when the portion of controlled nodes is larger than the critical value.     

Adaptive local routing strategy on a scale-free network

Due to the heterogeneity of the structure on a scale-free network, making the betweennesses of all nodes become homogeneous by reassigning the weights of nodes or edges is very difficult. In order to take advantage of the important effect of high degree nodes on the shortest path communication and preferentially deliver packets by them to increase the probability to destination, an adaptive local routing strategy on a scale-free network is proposed, in which the node adjusts the forwarding probability with the dynamical traffic load (packet queue length) and the degree distribution of neighbouring nodes. The critical queue length of a node is set to be proportional to its degree, and the node with high degree has a larger critical queue length to store and forward more packets. When the queue length of a high degree node is shorter than its critical queue length, it has a higher probability to forward packets. After higher degree nodes are saturated (whose queue lengths are longer than their critical queue lengths), more packets will be delivered by the lower degree nodes around them. The adaptive local routing strategy increases the probability of a packet finding its destination quickly, and improves the transmission capacity on the scale-free network by reducing routing hops. The simulation results show that the transmission capacity of the adaptive local routing strategy is larger than that of three previous local routing strategies.     

Undetermination of the synchronizability and relation between network betweenness centrality

Betweenness centrality is taken as a sensible indicator of the synchronizability of complex networks. To test whether betweenness centrality is a proper measure of the synchronizability in specific realizations of random networks, this paper adds edges to the networks and then evaluates the changes of betweenness centrality and network synchronizability. It finds that the two quantities vary independently.     

Phase Transition of the Pair Contact Process Model in a Fragmented Network

We investigate the phase transition of the pair contact process （PCP） model in a fragmented network. The network is formed by rewiring the link between two nearest neighbors to another randomly selected site in one dimension with a probability q. When the average degree （k〉 = 2, the system exhibits a structure transition and the lattice is fragmented into several isolated subgraphs, it is shown that a giant cluster appears and its node fraction does not change nearly for q 〉 0. Furthermore, it is found that the critical behavior of the continuous phase transition for the PCP model is different from the directed percolation （DP） class and the estimated values of the critical exponents are independent of the rewiring probability for q 〉 0. We conjecture that the structure transition for （k） = 2 takes an important role in the change of the critical behavior of the continuous phase transition.     

Average Range and Network Synchronizability

The influence of structural properties of a network on the network synchronizability is studied by introducing a new concept of average range of edges. For both small-world and scale-free networks, the effect of average range on the synchronizability of networks with bounded or unbounded synchronization regions is illustrated through numerical simulations. The relations between average range, range distribution, average distance, and maximum betweenness are also explored, revealing the effects of these factors on the network synchronizability of the small-world and scale-free networks, respectively.     

Undetermination of the relation between network synchronizability and betweenness centrality

Betweenness centrality is taken as a sensible indicator of the synchronizability of complex networks. To test whether betweenness centrality is a proper measure of the synchronizability in specific realizations of random networks,this paper adds edges to the networks and then evaluates the changes of betweenness centrality and network synchronizability. It finds that the two quantities vary independently.     

Synchronization of coupled logistic maps on random community networks

The collective synchronization of a system of coupled logistic maps on random community networks is investigated. It is found that the synchronizability of the community network is affected by two factors when the size of the network and the number of connections are fixed. One is the number of communities denoted by the parameter rn, and the other is the ratio σ of the connection probability p of each pair of nodes within each community to the connection probability q of each pair of nodes among different communities. Theoretical analysis and numerical results indicate that larger rn and smaller σ are the key to the enhancement of network synchronizability. We also testify synchronous properties of the system by analysing the largest Lyapunov exponents of the system.     

Does the eigenratio synchronizability of λ2/λN represent the a complex network？

In the study of complex networks, it is commonly believed that the eigenratio λ2/λN of the Laplacian matrix of a network represents the network synchronizability, especially for symmetric networks. This paper gives two counterexamples to show that this is not true for the case where the network has a disconnected synchronized region. Consequently, a simple answer is presented to the question of when the eigenratio λ2/λN does represent the network synchronizability.     

Does the eigenratio λ₂/λ_N represent the synchronizability of a complex network?

In the study of complex networks,it is commonly believed that the eigenratio λ2/λ N of the Laplacian matrix of a network represents the network synchronizability,especially for symmetric networks.This paper gives two counterexamples to show that this is not true for the case where the network has a disconnected synchronized region.Consequently,a simple answer is presented to the question of when the eigenratio λ2/λ N does represent the network synchronizability.     

Phase Effects of Long-Wavelength Rayleigh–Taylor Instability on the Thin Shell

Taking the long-wavelength Rayleigh-Taylor instability(RTI) on the thin shell of inertial confinement fusion as the research object,a linear analytical model is presented to study the phase effects that are caused by the phase difference of single-mode perturbations on the two interfaces.Its accuracy is tested by numerical simulations.By analyzing the characteristic of this model,it is found that the phase difference does not change the basic RTI structure(only one spike and one bubble in a period).However,the symmetry of the spike and bubble is destroyed,which has non-expected influences on the convergent motion of ICF targets.Meanwhile,the phenomenon that the distance between spikes and bubbles along the vertical direction of acceleration differs by π is demonstrated.It is also shown that when the phase difference is large,the temporal evolution of the RTI is more serious and the thin target is easier to tend to break.     

Does the eigenratio λ2/λN represent the synchronizability of a complex network?

In the study of complex networks,it is commonly believed that the eigenratio λ2/λ N of the Laplacian matrix of a network represents the network synchronizability,especially for symmetric networks.This paper gives two counterexamples to show that this is not true for the case where the network has a disconnected synchronized region.Consequently,a simple answer is presented to the question of when the eigenratio λ2/λ N does represent the network synchronizability.     

The electron transport characters in a nanostructure with the periodic magnetic-electric barriers

This paper detailedly studies the transmission probability, the spin polarization and the conductance of the ballistic electron in a nanostructure with the periodic magnetic-electric barriers. These observable quantities are found to be strongly dependent not only on the magnetic configuration, the incident electron energy and the incident wave vector, but also on the number of the periodic magnetic-electric barriers. The transmission coefficient and the spin polarization show a periodic pattern with the increase of the separation between two adjacent magnetic fields, and the resonance splitting increases as the number of periods increases. Surprisingly, it is found that a polarization can be achieved by spin-dependent resonant tunnelling in this structure, although the average magnetic field of the structure is zero.     

Steady-state sound field in enclosures

The classical normal-mode theory expresses the steady-state soundfield in an enclosure produced by a sound source as a series of normal modes ofvibration.Experimental facts are not often explained by this theory,and it wasconjectured that the normal-mode expression is not the complete solution ofthe wave equation in the enclosure,but only the reverberant part of it,and thereshould be an additional term representing the direct spherical radiation to makethe solution complete.The problem is examined by critically reviewing the de-rivation of the normal-mode expression,and by theoretical analysis of thesteady-state sound field in the room and experimental measurements therein.The conjecture is thus confirmed,and it is definitely shown that the sound fieldshould contain the direct wave as well as the standing waves(normal modes)formed by the confinement of the boundary surfaces.Relevant mathematicalexpressions are derived.     

Comparison of Phase Synchronizability of Several Regular Networks for Non-Phase-Coherent Attractors

Though applying master stability function method to analyse network complete synchronization has been well studied in chaotic dynamical systems, it does not work well for phase synchronization. Moreover, it is difficult to identify phase synchronization with the angle of rotation for non-phase-coherent attractors. We employ the recurrences plot method to detect phase synchronization for several regular networks with non-phase-coherent attractors. It is found that the coupling strength μ is different for different coupled networks. The coupling strength μ is reduced as completed coupled network scale enlarges, the coupling strength μ of star coupled network is irrelevant to network scale, and these two regular networks are easier to achieve phase synchronization. However, for ring and chain coupled networks, the larger the phase synchronization couple strength μ is, the larger the network scale is, and it is more difficult to achieve phase synchronization. For same scale network, once ring coupled structure becomes a chain coupled structure, phase synchronization becomes much more difficult.     

Multi-scaling Networks from Vertex Intrinsic Fitness

Defining and detecting the community structure is an important topic on exploring the complex networks. Previous works were mostly based on the so-called modularity method, in which vertices that interconnect to each other form modules in the network, In many real-world networks, however, vertices are grouped not by their connectivity but by their functions. To demonstrate this idea, we propose a new kind of network, in which the vertices are catalogued into several types and are assigned intrinsic fitness, Each type of vertices may satisfy a different fitness distribution. It is found that the whole network exhibits a multi-scaling degree distribution. The clustering coefficients of the subnetworks are modified by the interlinks between vertices in the subnetworks.     

Social influence in small—world networks

We report on our numerical studies of the Axelrod model for social influence in small-world networks.Our simulation results show that the topology of the network has a crucial effect on the evolution of cultures .As the randomness of the network increases,the system undergoes a transition from a highly fragmented phase to a uniform phase.we also find that the power-law distribution at the transition point,reported by castellano et al,is not a critical phenomenon;it exists not only at the onset of transition but also for almost any control parameters,All these power-law distributions are stable against pertubations.A mean-field theory is developed to explain these phenomena.     

Optimal network structure to induce the maximal small-world effect

In this paper, the general efficiency, which is the average of the global efficiency and the local efficiency, is defined to measure the communication efficiency of a network. The increasing ratio of the general efficiency of a small-world network relative to that of the corresponding regular network is used to measure the small-world effect quantitatively. The more considerable the small-world effect, the higher the general efficiency of a network with a certain cost is. It is shown that the small-world effect increases monotonically with the increase of the vertex number. The optimal rewiring probability to induce the best small-world effect is approximately 0.02 and the optimal average connection probability decreases monotonically with the increase of the vertex number. Therefore, the optimal network structure to induce the maximal small-world effect is the structure with the large vertex number （〉 500）, the small rewiring probability （≈0.02） and the small average connection probability （〈 0.1）. Many previous research results support our results.