bibtype J - Journal Article
ARLID 0398127
utime 20240111140836.5
mtime 20131106235959.9
WOS 000327909800007
SCOPUS 84887316858
DOI 10.1016/j.jfranklin.2013.03.019
title (primary) (eng) Robust synchronization of a class of chaotic networks
specification
page_count 13 s.
media_type E
serial
ARLID cav_un_epca*0253779
ISSN 0016-0032
title Journal of the Franklin Institute-Engineering and Applied Mathematics
volume_id 350
volume 10 (2013)
page_num 2936-2948
publisher
name Elsevier
keyword generalized Lorenz system
keyword robust synchronization
keyword dynamical complex network
author (primary)
ARLID cav_un_auth*0101074
name1 Čelikovský
name2 Sergej
full_dept (cz) Teorie řízení
full_dept (eng) Department of Control Theory
department (cz)
department (eng) TR
institution UTIA-B
full_dept Department of Control Theory
fullinstit Ústav teorie informace a automatizace AV ČR, v. v. i.
author
ARLID cav_un_auth*0215855
name1 Lynnyk
name2 Volodymyr
full_dept (cz) Teorie řízení
full_dept Department of Control Theory
department (cz)
department TR
institution UTIA-B
full_dept Department of Control Theory
fullinstit Ústav teorie informace a automatizace AV ČR, v. v. i.
author
ARLID cav_un_auth*0293225
name1 Chen
name2 G.
country CN
source
source_type textový dokument
url http://library.utia.cas.cz/separaty/2013/TR/celikovsky-0398127.pdf
source_size 1,2 MB
cas_special
project
project_id GAP103/12/1794
agency GA ČR
country CZ
ARLID cav_un_auth*0283207
abstract (eng) This paper studies synchronization of a dynamical complex network consisting of nodes being generalized Lorenz chaotic systems and connections created with transmitted synchronizing signals. The focus is on the robustness of the network synchronization with respect to its topology. The robustness is analyzed theoretically for the case of two nodes with two-sided (bidirectional) connections, and numerically for various cases with large numbers of nodes. It is shown that, unless a certai nminimal coherent topology is present in the network, synchronization is always preserved. While for a minimal network where,the resulting synchrony reduces to semi-global if redundant connections are added.
reportyear 2014
RIV BC
num_of_auth 3
mrcbC52 4 A 4a 20231122135900.0
inst_support RVO:67985556
permalink http://hdl.handle.net/11104/0225710
mrcbC62 1
cooperation
ARLID cav_un_auth*0295056
institution ČVUT
name České vysoké učení technické v Praze
country CZ
mrcbC63-f Praha 6
mrcbT16-e AUTOMATIONCONTROLSYSTEMS|ENGINEERINGELECTRICALELECTRONIC|ENGINEERINGMULTIDISCIPLINARY|MATHEMATICSINTERDISCIPLINARYAPPLICATIONS
mrcbT16-f 2.396
mrcbT16-g 0.254
mrcbT16-h 4.IV
mrcbT16-i 0.00595
mrcbT16-j 0.576
mrcbT16-k 2546
mrcbT16-l 197
mrcbT16-s 1.046
mrcbT16-z ScienceCitationIndexExpanded
mrcbT16-4 Q1
mrcbT16-B 54.215
mrcbT16-C 84.584
mrcbT16-D Q2
mrcbT16-E Q2
arlyear 2013
mrcbTft \nSoubory v repozitáři: celikovsky-0398127.pdf
mrcbU14 84887316858 SCOPUS
mrcbU34 000327909800007 WOS
mrcbU56 textový dokument 1,2 MB
mrcbU63 cav_un_epca*0253779 Journal of the Franklin Institute-Engineering and Applied Mathematics 0016-0032 1879-2693 Roč. 350 č. 10 2013 2936 2948 Elsevier