The mean complexities in the regimes of dynamical networks with full oscillations binding
- Resource Type
- Authors
- Vladimir I. Nekorkin; Aleksei Dmitrichev; Valentin Afraimovich; Dmitry Shchapin
- Source
- The European Physical Journal Special Topics. 227:1231-1241
- Subject
- Degree (graph theory)
0103 physical sciences
General Physics and Astronomy
Order (group theory)
General Materials Science
Statistical physics
Physical and Theoretical Chemistry
010306 general physics
01 natural sciences
Topology (chemistry)
010305 fluids & plasmas
Mathematics
- Language
- ISSN
- 1951-6401
1951-6355
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.