Maximum performance at minimum cost in network synchronization (Q858510): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Sufficient Conditions for Fast Switching Synchronization in Time-Varying Network Topologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size of the sync basin / 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: Connection graph stability method for synchronized coupled chaotic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronization in power-law networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4887286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approach to synchronization analysis of linearly coupled ordinary differential systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronization analysis of linearly coupled networks of discrete time systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronization of Coupled Connected Neural Networks With Delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Rayleigh-Ritz ratios of a generalized Laplacian matrix of directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über ein Paradoxon aus der Verkehrsplanung / rank
 
Normal rank

Revision as of 11:01, 25 June 2024

scientific article
Language Label Description Also known as
English
Maximum performance at minimum cost in network synchronization
scientific article

    Statements

    Maximum performance at minimum cost in network synchronization (English)
    0 references
    0 references
    0 references
    0 references
    9 January 2007
    0 references
    The subject of the paper is the network of coupled identical oscillators \[ \dot x_i = F(x_i) + \sigma \sum_{j=1}^{n} A_{ij} [H(x_j)-H(x_i)], \quad i=1,\dots,n, \] where \(\sigma\) is the parameter which controls the overall coupling, \(x_i \in \mathbb{R}^m\) is the phase variable of \(i\)-th oscillator, \(A_{ij}\geq 0,\) is the relative strength of the coupling, and \(H: \mathbb{R}^m\to \mathbb{R}^m\) is the output function. The following optimization problems are considered: 1. Maximization of synchronizability, i.e. the maximization of the region of parameter \(\sigma\), for which stable synchronization occurs. 2. Minimization of the synchronization cost, which is defined as the sum of the total input strength of all nodes at the lower synchronization threshold \(\sigma_{\min}\): \(C=\sigma_{\min} \sum_{i,j=1}^{n}A_{ij}\). The main result shows that the solution sets for these two optimization problems coincide and are characterized by the following condition on the Laplacian (i.e. the matrix \((A_{ij})\)) eigenvalues: \[ 0=\lambda_1<\lambda_2=\cdots=\lambda_n. \] The authors study such optimal networks and drive some useful conclusions about their structure.
    0 references
    complex networks
    0 references
    synchronization
    0 references
    optimization
    0 references
    maximum performance
    0 references
    cost
    0 references
    oriented spanning trees
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references