Search

In this paper, a distributed Kalman filtering (DKF) algorithm is proposed based on a diffusion strategy, which is used to track an unknown signal process in sensor networks cooperatively. Unlike the centralized algorithms, no fusion center is need here, which implies that the DKF algorithm is more robust and scalable. Moreover, the stability of the DKF algorithm is established under non-independent and non-stationary signal conditions. The cooperative information condition used in the paper shows that even if any sensor cannot track the unknown signal individually, the DKF algorithm can be utilized to fulfill the estimation task in a cooperative way. Finally, we illustrate the cooperative property of the DKF algorithm by using a simulation example.

The Friedkin-Johnsen (FJ) model introduces prejudice into the opinion evolution and has been successfully validated in many practical scenarios; however, due to its weighted average mechanism, only one prejudiced agent can always guide all unprejudiced agents synchronizing to its prejudice under the connected influence network, which may not be in line with some social realities. To fundamentally address the limitation of the weighted average mechanism, a weighted-median opinion dynamics has been recently proposed; however, its theoretical analysis is challenging due to its nonlinear nature. This paper studies the weighted-median opinion dynamics with prejudice, and obtains the convergence and convergence rate when all agents have prejudice, and a necessary and sufficient condition for asymptotic consensus when a portion of agents have prejudice. These results are the first time to analyze the discrete-time and synchronous opinion dynamics with the weighted median mechanism, and address the phenomenon of the FJ model that connectivity leads to consensus when a few agents with the same prejudice join in an unprejudiced group.

We experimentally investigated the performance of split nonlinearity compensation schemes for single and multi-channel WDM systems. We show that split NLC SNR gains of more than 0.4 dB at 5540 km can be achieved compared to transmitter- or receiver-side DBP alone when signal-ASE beating limits transmission performance., Comment: 2024 European Conference on Optical Communication (ECOC)

The deep financial turmoil in China caused by the COVID-19 pandemic has exacerbated fiscal shocks and soaring public debt levels, which raises concerns about the stability and sustainability of China's public debt growth in the future. This paper employs the Markov regime-switching model with time-varying transition probability (TVTP-MS) to investigate the growth pattern of China's public debt and the impact of financial variables such as credit, house prices and stock prices on the growth of public debt. We identify two distinct regimes of China's public debt, i.e., the surge regime with high growth rate and high volatility and the steady regime with low growth rate and low volatility. The main results are twofold. On the one hand, an increase in the growth rate of the financial variables helps to moderate the growth rate of public debt, whereas the effects differ between the two regimes. More specifically, the impacts of credit and house prices are significant in the surge regime, whereas stock prices affect public debt growth significantly in the steady regime. On the other hand, a higher growth rate of financial variables also increases the probability of public debt either staying in or switching to the steady regime. These findings highlight the necessity of aligning financial adjustments with the prevailing public debt regime when developing sustainable fiscal policies.

Based on the quarterly data from 26 advanced economies (AEs) and 18 emerging market economies (EMs) over the past two decades, this paper estimates the short- and medium-term impacts of financial cycles on the duration and amplitude of public debt cycles. The results indicate that public debt expansions are larger than their contractions in duration and amplitude, aligning with the "deficit bias hypothesis" and being more pronounced in EMs than in AEs. The impacts of various financial cycles are different. Specifically, credit cycles in EMs significantly impact the duration and amplitude of public debt cycles. Notably, short- and medium-term credit booms in EMs shorten the duration of public debt contractions and reduce the amplitude. Fast credit growth in AEs prolongs the duration of public debt expansions and increases the amplitude. However, credit cycles in AEs show no significant impact. For house price cycles, the overall impact is stronger in EMs than in AEs, differing between short- and medium-term cycles. Finally, the impact of equity price cycles is significant in the short term, but not in the medium term. Equity price busts are more likely to prolong the expansion of public debt in EMs while increasing the amplitude of public debt contractions in AEs. Uncovering the impacts of multiple financial cycles on public debt cycles provides implications for better debt policies under different financial conditions.

We generate and transmit 75-GHz-bandwidth OFDM signals over the air using three mutually frequency-locked lasers, achieving minimal frequency gap between the wireless W and D bands using optical-assisted approaches, resulting in 173.5 Gb/s detected capacity., Comment: 3 pages, 2 figures, conference submission

Turing's model has been widely used to explain how simple, uniform structures can give rise to complex, patterned structures during the development of organisms. However, it is very hard to establish rigorous theoretical results for the dynamic evolution behavior of Turing's model since it is described by nonlinear partial differential equations. We focus on controllability of Turing's model by linearization and spatial discretization. This linearized model is a networked system whose agents are second order linear systems and these agents interact with each other by Laplacian dynamics on a graph. A control signal can be added to agents of choice. Under mild conditions on the parameters of the linearized Turing's model, we prove the equivalence between controllability of the linearized Turing's model and controllability of a Laplace dynamic system with agents of first order dynamics. When the graph is a grid graph or a cylinder grid graph, we then give precisely the minimal number of control nodes and a corresponding control node set such that the Laplace dynamic systems on these graphs with agents of first order dynamics are controllable., Comment: 13 pages, 4 figures, submitted to automatica

