Zhong-Qian Fu

Efficient routing on complex networks

We propose a 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 efficient path, which considers the possible congestion in the nodes along actual paths. Since the nodes with the largest degree are very susceptible to traffic congestion, an effective way to improve traffic and control congestion, as our strategy, can be redistributing traffic load in central nodes to other noncentral 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.

Collective synchronization induced by epidemic dynamics on complex networks with communities.

Much recent empirical evidence shows that community structure is ubiquitous in the real-world networks. In this paper 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 Susceptive-Infected-Recovery-Susceptive (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 Qc approximately or equal to 0.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.

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, Pq(τ), for both byte and packet flows, show scaling property as . The scaling functions for both byte and packet flows obey the same stretching exponential form, f(x)=Aexp (-Bxβ), with β≈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.

Hierarchical organization of brain functional networks during visual tasks

The functional network of the brain is known to demonstrate modular structure over different hierarchical scales. In this paper, we systematically investigated the hierarchical modular organizations of the brain functional networks that are derived from the extent of phase synchronization among high-resolution EEG time series during a visual task. In particular, we compare the modular structure of the functional network from EEG channels with that of the anatomical parcellation of the brain cortex. Our results show that the modular architectures of brain functional networks correspond well to those from the anatomical structures over different levels of hierarchy. Most importantly, we find that the consistency between the modular structures of the functional network and the anatomical network becomes more pronounced in terms of vision, sensory, vision-temporal, motor cortices during the visual task, which implies that the strong modularity in these areas forms the functional basis for the visual task. The structure-function relationship further reveals that the phase synchronization of EEG time series in the same anatomical group is much stronger than that of EEG time series from different anatomical groups during the task and that the hierarchical organization of functional brain network may be a consequence of functional segmentation of the brain cortex.

Self-organized emergence of navigability on small-world networks

We study the origin of navigability in small-world (SW) networks and propose a general scheme for navigating SW networks. We find that navigability can naturally emerge from self-organization in the absence of prior knowledge about the 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 SW networks, in which long-range connections play an important role. Numerical simulations further demonstrate that a high cluster coefficient and a 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.

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

In this Letter, 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.

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.

Synchronization-based approach for detecting functional activation of brain

In this paper, we investigate a synchronization-based, data-driven clustering approach for the analysis of functional magnetic resonance imaging (fMRI) data, and specifically for detecting functional activation from fMRI data. We first define a new measure of similarity between all pairs of data points (i.e., time series of voxels) integrating both complete phase synchronization and amplitude correlation. These pairwise similarities are taken as the coupling between a set of Kuramoto oscillators, which in turn evolve according to a nearest-neighbor rule. As the network evolves, similar data points naturally synchronize with each other, and distinct clusters will emerge. The clustering behavior of the interaction network of the coupled oscillators, therefore, mirrors the clustering property of the original multiple time series. The clustered regions whose cross-correlation coefficients are much greater than other regions are considered as the functionally activated brain regions. The analysis of fMRI data in auditory and visual areas shows that the recognized brain functional activations are in complete correspondence with those from the general linear model of statistical parametric mapping, but with a significantly lower time complexity. We further compare our results with those from traditional K-means approach, and find that our new clustering approach can distinguish between different response patterns more accurately and efficiently than the K-means approach, and therefore more suitable in detecting functional activation from event-related experimental fMRI data.

Link prediction in evolving networks based on popularity of nodes

Link prediction aims to uncover the underlying relationship behind networks, which could be utilized to predict missing edges or identify the spurious edges. The key issue of link prediction is to estimate the likelihood of potential links in networks. Most classical static-structure based methods ignore the temporal aspects of networks, limited by the time-varying features, such approaches perform poorly in evolving networks. In this paper, we propose a hypothesis that the ability of each node to attract links depends not only on its structural importance, but also on its current popularity (activeness), since active nodes have much more probability to attract future links. Then a novel approach named popularity based structural perturbation method (PBSPM) and its fast algorithm are proposed to characterize the likelihood of an edge from both existing connectivity structure and current popularity of its two endpoints. Experiments on six evolving networks show that the proposed methods outperform state-of-the-art methods in accuracy and robustness. Besides, visual results and statistical analysis reveal that the proposed methods are inclined to predict future edges between active nodes, rather than edges between inactive nodes.

Analytical connection between thresholds and immunization strategies of SIS model in random networks

Devising effective strategies for hindering the propagation of viruses and protecting the population against epidemics is critical for public security and health. Despite a number of studies based on the susceptible-infected-susceptible (SIS) model devoted to this topic, we still lack a general framework to compare different immunization strategies in completely random networks. Here, we address this problem by suggesting a novel method based on heterogeneous mean-field theory for the SIS model. Our method builds the relationship between the thresholds and different immunization strategies in completely random networks. Besides, we provide an analytical argument that the targeted large-degree strategy achieves the best performance in random networks with arbitrary degree distribution. Moreover, the experimental results demonstrate the effectiveness of the proposed method in both artificial and real-world networks.