Searcharxiv⌕ Search

arXiv subjects

Guanrong Chen

Publications and source records attributed to Guanrong Chen.

At least 91 records · Page 5Linked to original sources

Synchronization of Networked Harmonic Oscillators via Quantized Sampled Velocity Feedback

In this technical note, we propose a practicable quantized sampled velocity data coupling protocol for synchronization of a set of harmonic oscillators. The coupling protocol is designed in a quantized way via interconnecting the velocities encoded by a uniform quantizer with a zooming parameter in either a fixed or an adjustable form over a directed communication network. We establish sufficient conditions for the networked harmonic oscillators to converge to a bounded neighborhood of the synchronized orbits with a fixed zooming parameter. We ensure the oscillators to achieve synchronization by designing the quantized coupling protocol with an adjustable zooming parameter. Finally, we show two numerical examples to illustrate the effectiveness of the proposed coupling protocol.

math.OC↗

Dynamic Analysis of Digital Chaotic Maps via State-Mapping Networks

Chaotic dynamics is widely used to design pseudo-random number generators and for other applications such as secure communications and encryption. This paper aims to study the dynamics of discrete-time chaotic maps in the digital (i.e., finite-precision) domain. Differing from the traditional approaches treating a digital chaotic map as a black box with different explanations according to the test results of the output, the dynamical properties of such chaotic maps are first explored with a fixed-point arithmetic, using the Logistic map and the Tent map as two representative examples, from a new perspective with the corresponding state-mapping networks (SMNs). In an SMN, every possible value in the digital domain is considered as a node and the mapping relationship between any pair of nodes is a directed edge. The scale-free properties of the Logistic map's SMN are proved. The analytic results are further extended to the scenario of floating-point arithmetic and for other chaotic maps. Understanding the network structure of a chaotic map's SMN in digital computers can facilitate counteracting the undesirable degeneration of chaotic dynamics in finite-precision domains, helping also classify and improve the randomness of pseudo-random number sequences generated by iterating chaotic maps.

cs.CR↗

Controllability of Directed Heterogeneous Networked MIMO Systems

This paper studies the controllability of networked multi-input-multi-output (MIMO) systems, in which the network topology is weighted and directed, and the nodes are heterogeneous higher-dimensional linear time-invariant (LTI) dynamical systems. The primary objective is to search for controllability criteria beyond those already known for homogeneous networks. The focus is on the effects of the network topology, node dynamics, external control inputs, as well as the inner interactions on the network controllability. It is found that a network of heterogeneous systems can be controllable even if the corresponding homogeneous network topology is uncontrollable. The finding thus unravels another fundamental property that affects the network controllability---the heterogeneity of the node dynamics. A necessary and sufficient condition is derived for the controllability of heterogeneous networked MIMO LTI systems. For some typical cases, necessary and/or sufficient controllability conditions are specified and presented on the node dynamics, inner interactions, as well as the network topology.

math.OC↗

Answers to some questions about Zadeh's extension on metric spaces

This paper shows that there exists a contraction whose Zadeh's extension is not a contraction under the Skorokhod metric, answering negatively Problems 5.8 and 5.12 posted in [Jardón, Sánchez, and Sanchis, Some questions about Zadeh's extension on metric spaces, Fuzzy Sets and Systems, 2018].

math.MG↗

A Self-Learning Information Diffusion Model for Smart Social Networks

In this big data era, more and more social activities are digitized thereby becoming traceable, and thus the studies of social networks attract increasing attention from academia. It is widely believed that social networks play important role in the process of information diffusion. However, the opposite question, i.e., how does information diffusion process rebuild social networks, has been largely ignored. In this paper, we propose a new framework for understanding this reversing effect. Specifically, we first introduce a novel information diffusion model on social networks, by considering two types of individuals, i.e., smart and normal individuals, and two kinds of messages, true and false messages. Since social networks consist of human individuals, who have self-learning ability, in such a way that the trust of an individual to one of its neighbors increases (or decreases) if this individual received a true (or false) message from that neighbor. Based on such a simple self-learning mechanism, we prove that a social network can indeed become smarter, in terms of better distinguishing the true message from the false one. Moreover, we observe the emergence of social stratification based on the new model, i.e., the true messages initially posted by an individual closer to the smart one can be forwarded by more others, which is enhanced by the self-learning mechanism. We also find the crossover advantage, i.e., interconnection between two chain networks can make the related individuals possessing higher social influences, i.e., their messages can be forwarded by relatively more others. We obtained these results theoretically and validated them by simulations, which help better understand the reciprocity between social networks and information diffusion.

