arXiv subjects

Takashi Nishikawa

Publications and source records attributed to Takashi Nishikawa.

At least 37 records · Page 2Linked to original sources

arXiv2017

Slim Fractals: The Geometry of Doubly Transient Chaos

Traditional studies of chaos in conservative and driven dissipative systems have established a correspondence between sensitive dependence on initial conditions and fractal basin boundaries, but much less is known about the relation between geometry and dynamics in undriven dissipative systems. These systems can exhibit a prevalent form of complex dynamics, dubbed doubly transient chaos because not only typical trajectories but also the (otherwise invariant) chaotic saddles are transient. This property, along with a manifest lack of scale invariance, has hindered the study of the geometric properties of basin boundaries in these systems--most remarkably, the very question of whether they are fractal across all scales has yet to be answered. Here we derive a general dynamical condition that answers this question, which we use to demonstrate that the basin boundaries can indeed form a true fractal; in fact, they do so generically in a broad class of transiently chaotic undriven dissipative systems. Using physical examples, we demonstrate that the boundaries typically form a slim fractal, which we define as a set whose dimension at a given resolution decreases when the resolution is increased. To properly characterize such sets, we introduce the notion of equivalent dimension for quantifying their relation with sensitive dependence on initial conditions at all scales. We show that slim fractal boundaries can exhibit complex geometry even when they do not form a true fractal and fractal scaling is observed only above a certain length scale at each boundary point. Thus, our results reveal slim fractals as a geometrical hallmark of transient chaos in undriven dissipative systems.

nlin.CD↗

arXiv2017

Vulnerability and co-susceptibility determine the size of network cascades

In a network, a local disturbance can propagate and eventually cause a substantial part of the system to fail, in cascade events that are easy to conceptualize but extraordinarily difficult to predict. Here, we develop a statistical framework that can predict cascade size distributions by incorporating two ingredients only: the vulnerability of individual components and the co-susceptibility of groups of components (i.e., their tendency to fail together). Using cascades in power grids as a representative example, we show that correlations between component failures define structured and often surprisingly large groups of co-susceptible components. Aside from their implications for blackout studies, these results provide insights and a new modeling framework for understanding cascades in financial systems, food webs, and complex networks in general.

physics.soc-ph↗

arXiv2016

Symmetric States Requiring System Asymmetry

Spontaneous synchronization has long served as a paradigm for behavioral uniformity that can emerge from interactions in complex systems. When the interacting entities are identical and their coupling patterns are also identical, the complete synchronization of the entire network is the state inheriting the system symmetry. As in other systems subject to symmetry breaking, such symmetric states are not always stable. Here we report on the discovery of the converse of symmetry breaking--the scenario in which complete synchronization is not stable for identically-coupled identical oscillators but becomes stable when, and only when, the oscillator parameters are judiciously tuned to nonidentical values, thereby breaking the system symmetry to preserve the state symmetry. Aside from demonstrating that diversity can facilitate and even be required for uniformity and consensus, this suggests a mechanism for convergent forms of pattern formation in which initially asymmetric patterns evolve into symmetric ones.

cond-mat.dis-nn↗

arXiv2014

Controlling systems that drift through a tipping point

Slow parameter drift is common in many systems (e.g., the amount of greenhouse gases in the terrestrial atmosphere is increasing). In such situations, the attractor on which the system trajectory lies can be destroyed, and the trajectory will then go to another attractor of the system. We consider the case where there are more than one of these possible final attractors, and we ask whether we can control the outcome (i.e., the attractor that ultimately captures the trajectory) using only small controlling perturbations. Specifically, we consider the problem of controlling a noisy system whose parameter slowly drifts through a saddle-node bifurcation taking place on a fractal boundary between the basins of multiple attractors. We show that, when the noise level is low, a small perturbation of size comparable to the noise amplitude applied at a single point in time can ensure that the system will evolve toward a target attracting state with high probability. For a range of noise levels, we find that the minimum size of perturbation required for control is much smaller within a time period that starts some time after the bifurcation, providing a "window of opportunity" for driving the system toward a desirable state. We refer to this procedure as tipping point control.

nlin.CD↗

arXiv2012

Why Optimal States Recruit Fewer Reactions in Metabolic Networks

The metabolic network of a living cell involves several hundreds or thousands of interconnected biochemical reactions. Previous research has shown that under realistic conditions only a fraction of these reactions is concurrently active in any given cell. This is partially determined by nutrient availability, but is also strongly dependent on the metabolic function and network structure. Here, we establish rigorous bounds showing that the fraction of active reactions is smaller (rather than larger) in metabolic networks evolved or engineered to optimize a specific metabolic task, and we show that this is largely determined by the presence of thermodynamically irreversible reactions in the network. We also show that the inactivation of a certain number of reactions determined by irreversibility can generate a cascade of secondary reaction inactivations that propagates through the network. The mathematical results are complemented with numerical simulations of the metabolic networks of the bacterium Escherichia coli and of human cells, which show, counterintuitively, that even the maximization of the total reaction flux in the network leads to a reduced number of active reactions.

