arXiv subjects

Zhong-Qian Fu

Publications and source records attributed to Zhong-Qian Fu.

14 recordsLinked to original sources

arXiv2015

Enhancing speed of pinning synchronizability: low-degree nodes with high feedback gains

Controlling complex networks is of paramount importance in science and engineering. Despite recent efforts to improve controllability and synchronous strength, little attention has been paid to the speed of pinning synchronizability (rate of convergence in pinning control) and the corresponding pinning node selection. To address this issue, we propose a hypothesis to restrict the control cost, then build a linear matrix inequality related to the speed of pinning controllability. By solving the inequality, we obtain both the speed of pinning controllability and optimal control strength (feedback gains in pinning control) for all nodes. Interestingly, some low-degree nodes are able to achieve large feedback gains, which suggests that they have high influence on controlling system. In addition, when choosing nodes with high feedback gains as pinning nodes, the controlling speed of real systems is remarkably enhanced compared to that of traditional large-degree and large-betweenness selections. Thus, the proposed approach provides a novel way to investigate the speed of pinning controllability and can evoke other effective heuristic pinning node selections for large-scale systems.

physics.soc-ph↗

arXiv2015

Abnormal Synchronizing Path of Delay-coupled Chaotic Oscillators on the Edge of Stability

In this paper, the transition of synchronizing path of delay-coupled chaotic oscillators in a scale-free network is highlighted. Mainly, through the critical transmission delay makes chaotic oscillators be coupled on the edge of stability, we find that the transition of synchronizing path is \emph{abnormal}, which is characterized by the following evidences: (a) synchronization process starts with low-degree rather than high-degree ones; (b) the high-degree nodes don't undertake the role of hub; (c) the synchronized subnetworks show a poor small-world property as a result of hubs absence; (d) the clustering synchronization behavior emerges even community structure is absent in the scale-free network. This abnormal synchronizing path suggests that the diverse synchronization behaviors occur in the same topology, which implies that the relationship between dynamics and structure of network is much more complicated than the common sense that the structure is the foundation of dynamics. Moreover, it also reveals the potential connection from the transition of synchronization behavior to disorder in real complex networks, e.g. Alzheimer disease.

physics.soc-ph↗

arXiv2014

Community structure revealed by phase locking

Community structure can naturally emerge in paths to synchronization, and scratching it from the paths is a tough issue that accounts for the diverse dynamics of synchronization. In this paper, with assumption that the synchronization on complex networks is made up of local and collective processes, we proposed a scheme to lock the local synchronization (phase locking) at a stable state meanwhile suppress the collective synchronization based on Kuramoto model. Through this scheme, the network dynamics only contains the local synchronization, which suggests that the nodes in the same community synchronize together and these synchronization clusters well reveal the community structure of network. Furthermore, by analyzing the paths to synchronization, the relations or overlaps among different communities are also obtained. Thus, the community detection based on the scheme is performed on five real networks and the observed community structures are much more apparent than modularity-based fast algorithm. Our results not only provide a deep insight to understand the synchronization dynamics on complex network but also enlarge the research scope of community detection.

physics.soc-ph↗

arXiv2011

Hierarchical organization of brain functional network during visual task

In this paper, the brain functional networks derived from high-resolution synchronous EEG time series during visual task are generated by calculating the phase synchronization among the time series. The hierarchical modular organizations of these networks are systematically investigated by the fast Girvan-Newman algorithm. At the same time, the spatially adjacent electrodes (corresponding to EEG channels) are clustered into functional groups based on anatomical parcellation of brain cortex, and this clustering information are compared to that of the functional network. The results show that the modular architectures of brain functional network are in coincidence with that from the anatomical structures over different levels of hierarchy, which suggests that population of neurons performing the same function excite and inhibit in identical rhythms. The structure-function relationship further reveals that the correlations among EEG time series in the same functional group are much stronger than those in different ones and that the hierarchical organization of brain functional network may be a consequence of functional segmentation of brain cortex.

physics.bio-ph↗

arXiv2010

Self-organized Emergence of Navigability on Small-World Networks

This paper mainly investigates why small-world networks are navigable and how to navigate small-world networks. We find that the navigability can naturally emerge from self-organization in the absence of prior knowledge about underlying reference frames of networks. Through a process of information exchange and accumulation on networks, a hidden metric space for navigation on networks is constructed. Navigation based on distances between vertices in the hidden metric space can efficiently deliver messages on small-world networks, in which long range connections play an important role. Numerical simulations further suggest that high cluster coefficient and low diameter are both necessary for navigability. These interesting results provide profound insights into scalable routing on the Internet due to its distributed and localized requirements.

cs.SI↗

arXiv2009

Scaling and memory in recurrence intervals of Internet traffic

By studying the statistics of recurrence intervals, $τ$, between volatilities of Internet traffic rate changes exceeding a certain threshold $q$, we find that the probability distribution functions, $P_{q}(τ)$, for both byte and packet flows, show scaling property as $P_{q}(τ)=\frac{1}{\overlineτ}f(\fracτ{\overlineτ})$. The scaling functions for both byte and packet flows obeys the same stretching exponential form, $f(x)=A\texttt{exp}(-Bx^β)$, with $β\approx 0.45$. In addition, we detect a strong memory effect that a short (or long) recurrence interval tends to be followed by another short (or long) one. The detrended fluctuation analysis further demonstrates the presence of long-term correlation in recurrence intervals.

