Open Access Open Access  Restricted Access Subscription or Fee Access

An Optimized Global Synchronization on SDDCN

T. Santha, M. Sharanya


The complex networks have been gaining increasing research attention because of their potential applications in many real-world systems from a variety of fields such as biology, social systems, linguistic networks, and technological systems. In this paper, the problem of stochastic synchronization analysis is investigated for a new array of coupled discrete time stochastic complex networks with randomly occurred nonlinearities (RONs) and time delays. The discrete-time complex networks under consideration are subject to: 1) stochastic nonlinearities that occur according to the Bernoulli distributed white noise sequences; 2) stochastic disturbances that enter the coupling term, the delayed coupling term as well as the overall network; and 3) time delays that include both the discrete and distributed ones. Note that the newly introduced RONs and the multiple stochastic disturbances can better reflect the dynamical behaviors of coupled complex networks whose information transmission process is affected by a noisy environment. By constructing a novel Lyapunov-like matrix functional, the idea of delay fractioning is applied to deal with the addressed synchronization analysis problem. By employing a combination of the linear matrix inequality (LMI) techniques, the free-weighting matrix method and stochastic analysis theories, several delay-dependent sufficient conditions are obtained which ensure the asymptotic synchronization in the mean square sense for the discrete-time stochastic complex networks with time delays. The criteria derived are characterized in terms of LMIs whose solution can be solved by utilizing the standard numerical software. While these solvers are significantly faster than classical convex optimization algorithms, it should be kept in mind that the complexity of LMI computations remains higher than that of solving, say, a Riccati equation. For instance, problems with a thousand design variables typically take over an hour on today’s workstations. However, this thesis proposes LMI optimization   technique to solve this problem. The advantage of the proposed approach is that resulting stability criterion can be used efficiently via existing numerical convex optimization algorithms such as the interior-point algorithms for solving LMIs

The experimental results show that synchronization using optimized LMI always performs better than LMI.instructions give you guidelines for preparing papers for conferences or journals. Use this document as a template if you are using Microsoft Word. Otherwise, use this document as an instruction set. The electronic file of your paper will be formatted further at World Enformatika Society. Define all symbols used in the abstract. Do not cite references in the abstract. Do not delete the blank line immediately above the abstract; it sets the footnote at the bottom of this column. Page margins are1,78 cmtop and  down;1,65 cmleft and right. Each column width is8,89 cmand the separation between the columns is0,51 cm.


Complex Networks, Global Synchronization, Linear Matrix Inequalities, Optimized LMI, Randomly Occurred Nonlinearities.

Full Text:



M. Aldana, “Boolean dynamics of networks with scale-free topology,” Physica D, vol. 185, pp. 45–66, 2003.

F. M. Atay, T. Biyikoglu, and J. Jost, “Network synchronization: Spectral versus statistical properties,” Physica D, vol. 224, no. 1–2, pp. 35–41, 2006.

I. V. Belykh, V. N. Belykh, and M. Hasler, “Blinking model and synchronization in small-world networks with a time-varying coupling,” Physica D, vol. 195, no. 1–2, pp. 188–206, 2004.

S. Boyd, L. E. Ghaoui, E. Feron, and V. Balakrishnan, Linear Matrix Inequalities in System and Control Theory. Philadelphia, PA: SIAM, 1994.

L. Chen, C. Qiu, and H. B. Huang, “Synchronization with on-off coupling: Role of time scales in network dynamics,” Phys. Rev. E, Stat. Phys. Plasmas Fluids Relat. Interdiscip. Top., vol. 79, no. 4, Article 045101.

C. Dangalchev, “Generation models for scale-free networks,” Physica A, vol. 338, pp. 659–671, 2004.

H. Gao and T. Chen, “New results on stability of discrete-time systems with time-varying state delay,” IEEE Trans. Autom. Control, vol. 52, no. 2, pp. 328–334, Feb. 2007.

Y. He, G. Liu, D. Rees, and M. Wu, “ 􀀀 filtering for discrete-time systems with time-varying delay,” Signal Process., DOI: 10.1016/j. sigpro.2008.08.008, to be published.

S. Kauffman, C. Peterson, B. Samuelsson, and C. Troein, “Random Boolean network models and the yeast transcriptional network,” Proc. Nat. Acad. Sci. USA, vol. 100, no. 25, pp. 14796–14799, 2003.

F. M. Atay, T. Biyikoglu, and J. Jost, “Network synchronization: Spectral versus statistical properties,” Physica D, vol. 224, no. 1–2, pp.35–41, 2006.

Z. Toroczkai, “Complex networks: The challenge of interaction topology,” Los Alamos Sci., vol. 29, pp. 94–109, 2005.

W. Lu and T. Chen, “Global synchronization of discrete-time dynamical network with a directed graph,” IEEE Trans. Circuits Syst. II, Exp. Briefs, vol. 54, no. 2, pp. 136–140, Feb. 2007.

R. Z. Khasminskii, “Stochastic stability of differential equations,” Alphen aan den Rijn, Sijthoffand Noor, Khasminskiidhoff, 1980.R. E. Haskell and C. T. Case, “Transient signal propagation in lossless isotropic plasmas (Report style),” USAF Cambridge Res. Lab., Cambridge, MA Rep. ARCRL-66-234 (II), 1994, vol. 2.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.