cs.SI↗

Approximating hidden chaotic attractors via parameter switching

In this paper, the problem of approximating hidden chaotic attractors of a general class of nonlinear systems is investigated. The Parameter Switching (PS) algorithm is utilized, which switches the control parameter within a given set of values with the initial value problem numerically solved. The PS-generated generated attractor approximates the attractor obtained by averaging the control parameter with the switched values, which represents the hidden chaotic attractor. The hidden chaotic attractors of a generalized Lorenz system and the Rabinovich-Fabrikant system are simulated for illustration

nlin.CD↗

Target Defense Against Link-Prediction-Based Attacks via Evolutionary Perturbations

In social networks, by removing some target-sensitive links, privacy protection might be achieved. However, some hidden links can still be re-observed by link prediction methods on observable networks. In this paper, the conventional link prediction method named Resource Allocation Index (RA) is adopted for privacy attacks. Several defense methods are proposed, including heuristic and evolutionary approaches, to protect targeted links from RA attacks via evolutionary perturbations. This is the first time to study privacy protection on targeted links against link-prediction-based attacks. Some links are randomly selected from the network as targeted links for experimentation. The simulation results on six real-world networks demonstrate the superiority of the evolutionary perturbation approach for target defense against RA attacks. Moreover, transferring experiments show that, although the evolutionary perturbation approach is designed to against RA attacks, it is also effective against other link-prediction-based attacks.

cs.SI↗

Linear Quadratic Synchronization of Multi-Agent Systems: A Distributed Optimization Approach

The distributed optimal synchronization problem with linear quadratic cost is solved in this paper for multi-agent systems with an undirected communication topology. For the first time, the optimal synchronization problem is formulated as a distributed optimization problem with a linear quadratic cost functional that integrates quadratic synchronization errors and quadratic input signals subject to agent dynamics and synchronization constraints. By introducing auxiliary synchronization state variables and combining the distributed synchronization method with the alternating direction method of multiplier (ADMM), a new distributed control protocol is designed for solving the distributed optimization problem. With this construction, the optimal synchronization control problem is separated into several independent subproblems: a synchronization optimization, an input minimization and a dual optimization. These subproblems are then solved by distributed numerical algorithms based on the Lyapunov method and dynamic programming. Numerical examples for both homogeneous and heterogeneous multi-agent systems are given to demonstrate the effectiveness of the proposed method.

eess.SY↗

Toward Stronger Robustness of Network Controllability: A Snapback Network Model

A new complex network model, called q-snapback network, is introduced. Basic topological characteristics of the network, such as degree distribution, average path length, clustering coefficient and Pearson correlation coefficient, are evaluated. The typical 4-motifs of the network are simulated. The robustness of both state and structural controllabilities of the network against targeted and random node- and edge-removal attacks, with comparisons to the multiplex congruence network and the generic scale-free network, are presented. It is shown that the q-snapback network has the strongest robustness of controllabilities due to its advantageous inherent structure with many chain- and loop-motifs.

eess.SY↗

Local communities obstruct global consensus: Naming game on multi-local-world networks

Community structure is essential for social communications, where individuals belonging to the same community are much more actively interacting and communicating with each other than those in different communities within the human society. Naming game, on the other hand, is a social communication model that simulates the process of learning a name of an object within a community of humans, where the individuals can generally reach global consensus asymptotically through iterative pair-wise conversations. The underlying network indicates the relationships among the individuals. In this paper, three typical topologies, namely random-graph, small-world and scale-free networks, are employed, which are embedded with the multi-local-world community structure, to study the naming game. Simulations show that 1) the convergence process to global consensus is getting slower as the community structure becomes more prominent, and eventually might fail; 2) if the inter-community connections are sufficiently dense, neither the number nor the size of the communities affects the convergence process; and 3) for different topologies with the same average node-degree, local clustering of individuals obstruct or prohibit global consensus to take place. The results reveal the role of local communities in a global naming game in social network studies.