q-bio.MN↗

arXiv2011

Discovering Network Structure Beyond Communities

To understand the formation, evolution, and function of complex systems, it is crucial to understand the internal organization of their interaction networks. Partly due to the impossibility of visualizing large complex networks, resolving network structure remains a challenging problem. Here we overcome this difficulty by combining the visual pattern recognition ability of humans with the high processing speed of computers to develop an exploratory method for discovering groups of nodes characterized by common network properties, including but not limited to communities of densely connected nodes. Without any prior information about the nature of the groups, the method simultaneously identifies the number of groups, the group assignment, and the properties that define these groups. The results of applying our method to real networks suggest the possibility that most group structures lurk undiscovered in the fast-growing inventory of social, biological, and technological networks of scientific interest.

physics.soc-ph↗

arXiv2010

Network synchronization landscape reveals compensatory structures, quantization, and the positive effect of negative interactions

Synchronization, in which individual dynamical units keep in pace with each other in a decentralized fashion, depends both on the dynamical units and on the properties of the interaction network. Yet, the role played by the network has resisted comprehensive characterization within the prevailing paradigm that interactions facilitating pair-wise synchronization also facilitate collective synchronization. Here we challenge this paradigm and show that networks with best complete synchronization, least coupling cost, and maximum dynamical robustness, have arbitrary complexity but quantized total interaction strength that constrains the allowed number of connections. It stems from this characterization that negative interactions as well as link removals can be used to systematically improve and optimize synchronization properties in both directed and undirected networks. These results extend the recently discovered compensatory perturbations in metabolic networks to the realm of oscillator networks and demonstrate why "less can be more" in network synchronization.

cond-mat.dis-nn↗

arXiv2010

Approximating Spectral Impact of Structural Perturbations in Large Networks

Determining the effect of structural perturbations on the eigenvalue spectra of networks is an important problem because the spectra characterize not only their topological structures, but also their dynamical behavior, such as synchronization and cascading processes on networks. Here we develop a theory for estimating the change of the largest eigenvalue of the adjacency matrix or the extreme eigenvalues of the graph Laplacian when small but arbitrary set of links are added or removed from the network. We demonstrate the effectiveness of our approximation schemes using both real and artificial networks, showing in particular that we can accurately obtain the spectral ranking of small subgraphs. We also propose a local iterative scheme which computes the relative ranking of a subgraph using only the connectivity information of its neighbors within a few links. Our results may not only contribute to our theoretical understanding of dynamical processes on networks, but also lead to practical applications in ranking subgraphs of real complex networks.

cond-mat.dis-nn↗

arXiv2010

Judging Model Reduction of Chaotic Systems via Optimal Shadowing Criteria

A common goal in the study of high dimensional and complex system is to model the system by a low order representation. In this letter we propose a general approach for assessing the quality of a reduced order model for high dimensional chaotic systems. The key of this approach is the use of optimal shadowing, combined with dimensionality reduction techniques. Rather than quantify the quality of a model based on the quality of predictions, which can be irrelevant for chaotic systems since even excellent models can do poorly, we suggest that a good model should allow shadowing by modeled data for long times; this principle leads directly to an optimal shadowing criterion of model reduction. This approach overcomes the usual difficulties encountered by traditional methods which either compare systems of the same size by normed-distance in the functional space, or measure how close an orbit generated by a model is to the observed data. Examples include interval arithmetic computations to validate the optimal shadowing.

nlin.CD↗

arXiv2009

Constructing Generalized Synchronization Manifolds by Manifold Equation

Full understanding of synchronous behavior in coupled dynamical systems beyond the identical case requires an explicit construction of the generalized synchronization manifold, whether we wish to compare the systems, or to understand their stability. Nonetheless, while synchronization has become an extremely popular topic, the bulk of the research in this area has been focused on the identical case, specifically because its invariant manifold is simply the identity function, and there have yet to be any generally workable methods to compute the generalized synchronization manifolds for non-identical systems. Here, we derive time dependent PDEs whose stationary solution mirrors exactly the generalized synchronization manifold, respecting its stability. We introduce a novel method for dealing with subtle issues with boundary conditions in the numerical scheme to solve the PDE, and we develop first order expansions close to the identical case. We give several examples of increasing sophistication, including coupled non-identical Van der Pol oscillators. By using the manifold equation, we also discuss the design of coupling to achieve desired synchronization.

nlin.CD↗

arXiv2009

Spontaneous Reaction Silencing in Metabolic Optimization

Metabolic reactions of single-cell organisms are routinely observed to become dispensable or even incapable of carrying activity under certain circumstances. Yet, the mechanisms as well as the range of conditions and phenotypes associated with this behavior remain very poorly understood. Here we predict computationally and analytically that any organism evolving to maximize growth rate, ATP production, or any other linear function of metabolic fluxes tends to significantly reduce the number of active metabolic reactions compared to typical non-optimal states. The reduced number appears to be constant across the microbial species studied and just slightly larger than the minimum number required for the organism to grow at all. We show that this massive spontaneous reaction silencing is triggered by the irreversibility of a large fraction of the metabolic reactions and propagates through the network as a cascade of inactivity. Our results help explain existing experimental data on intracellular flux measurements and the usage of latent pathways, shedding new light on microbial evolution, robustness, and versatility for the execution of specific biochemical tasks. In particular, the identification of optimal reaction activity provides rigorous ground for an intriguing knockout-based method recently proposed for the synthetic recovery of metabolic function.

