Minimum taxi fleet algorithm considering human spatiotemporal behaviors.

With the development of information technology, more and more travel data have provided great convenience for scholars to study the travel behavior of users. Planning user travel has increasingly attracted researchers' attention due to its great theoretical significance and practical value. In this study, we not only consider the minimum fleet size required to meet the urban travel needs but also consider the travel time and distance of the fleet. Based on the above reasons, we propose a travel scheduling solution that comprehensively considers time and space costs, namely, the Spatial-Temporal Hopcroft-Karp (STHK) algorithm. The analysis results show that the STHK algorithm not only significantly reduces the off-load time and off-load distance of the fleet travel by as much as 81% and 58% and retains the heterogeneous characteristics of human travel behavior. Our study indicates that the new planning algorithm provides the size of the fleet to meet the needs of urban travel and reduces the extra travel time and distance, thereby reducing energy consumption and reducing carbon dioxide emissions. Concurrently, the travel planning results also conform to the basic characteristics of human travel and have important theoretical significance and practical application value.

Identifying Important Nodes in Trip Networks and Investigating Their Determinants.

Describing travel patterns and identifying significant locations is a crucial area of research in transportation geography and social dynamics. Our study aims to contribute to this field by analyzing taxi trip data from Chengdu and New York City. Specifically, we investigate the probability density distribution of trip distance in each city, which enables us to construct long- and short-distance trip networks. To identify critical nodes within these networks, we employ the PageRank algorithm and categorize them using centrality and participation indices. Furthermore, we explore the factors that contribute to their influence and observe a clear hierarchical multi-centre structure in Chengdu's trip networks, while no such phenomenon is evident in New York City's. Our study provides insight into the impact of trip distance on important nodes within trip networks in both cities and serves as a reference for distinguishing between long and short taxi trips. Our findings also reveal substantial differences in network structures between the two cities, highlighting the nuanced relationship between network structure and socio-economic factors. Ultimately, our research sheds light on the underlying mechanisms shaping transportation networks in urban areas and offers valuable insights into urban planning and policy making.

Application of network link prediction in drug discovery.

BACKGROUND: Technological and research advances have produced large volumes of biomedical data. When represented as a network (graph), these data become useful for modeling entities and interactions in biological and similar complex systems. In the field of network biology and network medicine, there is a particular interest in predicting results from drug-drug, drug-disease, and protein-protein interactions to advance the speed of drug discovery. Existing data and modern computational methods allow to identify potentially beneficial and harmful interactions, and therefore, narrow drug trials ahead of actual clinical trials. Such automated data-driven investigation relies on machine learning techniques. However, traditional machine learning approaches require extensive preprocessing of the data that makes them impractical for large datasets. This study presents wide range of machine learning methods for predicting outcomes from biomedical interactions and evaluates the performance of the traditional methods with more recent network-based approaches. RESULTS: We applied a wide range of 32 different network-based machine learning models to five commonly available biomedical datasets, and evaluated their performance based on three important evaluations metrics namely AUROC, AUPR, and F1-score. We achieved this by converting link prediction problem as binary classification problem. In order to achieve this we have considered the existing links as positive example and randomly sampled negative examples from non-existant set. After experimental evaluation we found that Prone, ACT and [Formula: see text] are the top 3 best performers on all five datasets. CONCLUSIONS: This work presents a comparative evaluation of network-based machine learning algorithms for predicting network links, with applications in the prediction of drug-target and drug-drug interactions, and applied well known network-based machine learning methods. Our work is helpful in guiding researchers in the appropriate selection of machine learning methods for pharmaceutical tasks.

Simulating two-phase taxi service process by random walk theory.

City taxi service systems have been empirically studied by a number of data-driven methods. However, their underlying mechanisms are hard to understand because the present mathematical models neglect to explain a (whole) taxi service process that includes a pair of on-load phase and off-load phase. In this paper, by analyzing a large amount of taxi servicing data from a large city in China, we observe that the taxi service process shows different temporal and spatial features according to the on-load phase and off-load phase. Moreover, our correlation analysis results demonstrate the lack of dependence between the on-load phase and the off-load phase. Hence, we introduce two independent random walk models based on the Langevin equation to describe the underlying mechanism and to understand the temporal and spatial features of the taxi service process. Our study attempts to formulate the mathematical framework for simulating the taxi service process and better understanding of its underlying mechanism.

