The mean complexities in the regimes of dynamical networks with full oscillations binding
- 16 Downloads
We continue to apply the notion of mean complexities to study dynamical networks. We show that the mean complexities can help to single out the nodes with similar features (and dynamical behavior) and to reveal some properties of the topology of the networks. We found that the nodes with the same degree (number of connections) have equal values of the mean complexities in the regime of full binding. At the same time, the mean complexities of nodes with different degree follow a descending order with respect to the degree.
Unable to display preview. Download preview PDF.
- 4.M.E.J. Newman, A.L. Barabasi, D.J. Watts, The Structure and Dynamics of Networks (Princeton University Press, Princeton, 2006) Google Scholar
- 5.E. Prisner, Graph Dynamics (CRC Press, Boca Raton, FL, 1995) Google Scholar
- 11.X. Leoncini, Hamiltonian chaos and anomalous transport in two dimensional flows, in Hamiltonian chaos beyond the KAM theory: dedicated to George M. Zaslavsky, edited by C.J. Luo Albert, V. Afraimovich (Springer-Verlag, Berlin, Heidelberg, 2011), pp. 143–192 Google Scholar
- 13.V.I. Nekorkin, L.V. Vdovin, Prikl. Nelin. Dina. 15, 36 (2007) (in Russian) Google Scholar