q-bio.MN↗

arXiv2008

Master Stability Functions for Coupled Near-Identical Dynamical Systems

We derive a master stability function (MSF) for synchronization in networks of coupled dynamical systems with small but arbitrary parametric variations. Analogous to the MSF for identical systems, our generalized MSF simultaneously solves the linear stability problem for near-synchronous states (NSS) for all possible connectivity structures. We also derive a general sufficient condition for stable near-synchronization and show that the synchronization error scales linearly with the magnitude of parameter variations.Our analysis underlines significant roles played by the Laplacian eigenvectors in the study of network synchronization of near-identical systems.

nlin.CD↗

arXiv2008

Synchronization Stability of Coupled Near-Identical Oscillator Network

We derive variational equations to analyze the stability of synchronization for coupled near-identical oscillators. To study the effect of parameter mismatch on the stability in a general fashion, we define master stability equations and associated master stability functions, which are independent of the network structure. In particular, we present several examples of coupled near-identical Lorenz systems configured in small networks (a ring graph and sequence networks) with a fixed parameter mismatch and a large Barabasi-Albert scale-free network with random parameter mismatch. We find that several different network architectures permit similar results despite various mismatch patterns.

nlin.CD↗

arXiv2008

Sequence Nets

We study a new class of networks, generated by sequences of letters taken from a finite alphabet consisting of $m$ letters (corresponding to $m$ types of nodes) and a fixed set of connectivity rules. Recently, it was shown how a binary alphabet might generate threshold nets in a similar fashion [Hagberg et al., Phys. Rev. E 74, 056116 (2006)]. Just like threshold nets, sequence nets in general possess a modular structure reminiscent of everyday life nets, and are easy to handle analytically (i.e., calculate degree distribution, shortest paths, betweenness centrality, etc.). Exploiting symmetry, we make a full classification of two- and three-letter sequence nets, discovering two new classes of two-letter sequence nets. The new sequence nets retain many of the desirable analytical properties of threshold nets while yielding richer possibilities for the modeling of everyday life complex networks more faithfully.

cond-mat.dis-nn↗

arXiv2006

Maximum Performance at Minimum Cost in Network Synchronization

We consider two optimization problems on synchronization of oscillator networks: maximization of synchronizability and minimization of synchronization cost. We first develop an extension of the well-known master stability framework to the case of non-diagonalizable Laplacian matrices. We then show that the solution sets of the two optimization problems coincide and are simultaneously characterized by a simple condition on the Laplacian eigenvalues. Among the optimal networks, we identify a subclass of hierarchical networks, characterized by the absence of feedback loops and the normalization of inputs. We show that most optimal networks are directed and non-diagonalizable, necessitating the extension of the framework. We also show how oriented spanning trees can be used to explicitly and systematically construct optimal networks under network topological constraints. Our results may provide insights into the evolutionary origin of structures in complex networks for which synchronization plays a significant role.

cond-mat.dis-nn↗

arXiv2006

Synchronization is optimal in non-diagonalizable networks

We consider the problem of maximizing the synchronizability of oscillator networks by assigning weights and directions to the links of a given interaction topology. We first extend the well-known master stability formalism to the case of non-diagonalizable networks. We then show that, unless some oscillator is connected to all the others, networks of maximum synchronizability are necessarily non-diagonalizable and can always be obtained by imposing unidirectional information flow with normalized input strengths. The extension makes the formalism applicable to all possible network structures, while the maximization results provide insights into hierarchical structures observed in complex networks in which synchronization plays a significant role.

cond-mat.dis-nn↗

arXiv2004

Universality in active chaos

Many examples of chemical and biological processes take place in large-scale environmental flows. Such flows generate filamental patterns which are often fractal due to the presence of chaos in the underlying advection dynamics. In such processes, hydrodynamical stirring strongly couples into the reactivity of the advected species and might thus make the traditional treatment of the problem through partial differential equations difficult. Here we present a simple approach for the activity in in-homogeneously stirred flows. We show that the fractal patterns serving as skeletons and catalysts lead to a rate equation with a universal form that is independent of the flow, of the particle properties, and of the details of the active process. One aspect of the universality of our appraoch is that it also applies to reactions among particles of finite size (so-called inertial particles).

nlin.CD↗

arXiv2003

Large-scale structural organization of social networks

The characterization of large-scale structural organization of social networks is an important interdisciplinary problem. We show, by using scaling analysis and numerical computation, that the following factors are relevant for models of social networks: the correlation between friendship ties among people and the position of their social groups, as well as the correlation between the positions of different social groups to which a person belongs.

cond-mat.dis-nn↗