Synchronization in weighted scale-free networks with degree-degree correlation (Q858519): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Complex networks: structure and dynamics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronization in networks of nonlinear dynamical systems coupled via a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: SYNCHRONIZABILITY AND SYNCHRONIZATION DYNAMICS OF WEIGHED AND UNWEIGHED SCALE FREE NETWORKS WITH DEGREE MIXING / rank
 
Normal rank
Property / cites work
 
Property / cites work: A critical point for random graphs with a given degree sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5395264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronization analysis of linearly coupled networks of discrete time systems / rank
 
Normal rank

Latest revision as of 12:01, 25 June 2024

scientific article
Language Label Description Also known as
English
Synchronization in weighted scale-free networks with degree-degree correlation
scientific article

    Statements

    Synchronization in weighted scale-free networks with degree-degree correlation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 January 2007
    0 references
    The paper deals with synchronization phenomena in the following set of coupled ordinary differential equations \[ x_i ' = f(x_i) -\sigma \sum_{j=1}^{N} {\mathcal L}_{ij} h(x_j), \quad i=1,\dots,N, \] where \(x_i\in \mathbb{R}^m\) are the phase variables of the \(i\)-th node, \(f(x_i): \mathbb{R}^m\to \mathbb{R}^m\) determines the uncoupled dynamics of the \(i\)-th node, \(h(x): \mathbb{R}^m\to \mathbb{R}^m\) is the output function, and \(\sigma\) is the coupling strength. Under synchronization, the authors mean the so called ``local complete synchronization'', i.e. when some symmetric (synchronous) orbit \(x_1=\cdots=x_N=s(t)\) is locally stable. Using the master stability function method [\textit{L. Pecora, T. Carroll, G. Johnson, D. Mar}, and \textit{J. Heagy}, Chaos 7, 520--543 (1997; Zbl 0933.37030)] and some numerics, the authors discuss the synchronization propensity depending on the network structure, which is determined by the matrix \({\mathcal L}_{ij}\). The propensity to the synchronization is measured by the size of the parameter \(\sigma\) interval, for which the synchronous orbit is stable.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    complex networks
    0 references
    assortiative
    0 references
    disassortiative mixing
    0 references
    eigenvalue
    0 references
    master stability function
    0 references
    identical systems
    0 references
    coupling asymmetry
    0 references
    0 references
    0 references