Optimal navigation for characterizing the role of the nodes in complex networks

In this paper, we explore how the approach of optimal navigation (Cajueiro (2009) [33]) can be used to evaluate the centrality of a node and to characterize its role in a network. Using the subway network of Boston and the London rapid transit rail as proxies for complex networks, we show that the centrality measures inherited from the approach of optimal navigation may be considered if one desires to evaluate the centrality of the nodes using other pieces of information beyond the geometric properties of the network. Furthermore, evaluating the correlations between these inherited measures and classical measures of centralities such as the degree of a node and the characteristic path length of a node, we have found two classes of results. While for the London rapid transit rail, these inherited measures can be easily explained by these classical measures of centrality, for the Boston underground transportation system we have found nontrivial results.     

Event-based state estimation for a class of complex networks with time-varying delays: A comparison principle approach

The paper is concerned with the state estimation problem for a class of time-delayed complex networks with event-triggering communication protocol. A novel event generator function, which is dependent not only on the measurement output but also on a predefined positive constant, is proposed with hope to reduce the communication burden. A new concept of exponentially ultimate boundedness is provided to quantify the estimation performance. By means of the comparison principle, some sufficient conditions are obtained to guarantee that the estimation error is exponentially ultimately bounded, and then the estimator gains are obtained in terms of the solution of certain matrix inequalities. Furthermore, a rigorous proof is proposed to show that the designed triggering condition is free of the Zeno behavior. Finally, a numerical example is given to illustrate the effectiveness of the proposed event-based estimator.     

Effects of delayed recovery and nonuniform transmission on the spreading of diseases in complex networks

We investigate the effects of delaying the time to recovery (delayed recovery) and of nonuniform transmission on the propagation of diseases on structured populations. Through a mean-field approximation and large-scale numerical simulations, we find that postponing the transition from the infectious to the recovered states can largely reduce the epidemic threshold, therefore promoting the outbreak of epidemics. On the other hand, if we consider nonuniform transmission among individuals, the epidemic threshold increases, thus inhibiting the spreading process. When both mechanisms are at work, the latter might prevail, hence resulting in an increase of the epidemic threshold with respect to the standard case, in which both ingredients are absent. Our findings are of interest for a better understanding of how diseases propagate on structured populations and to a further design of efficient immunization strategies.     

Dynamic discrimination of convergence of the LMS time delay estimation in complicated noisy environments

For nonstationary signals, time constant can no longer represent the actual convergence performance of the adaptive delay estimation. A scheme is thus proposed for dynamically discriminating the convergence of the LMS time delay estimation to get an optimal estimate even under complicated noisy environments. Based on the fact that the filter output gets orthogonal to the estimation error only when an adaptive filter operates in its optimal condition, an approximate orthogonality constraint is derived for discriminating the practical adaptation’s convergence. This discrimination condition, which is obtained through the estimated mean-square values of related available variables at each iteration, can be updated in the adaptation process according to the varying statistic characteristics of observed signals. Thus, it can dynamically evaluate the quality of the adaptive solution and end the iteration opportunely. Simulation results are also included to demonstrate its effectiveness to give exact convergence results in both stationary and nonstationary cases.