arXiv subjects

Takashi Nishikawa

Publications and source records attributed to Takashi Nishikawa.

43 records · Page 3Linked to original sources

arXiv2003

System of phase oscillators with diagonalizable interaction

We consider a system of N phase oscillators having randomly distributed natural frequencies and diagonalizable interactions among the oscillators. We show that in the limit of N going to infinity, all solutions of such a system are incoherent with probability one for any strength of coupling, which implies that there is no sharp transition from incoherence to coherence as the coupling strength is increased, in striking contrast to Kuramoto's (special) oscillator system.

math.DS↗

arXiv2003

Heterogeneity in oscillator networks: Are smaller worlds easier to synchronize?

Small-world and scale-free networks are known to be more easily synchronized than regular lattices, which is usually attributed to the smaller network distance between oscillators. Surprisingly, we find that networks with a homogeneous distribution of connectivity are more synchronizable than heterogeneous ones, even though the average network distance is larger. We present numerical computations and analytical estimates on synchronizability of the network in terms of its heterogeneity parameters. Our results suggest that some degree of homogeneity is expected in naturally evolved structures, such as neural networks, where synchronizability is desirable.

cond-mat.dis-nn↗

arXiv2003

Range-based attack on links in scale-free networks: are long-range links responsible for the small-world phenomenon?

The small-world phenomenon in complex networks has been identified as being due to the presence of long-range links, i.e., links connecting nodes that would otherwise be separated by a long node-to-node distance. We find, surprisingly, that many scale-free networks are more sensitive to attacks on short-range than on long-range links. This result, besides its importance concerning network efficiency and/or security, has the striking implication that the small-world property of scale-free networks is mainly due to short-range links.

cond-mat.dis-nn↗

arXiv2002

Smallest small-world network

Efficiency in passage times is an important issue in designing networks, such as transportation or computer networks. The small-world networks have structures that yield high efficiency, while keeping the network highly clustered. We show that among all networks with the small-world structure, the most efficient ones have a single ``center'', from which all shortcuts are connected to uniformly distributed nodes over the network. The networks with several centers and a connected subnetwork of shortcuts are shown to be ``almost'' as efficient. Genetic-algorithm simulations further support our results.

cond-mat.dis-nn↗

arXiv2000

Invariant sets for discontinuous parabolic area-preserving torus maps

We analyze a class of piecewise linear parabolic maps on the torus, namely those obtained by considering a linear map with double eigenvalue one and taking modulo one in each component. We show that within this two parameter family of maps, the set of noninvertible maps is open and dense. For cases where the entries in the matrix are rational we show that the maximal invariant set has positive Lebesgue measure and we give bounds on the measure. For several examples we find expressions for the measure of the invariant set but we leave open the question as to whether there are parameters for which this measure is zero.

chao-dyn↗

arXiv1999

Linear Parabolic Maps on the Torus

We investigate linear parabolic maps on the torus. In a generic case these maps are non-invertible and discontinuous. Although the metric entropy of these systems is equal to zero, their dynamics is non-trivial due to folding of the image of the unit square into the torus. We study the structure of the maximal invariant set, and in a generic case we prove the sensitive dependence on the initial conditions. We study the decay of correlations and the diffusion in the corresponding system on the plane. We also demonstrate how the rationality of the real numbers defining the map influences the dynamical properties of the system.

chao-dyn↗

arXiv1996

Fractalization of Torus Revisited as a Strange Nonchaotic Attractor

Fractalization of torus and its transition to chaos in a quasi-periodically forced logistic map is re-investigated in relation with a strange nonchaotic attractor, with the aid of functional equation for the invariant curve. Existence of fractal torus in an interval in parameter space is confirmed by the length and the number of extrema of the torus attractor, as well as the Fourier mode analysis. Mechanisms of the onset of fractal torus and the transition to chaos are studied in connection with the intermittency.

chao-dyn↗