Repulsive synchronization in complex networks.

Synchronization in complex networks characterizes what happens when an ensemble of oscillators in a complex autonomous system become phase-locked. We study the Kuramoto model with a tunable phase-lag parameter α in the coupling term to determine how phase shifts influence the synchronization transition. The simulation results show that the phase frustration parameter leads to desynchronization. We find two global synchronization regions for α∈[0,2π) when the coupling is sufficiently large and detect a relatively rare network synchronization pattern in the frustration parameter near α=π. We call this frequency-locking configuration as "repulsive synchronization," because it is induced by repulsive coupling. Since the repulsive synchronization cannot be described by the usual order parameter r, the parameter frequency dispersion is introduced to detect synchronization.

Accurate detection of hierarchical communities in complex networks based on nonlinear dynamical evolution.

One of the most challenging problems in network science is to accurately detect communities at distinct hierarchical scales. Most existing methods are based on structural analysis and manipulation, which are NP-hard. We articulate an alternative, dynamical evolution-based approach to the problem. The basic principle is to computationally implement a nonlinear dynamical process on all nodes in the network with a general coupling scheme, creating a networked dynamical system. Under a proper system setting and with an adjustable control parameter, the community structure of the network would "come out" or emerge naturally from the dynamical evolution of the system. As the control parameter is systematically varied, the community hierarchies at different scales can be revealed. As a concrete example of this general principle, we exploit clustered synchronization as a dynamical mechanism through which the hierarchical community structure can be uncovered. In particular, for quite arbitrary choices of the nonlinear nodal dynamics and coupling scheme, decreasing the coupling parameter from the global synchronization regime, in which the dynamical states of all nodes are perfectly synchronized, can lead to a weaker type of synchronization organized as clusters. We demonstrate the existence of optimal choices of the coupling parameter for which the synchronization clusters encode accurate information about the hierarchical community structure of the network. We test and validate our method using a standard class of benchmark modular networks with two distinct hierarchies of communities and a number of empirical networks arising from the real world. Our method is computationally extremely efficient, eliminating completely the NP-hard difficulty associated with previous methods. The basic principle of exploiting dynamical evolution to uncover hidden community organizations at different scales represents a "game-change" type of approach to addressing the problem of community detection in complex networks.

Dual-induced multifractality in online viewing activity.

Although recent studies have found that the long-term correlations relating to the fat-tailed distribution of inter-event times exist in human activity and that these correlations indicate the presence of fractality, the property of fractality and its origin have not been analyzed. We use both detrended fluctuation analysis and multifractal detrended fluctuation analysis to analyze the time series in online viewing activity separating from Movielens and Netflix. We find long-term correlations at both the individual and communal levels and that the extent of correlation at the individual level is determined by the activity level. These long-term correlations also indicate that there is fractality in the pattern of online viewing. We first find a multifractality that results from the combined effect of the fat-tailed distribution of inter-event times (i.e., the times between successive viewing actions of individuals) and the long-term correlations in online viewing activity and verify this finding using three synthesized series. Therefore, it can be concluded that the multifractality in online viewing activity is caused by both the fat-tailed distribution of inter-event times and the long-term correlations and that this enlarges the generic property of human activity to include not just physical space but also cyberspace.

Controlling epidemic outbreak based on local dynamic infectiousness on complex networks.

Resources are limited in epidemic containment; how to optimally allocate the limited resources in suppressing the epidemic spreading has been a challenging problem. To find an effective resource allocation strategy, we take the infectiousness of each infected node into consideration. By studying the interplay between the resource allocation and epidemic spreading, we find that the spreading dynamics of epidemic is affected by the preferential resource allocation. There are double phase transitions of the fraction of infected nodes, which are different from the classical epidemic model. More importantly, we find that the preferential resource allocation has double-edged sword effects on the disease spreading. When there is a small transmission rate, the infected fraction at the steady state decreases with the increment of degree of resource allocation preference, which indicates that resources of the healthy nodes should be allocated preferentially to the high infectious nodes to constrain the disease spreading. Moreover, when there is a large transmission rate, the fraction of infected nodes at the steady state increases with the increment of the degree of the preference, but the resource allocation is determined by the stage of epidemic spreading. Namely, in the early stage of the disease spreading, resources should be allocated preferentially to the high infectious nodes similar to the case of a small transmission rate. While after the early stage, resources should be allocated to the low infectious nodes. Based on the findings, we propose a simple resource allocation strategy that can adaptively change with the current fraction of infected nodes and the disease can be suppressed to the most extent under the proposed strategy.

