Xiao Wang - Academia.edu (original) (raw)
Uploads
Papers by Xiao Wang
Recently, it has been demonstrated that many large complex networks display a scale-free feature,... more Recently, it has been demonstrated that many large complex networks display a scale-free feature, that is, their connectivity distributions have the power-law form. In this paper, we investigate the synchronization phenomena in a scale-free dynamical network. We show that its synchronizability is robust against random removal of nodes, but is fragile to specific removal of the most highly connected nodes.
IEEE Transactions on Circuits and Systems I-regular Papers, 2002
Recently, it has been demonstrated that many large complex networks display a scale-free feature,... more Recently, it has been demonstrated that many large complex networks display a scale-free feature, that is, their connectivity distributions have the power-law form. In this paper, we investigate the synchronization phenomena in a scale-free dynamical network. We show that its synchronizability is robust against random removal of nodes, but is fragile to specific removal of the most highly connected nodes. * Supported by the UK Engineering and Physical Sciences Research Council through the EPSRC grant number GR/M97923/01 and the Hong Kong GRC CERG Grant 9040565.
Physica A-statistical Mechanics and Its Applications, 2002
Recently, it has been demonstrated that many large complex networks display a scale-free feature,... more Recently, it has been demonstrated that many large complex networks display a scale-free feature, that is, their connectivity distributions have the power-law form. In the present work, control of a scale-free dynamical network by applying local feedback injections to a fraction of network nodes is investigated. The speciÿcally and randomly pinning schemes are considered. The specifically pinning of the most highly connected nodes is shown to require a signiÿcantly smaller number of local controllers as compared to the randomly pinning scheme. The method is applied to an array of Chua's oscillators as an example.
Abstract: Computing becomes increasingly mobile and pervasive today; these changes imply that app... more Abstract: Computing becomes increasingly mobile and pervasive today; these changes imply that applications and services must be aware of and adapt to their changing contexts in highly dynamic environments. Today, building context-aware systems is a complex task ...
Recently, it has been demonstrated that many large complex networks display a scale-free feature,... more Recently, it has been demonstrated that many large complex networks display a scale-free feature, that is, their connectivity distributions have the power-law form. In this paper, we investigate the synchronization phenomena in a scale-free dynamical network. We show that its synchronizability is robust against random removal of nodes, but is fragile to specific removal of the most highly connected nodes.
IEEE Transactions on Circuits and Systems I-regular Papers, 2002
Recently, it has been demonstrated that many large complex networks display a scale-free feature,... more Recently, it has been demonstrated that many large complex networks display a scale-free feature, that is, their connectivity distributions have the power-law form. In this paper, we investigate the synchronization phenomena in a scale-free dynamical network. We show that its synchronizability is robust against random removal of nodes, but is fragile to specific removal of the most highly connected nodes. * Supported by the UK Engineering and Physical Sciences Research Council through the EPSRC grant number GR/M97923/01 and the Hong Kong GRC CERG Grant 9040565.
Physica A-statistical Mechanics and Its Applications, 2002
Recently, it has been demonstrated that many large complex networks display a scale-free feature,... more Recently, it has been demonstrated that many large complex networks display a scale-free feature, that is, their connectivity distributions have the power-law form. In the present work, control of a scale-free dynamical network by applying local feedback injections to a fraction of network nodes is investigated. The speciÿcally and randomly pinning schemes are considered. The specifically pinning of the most highly connected nodes is shown to require a signiÿcantly smaller number of local controllers as compared to the randomly pinning scheme. The method is applied to an array of Chua's oscillators as an example.
Abstract: Computing becomes increasingly mobile and pervasive today; these changes imply that app... more Abstract: Computing becomes increasingly mobile and pervasive today; these changes imply that applications and services must be aware of and adapt to their changing contexts in highly dynamic environments. Today, building context-aware systems is a complex task ...