physics.data-an↗

arXiv2007

Collective synchronization induced by epidemic dynamics on complex networks with communities

Much recent empirical evidence shows that \textit{community structure} is ubiquitous in the real-world networks. In this Letter, we propose a growth model to create scale-free networks with the tunable strength (noted by $Q$) of community structure and investigate the influence of community strength upon the collective synchronization induced by SIRS epidemiological process. Global and local synchronizability of the system is studied by means of an order parameter and the relevant finite-size scaling analysis is provided. The numerical results show that, a phase transition occurs at $Q_c\simeq0.835$ from global synchronization to desynchronization and the local synchronization is weakened in a range of intermediately large $Q$. Moreover, we study the impact of mean degree $ $ upon synchronization on scale-free networks.

physics.data-an↗

arXiv2006

Scaling behavior of an artificial traffic model on scale-free networks

In this article, we investigate an artificial traffic model on scale-free networks. Instead of using the routing strategy of the shortest path, a generalized routing algorithm is introduced to improve the transportation throughput, which is measured by the value of the critical point disjoining the free-flow phase and the congested phase. By using the detrended fluctuation analysis, we found that the traffic rate fluctuation near the critical point exhibits the $1/f$-type scaling in the power spectrum. The simulation results agree very well with the empirical data, thus the present model may contribute to the understanding of the underlying mechanism of network traffics.

physics.soc-ph↗

arXiv2005

Efficient routing on complex networks

In this letter, we propose a new routing strategy to improve the transportation efficiency on complex networks. Instead of using the routing strategy for shortest path, we give a generalized routing algorithm to find the so-called {\it efficient path}, which considers the possible congestion in the nodes along actual paths. Since the nodes with largest degree are very susceptible to traffic congestion, an effective way to improve traffic and control congestion, as our new strategy, can be as redistributing traffic load in central nodes to other non-central nodes. Simulation results indicate that the network capability in processing traffic is improved more than 10 times by optimizing the efficient path, which is in good agreement with the analysis.

cond-mat.dis-nn↗

arXiv2005

Epidemic dynamics on complex networks

Recently, motivated by the pioneer works that reveal the small-world effect and scale-free property of various real-life networks, many scientists devote themselves into studying complex networks. One of the ultimate goals is to understand how the topological structures of networks affect the dynamics upon them. In this paper, we give a brief review on the studies of epidemic dynamics on complex networks, including the description of classical epidemic models, the epidemic spread on small-world and scale-free networks, and network immunization. Finally, a prospect is addressed and some interesting problems are listed.

physics.soc-ph↗

arXiv2005

Simplex triangulation induced scale-free networks

We propose a simple rule that generates scale-free networks with very large clustering coefficient and very small average distance. These networks are called simplex triangulation networks(STNs) as they can be considered as a kind of network representation of simplex triangulation. We obtain the analytic results of power-law exponent $γ=2+\frac{1}{d-1}$ for $d$-dimensional STNs, and clustering coefficient $C$. We prove that the increasing tendency of average distance of STNs is a little slower than the logarithm of the number of nodes in STNs. In addition, the STNs possess hierarchical structure as $C(k)\sim k^{-1}$ when $k\gg d$ that in accord with the observations of many real-life networks.

cond-mat.stat-mech↗

arXiv2005

Random Apollonian Networks

In this letter, we propose a simple rule that generates scale-free networks with very large clustering coefficient and very small average distance. These networks are called {\bf Random Apollonian Networks}(RANs) as they can be considered as a variation of Apollonian networks. We obtain the analytic result of power-law exponent $γ=3$ and clustering coefficient $C={46/3}-36\texttt{ln}{3/2}\approx 0.74$, which agree very well with the simulation results. We prove that the increasing tendency of average distance of RAN is a little slower than the logarithm of the number of nodes in RAN. Since many real-life networks are both scale-free and small-world, RANs may perform well in mimicking the reality. The epidemic spreading process is also studied, we find that the diseases spread slower in RANs than BA networks in the early stage of SI process, indicating that the large clustering coefficient may slower the spreading velocity especially in the outbreaks.

cond-mat.dis-nn↗

arXiv2004

Epidemic spread in weighted scale-free networks

In this letter, we investigate the detailed epidemic spreading process in scale-free networks with links' weights that denote familiarity between two individuals and find that spreading velocity reaches a peak quickly then decays in a power-law form. Numerical study exhibits that the nodes with larger strength is preferential to be infected, but the hierarchical dynamics are not clearly found, which is different from the well-known result in unweighed network case. In addition, also by numerical study, we demonstrate that larger dispersion of weight of networks results in slower spreading, which indicates that epidemic spreads more quickly on unweighted scale-free networks than on weighted scale-free networks with the same condition.

cond-mat.stat-mech↗

arXiv2004

Self-Organization Induced Scale-Free Networks

What is the underlying mechanism leading to power-law degree distributions of many natural and artificial networks is still at issue. We consider that scale-free networks emerges from self-organizing process, and such a evolving model is introduced in this letter. At each time step, a new node is added to the network and connect to some existing nodes randomly, instead of "preferential attachment" introduced by Barabási and Albert, and then the new node will connect with its neighbors' neighbors at a fixed probability, which is natural to collaboration networks and social networks of acquaintance or other relations between individuals. The simulation results show that those networks generated from our model are scale-free networks with satisfactorily large clustering coefficient.

cond-mat.stat-mech↗