Non-Markovian character in human mobility: Online and offline.

The dynamics of human mobility characterizes the trajectories that humans follow during their daily activities and is the foundation of processes from epidemic spreading to traffic prediction and information recommendation. In this paper, we investigate a massive data set of human activity, including both online behavior of browsing websites and offline one of visiting towers based mobile terminations. The non-Markovian character observed from both online and offline cases is suggested by the scaling law in the distribution of dwelling time at individual and collective levels, respectively. Furthermore, we argue that the lower entropy and higher predictability in human mobility for both online and offline cases may originate from this non-Markovian character. However, the distributions of individual entropy and predictability show the different degrees of non-Markovian character between online and offline cases. To account for non-Markovian character in human mobility, we apply a protype model with three basic ingredients, namely, preferential return, inertial effect, and exploration to reproduce the dynamic process of online and offline human mobilities. The simulations show that the model has an ability to obtain characters much closer to empirical observations.

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.

Equivalence and its invalidation between non-Markovian and Markovian spreading dynamics on complex networks.

Epidemic spreading processes in the real world depend on human behaviors and, consequently, are typically non-Markovian in that the key events underlying the spreading dynamics cannot be described as a Poisson random process and the corresponding event time is not exponentially distributed. In contrast to Markovian type of spreading dynamics for which mathematical theories have been well developed, we lack a comprehensive framework to analyze and fully understand non-Markovian spreading processes. Here we develop a mean-field theory to address this challenge, and demonstrate that the theory enables accurate prediction of both the transient phase and the steady states of non-Markovian susceptible-infected-susceptible spreading dynamics on synthetic and empirical networks. We further find that the existence of equivalence between non-Markovian and Markovian spreading depends on a specific edge activation mechanism. In particular, when temporal correlations are absent on active edges, the equivalence can be expected; otherwise, an exact equivalence no longer holds.

Publisher Correction: Equivalence and its invalidation between non-Markovian and Markovian spreading dynamics on complex networks.

An amendment to this paper has been published and can be accessed via a link at the top of the paper.

Synergistic interactions promote behavior spreading and alter phase transitions on multiplex networks.

Synergistic interactions are ubiquitous in the real world. Recent studies have revealed that, for a single-layer network, synergy can enhance spreading and even induce an explosive contagion. There is at the present a growing interest in behavior spreading dynamics on multiplex networks. What is the role of synergistic interactions in behavior spreading in such networked systems? To address this question, we articulate a synergistic behavior spreading model on a double layer network, where the key manifestation of the synergistic interactions is that the adoption of one behavior by a node in one layer enhances its probability of adopting the behavior in the other layer. A general result is that synergistic interactions can greatly enhance the spreading of the behaviors in both layers. A remarkable phenomenon is that the interactions can alter the nature of the phase transition associated with behavior adoption or spreading dynamics. In particular, depending on the transmission rate of one behavior in a network layer, synergistic interactions can lead to a discontinuous (first-order) or a continuous (second-order) transition in the adoption scope of the other behavior with respect to its transmission rate. A surprising two-stage spreading process can arise: due to synergy, nodes having adopted one behavior in one layer adopt the other behavior in the other layer and then prompt the remaining nodes in this layer to quickly adopt the behavior. Analytically, we develop an edge-based compartmental theory and perform a bifurcation analysis to fully understand, in the weak synergistic interaction regime where the dynamical correlation between the network layers is negligible, the role of the interactions in promoting the social behavioral spreading dynamics in the whole system.

Scale invariance of human electroencephalogram signals in sleep.