In this paper, we consider the distributed filtering problem over sensor networks such that all sensors cooperatively track unknown time-varying parameters by using local information. A distributed forgetting factor least squares (FFLS) algorithm is proposed by minimizing a local cost function formulated as a linear combination of accumulative estimation error. Stability analysis of the algorithm is provided under a cooperative excitation condition which contains spatial union information to reflect the cooperative effect of all sensors. Furthermore, we generalize theoretical results to the case of Markovian switching directed graphs. The main difficulties of theoretical analysis lie in how to analyze properties of the product of non-independent and non-stationary random matrices. Some techniques such as stability theory, algebraic graph theory and Markov chain theory are employed to deal with the above issue. Our theoretical results are obtained without relying on the independency or stationarity assumptions of regression vectors which are commonly used in existing literature., Comment: 12 pages

In this paper, we study the distributed adaptive estimation problem of continuous-time stochastic dynamic systems over sensor networks where each agent can only communicate with its local neighbors. A distributed least squares (LS) algorithm based on diffusion strategy is proposed such that the sensors can cooperatively estimate the unknown time-invariant parameter vector from continuous-time noisy signals. By using the martingal estimation theory and Ito formula, we provide upper bounds for the estimation error of the proposed distributed LS algorithm, and further obtain the convergence results under a cooperative excitation condition. Compared with the existing results, our results are established without using the boundedness or persistent excitation (PE) conditions of regression signals. We provide simulation examples to show that multiple sensors can cooperatively accomplish the estimation task even if any individual can not.

This paper studies a system security problem in the context of observability based on a two-person non-cooperative infinitely repeated game. Both the attacker and the defender have means to modify the dimension of the unobservable subspace, which is set as the value function. Utilizing tools from geometric control, we construct the best response sets considering one-step and two-step optimality respectively to maximize or minimize the value function. We find that the best response sets are not single-valued maps, resulting in a variety of game outcomes. In addition, we establish a necessary and sufficient condition for Nash equilibrium. The game analysis reveals that the defender plays a pivotal role in steering the game towards equilibrium, while the attacker can disrupt the equilibrium by sacrificing immediate gains.

This paper studies a dynamical system that models the free recall dynamics of working memory. This model is a modular neural network with n modules, named hypercolumns, and each module consists of m minicolumns. Under mild conditions on the connection weights between minicolumns, we investigate the long-term evolution behavior of the model, namely the existence and stability of equilibriums and limit cycles. We also give a critical value in which Hopf bifurcation happens. Finally, we give a sufficient condition under which this model has a globally asymptotically stable equilibrium with synchronized minicolumn states in each hypercolumn, which implies that in this case recalling is impossible. Numerical simulations are provided to illustrate our theoretical results. A numerical example we give suggests that patterns can be stored in not only equilibriums and limit cycles, but also strange attractors (or chaos).

In this paper, a distributed stochastic gradient (SG) algorithm is proposed where the estimators are aimed to collectively estimate an unknown time-invariant parameter from a set of noisy measurements obtained by distributed sensors. The proposed distributed SG algorithm combines the consensus strategy of the estimation of neighbors with the diffusion of regression vectors. A cooperative excitation condition is introduced, under which the convergence of the distributed SG algorithm can be obtained without relying on the independency and stationarity assumptions of regression vectors which are commonly used in existing literature. Furthermore, the convergence rate of the algorithm can be established. Finally, we show that all sensors can cooperate to fulfill the estimation task even though any individual sensor can not by a simulation example., Comment: 14 pages, 2 figures, submitted to IEEE Transactions on Neural Networks and Learning Systems

This paper considers the distributed sparse identification problem over wireless sensor networks such that all sensors cooperatively estimate the unknown sparse parameter vector of stochastic dynamic systems by using the local information from neighbors. A distributed sparse least squares algorithm is proposed by minimizing a local information criterion formulated as a linear combination of accumulative local estimation error and L_1-regularization term. The upper bounds of the estimation error and the regret of the adaptive predictor of the proposed algorithm are presented. Furthermore, by designing a suitable adaptive weighting coefficient based on the local observation data, the set convergence of zero elements with a finite number of observations is obtained under a cooperative non-persistent excitation condition. It is shown that the proposed distributed algorithm can work well in a cooperative way even though none of the individual sensors can fulfill the estimation task. Our theoretical results are obtained without relying on the independency assumptions of regression signals that have been commonly used in the existing literature. Thus, our results are expected to be applied to stochastic feedback systems. Finally, the numerical simulations are provided to demonstrate the effectiveness of our theoretical results., Comment: 15 pages, 2 figures, submitted to Automatica