Learn More
Sophisticated methods for analysing complex networks promise to be of great benefit to almost all scientific disciplines, yet they elude us. In this work, we make fundamental methodological advances to rectify this. We discover that the interaction between a small number of roles, played by nodes in a network, can characterize a network's structure and also(More)
———————————————————————————————————————-We present a computational study of the invariant sets visualization method based on ergodic partition theory, firstly proposed in [1]. The algorithms for computation of the time averages of many L 1 functions are developed and employed producing the approximation of the phase space ergodic partitioning. The method is(More)
—————————————————————————————————————————-We extend the computational visualization method proposed in [1, 2] using the concept of the harmonic time averages presented in [3]. Algorithms for frequency analysis of the phase space are constructed and implemented numerically, producing a graphical visualization of the periodic sets for a given periodicity. The(More)
Evolutionary optimisation algorithm is employed to design networks of phase-repulsive oscillators that achieve an anti-phase synchronised state. By introducing the link frustration, the evolutionary process is implemented by rewiring the links with probability proportional to their frustration, until the final network displaying a unique non-frustrated(More)
  • 1