In this paper, we investigate the dynamical properties of electroencephalogram (EEG) signals of humans in sleep. By using a modified random walk method, we demonstrate that scale-invariance is embedded in EEG signals after a detrending procedure is applied. Furthermore, we study the dynamical evolution of the probability density function (PDF) of the detrended EEG signals by nonextensive statistical modeling. It displays a scale-independent property, which is markedly different from the usual scale-dependent PDF evolution and cannot be described by the Fokker-Planck equation.

Information filtering based on corrected redundancy-eliminating mass diffusion.

Methods used in information filtering and recommendation often rely on quantifying the similarity between objects or users. The used similarity metrics often suffer from similarity redundancies arising from correlations between objects' attributes. Based on an unweighted undirected object-user bipartite network, we propose a Corrected Redundancy-Eliminating similarity index (CRE) which is based on a spreading process on the network. Extensive experiments on three benchmark data sets-Movilens, Netflix and Amazon-show that when used in recommendation, the CRE yields significant improvements in terms of recommendation accuracy and diversity. A detailed analysis is presented to unveil the origins of the observed differences between the CRE and mainstream similarity indices.

Social contagions on time-varying community networks.

Time-varying community structures exist widely in real-world networks. However, previous studies on the dynamics of spreading seldom took this characteristic into account, especially those on social contagions. To study the effects of time-varying community structures on social contagions, we propose a non-Markovian social contagion model on time-varying community networks based on the activity-driven network model. A mean-field theory is developed to analyze the proposed model. Through theoretical analyses and numerical simulations, two hierarchical features of the behavior adoption processes are found. That is, when community strength is relatively large, the behavior can easily spread in one of the communities, while in the other community the spreading only occurs at higher behavioral information transmission rates. Meanwhile, in spatial-temporal evolution processes, hierarchical orders are observed for the behavior adoption. Moreover, under different information transmission rates, three distinctive patterns are demonstrated in the change of the whole network's final adoption proportion along with the growing community strength. Within a suitable range of transmission rate, an optimal community strength can be found that can maximize the final adoption proportion. Finally, compared with the average activity potential, the promoting or inhibiting of social contagions is much more influenced by the number of edges generated by active nodes.

Suppressing disease spreading by using information diffusion on multiplex networks.

Although there is always an interplay between the dynamics of information diffusion and disease spreading, the empirical research on the systemic coevolution mechanisms connecting these two spreading dynamics is still lacking. Here we investigate the coevolution mechanisms and dynamics between information and disease spreading by utilizing real data and a proposed spreading model on multiplex network. Our empirical analysis finds asymmetrical interactions between the information and disease spreading dynamics. Our results obtained from both the theoretical framework and extensive stochastic numerical simulations suggest that an information outbreak can be triggered in a communication network by its own spreading dynamics or by a disease outbreak on a contact network, but that the disease threshold is not affected by information spreading. Our key finding is that there is an optimal information transmission rate that markedly suppresses the disease spreading. We find that the time evolution of the dynamics in the proposed model qualitatively agrees with the real-world spreading processes at the optimal information transmission rate.

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.

Recurrence network analysis of the synchronous EEG time series in normal and epileptic brains.

We sought to analyze the dynamic properties of brain electrical activity from healthy volunteers and epilepsy patients using recurrence networks. Phase-space trajectories of synchronous electroencephalogram signals were obtained through embedding dimension in phase-space reconstruction based on the distance set of space points. The recurrence matrix calculated from phase-space trajectories was identified with the adjacency matrix of a complex network. Then, we applied measures to characterize the complex network to this recurrence network. A detailed analysis revealed the following: (1) The recurrence networks of normal brains exhibited a sparser connectivity and smaller clustering coefficient compared with that of epileptic brains; (2) the small-world property existed in both normal and epileptic brains consistent with the previous empirical studies of structural and functional brain networks; and (3) the assortative property of the recurrence network was found by computing the assortative coefficients; their values increased from normal to epileptic brain which accurately suggested the difference of the states. These universal and non-universal characteristics of recurrence networks might help clearly understand the underlying neurodynamics of the brain and provide an efficient tool for clinical diagnosis.