cs.SI↗

Distributed Observers Design for Leader-Following Control of Multi-Agent Networks (Extended Version)

This paper is concerned with a leader-follower problem for a multi-agent system with a switching interconnection topology. Distributed observers are designed for the second-order follower-agents, under the common assumption that the velocity of the active leader cannot be measured in real time. Some dynamic neighbor-based rules, consisting of distributed controllers and observers for the autonomous agents, are developed to keep updating the information of the leader. With the help of an explicitly constructed common Lyapunov function (CLF), it is proved that each agent can follow the active leader. Moreover, the tracking error is estimated even in a noisy environment. Finally, a numerical example is given for illustration.

math.OC↗

Communicating with sentences: A multi-word naming game model

Naming game simulates the process of naming an object by a single word, in which a population of communicating agents can reach global consensus asymptotically through iteratively pair-wise conversations. We propose an extension of the single-word model to a multi-word naming game (MWNG), simulating the case of describing a complex object by a sentence (multiple words). Words are defined in categories, and then organized as sentences by combining them from different categories. We refer to a formatted combination of several words as a pattern. In such an MWNG, through a pair-wise conversation, it requires the hearer to achieve consensus with the speaker with respect to both every single word in the sentence as well as the sentence pattern, so as to guarantee the correct meaning of the saying, otherwise, they fail reaching consensus in the interaction. We validate the model in three typical topologies as the underlying communication network, and employ both conventional and man-designed patterns in performing the MWNG.

cs.CL↗

Cooperative epidemic spreading on a two-layered interconnected network

This study is concerned with the dynamical behaviors of epidemic spreading over a two-layered interconnected network. Three models in different levels are proposed to describe cooperative spreading processes over the interconnected network, wherein the disease in one network can spread to the other. Theoretical analysis is provided for each model to reveal that the global epidemic threshold in the interconnected network is not larger than the epidemic thresholds for the two isolated layered networks. In particular, in an interconnected homogenous network, detailed theoretical analysis is presented, which allows quick and accurate calculations of the global epidemic threshold. Moreover, in an interconnected heterogeneous network with inter-layer correlation between node degrees, it is found that the inter-layer correlation coefficient has little impact on the epidemic threshold, but has significant impact on the total prevalence. Simulations further verify the analytical results, showing that cooperative epidemic processes promote the spreading of diseases.

physics.soc-ph↗

On the security defects of an image encryption scheme

This paper studies the security of a recently-proposed chaos-based image encryption scheme, and points out the following problems: 1) there exist a number of invalid keys and weak keys, and some keys are partially equivalent for encryption/decryption; 2) given one chosen plain-image, a subkey $K_{10}$ can be guessed with a smaller computational complexity than that of the simple brute-force attack; 3) given at most 128 chosen plain-images, a chosen-plaintext attack can possibly break the following part of the secret key: $\{K_i\bmod 128\}_{i=4}^{10}$, which works very well when $K_{10}$ is not too large; 4) when $K_{10}$ is relatively small, a known-plaintext attack can be carried out with only one known plain-image to recover some visual information of any other plain-images encrypted by the same key.

cs.CR↗

Fixed-time consensus of multiple double-integrator systems under directed topologies: A motion-planning approach

This paper investigates the fixed-time consensus problem under directed topologies. By using a motion-planning approach, a class of distributed fixed-time algorithms are developed for a multi-agent system with double-integrator dynamics. In the context of the fixed-time consensus, we focus on both directed fixed and switching topologies. Under the directed fixed topology, a novel class of distributed algorithms are designed, which guarantee the consensus of the multi-agent system with a fixed settling time if the topology has a directed spanning tree. Under the directed periodically switching topologies, the fixedtime consensus is solved via the proposed algorithms if the topologies jointly have a directed spanning tree. In particular, the fixed settling time can be off-line pre-assigned according to task requirements. Compared with the existing results, to our best knowledge, it is the first time to solve the fixed-time consensus problem for double-integrator systems under directed topologies. Finally, a numerical example is given to illustrate the effectiveness of the analytical results.

eess.SY↗