PubMed Health⌕ Search

Biomedical subjects

Adilson E Motter

Publications and source records attributed to Adilson E Motter.

At least 19 recordsLinked to original sources

Synchronization is optimal in nondiagonalizable networks.

We consider maximization of the synchronizability of oscillator networks by assigning weights and directions to the links of a given interaction topology. By extending the master stability formalism to all possible network structures, we show that, unless some oscillator is linked to all the others, maximally synchronizable networks are necessarily nondiagonalizable and can always be obtained by imposing unidirectional information flow with normalized input strengths. The results provide insights into hierarchical structures observed in complex networks in which synchronization is important.

Journal Article↗

Stickiness in Hamiltonian systems: from sharply divided to hierarchical phase space.

We investigate the dynamics of chaotic trajectories in simple yet physically important Hamiltonian systems with nonhierarchical borders between regular and chaotic regions with positive measures. We show that the stickiness to the border of the regular regions in systems with such a sharply divided phase space occurs through one-parameter families of marginally unstable periodic orbits and is characterized by an exponent gamma=2 for the asymptotic power-law decay of the distribution of recurrence times. Generic perturbations lead to systems with hierarchical phase space, where the stickiness is apparently enhanced due to the presence of infinitely many regular islands and Cantori. In this case, we show that the distribution of recurrence times can be composed of a sum of exponentials or a sum of power laws, depending on the relative contribution of the primary and secondary structures of the hierarchy. Numerical verification of our main results are provided for area-preserving maps, mushroom billiards, and the newly defined magnetic mushroom billiards.

Journal Article↗

Universality in the synchronization of weighted random networks.

Realistic networks display not only a complex topological structure, but also a heterogeneous distribution of weights in the connection strengths. Here we study synchronization in weighted complex networks and show that the synchronizability of random networks with a large minimum degree is determined by two leading parameters: the mean degree and the heterogeneity of the distribution of node's intensity, where the intensity of a node, defined as the total strength of input connections, is a natural combination of topology and weights. Our results provide a possibility for the control of synchronization in complex networks by the manipulation of a few parameters.

Journal Article↗

Effective dynamics in Hamiltonian systems with mixed phase space.

An adequate characterization of the dynamics of Hamiltonian systems at physically relevant scales has been largely lacking. Here we investigate this fundamental problem and we show that the finite-scale Hamiltonian dynamics is governed by effective dynamical invariants, which are significantly different from the dynamical invariants that describe the asymptotic Hamiltonian dynamics. The effective invariants depend both on the scale of resolution and the region of the phase space under consideration, and they are naturally interpreted within a framework in which the nonhyperbolic dynamics of the Hamiltonian system is modeled as a chain of hyperbolic systems.

Journal Article↗

Network synchronization, diffusion, and the paradox of heterogeneity.

Many complex networks display strong heterogeneity in the degree (connectivity) distribution. Heterogeneity in the degree distribution often reduces the average distance between nodes but, paradoxically, may suppress synchronization in networks of oscillators coupled symmetrically with uniform coupling strength. Here we offer a solution to this apparent paradox. Our analysis is partially based on the identification of a diffusive process underlying the communication between oscillators and reveals a striking relation between this process and the condition for the linear stability of the synchronized states. We show that, for a given degree distribution, the maximum synchronizability is achieved when the network of couplings is weighted and directed and the overall cost involved in the couplings is minimum. This enhanced synchronizability is solely determined by the mean degree and does not depend on the degree distribution and system size. Numerical verification of the main results is provided for representative classes of small-world and scale-free networks.

Journal Article↗

Stickiness in mushroom billiards.

We investigate the dynamical properties of chaotic trajectories in mushroom billiards. These billiards present a well-defined simple border between a single regular region and a single chaotic component. We find that the stickiness of chaotic trajectories near the border of the regular region occurs through an infinite number of marginally unstable periodic orbits. These orbits have zero measure, thus not affecting the ergodicity of the chaotic region. Notwithstanding, they govern the main dynamical properties of the system. In particular, we show that the marginally unstable periodic orbits explain the periodicity and the power-law behavior with exponent gamma=2 observed in the distribution of recurrence times.

Adhesiveness↗

Cascade control and defense in complex networks.

Complex networks with a heterogeneous distribution of loads may undergo a global cascade of overload failures when highly loaded nodes or edges are removed due to attacks or failures. Since a small attack or failure has the potential to trigger a global cascade, a fundamental question regards the possible strategies of defense to prevent the cascade from propagating through the entire network. Here we introduce and investigate a costless strategy of defense based on a selective further removal of nodes and edges, right after the initial attack or failure. This intentional removal of network elements is shown to drastically reduce the size of the cascade.

Biophysics↗

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 inhomogeneously 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 approach is that it also applies to reactions among particles of finite size (so-called inertial particles).

Computer Simulation↗

Relativistic chaos is coordinate invariant.

The noninvariance of Lyapunov exponents in general relativity has led to the conclusion that chaos depends on the choice of the space-time coordinates. Strikingly, we uncover the transformation laws of Lyapunov exponents under general space-time transformations and we find that chaos, as characterized by positive Lyapunov exponents, is coordinate invariant. As a result, the previous conclusion regarding the noninvariance of chaos in cosmology, a major claim about chaos in general relativity, necessarily involves the violation of hypotheses required for a proper definition of the Lyapunov exponents.

Journal Article↗

Reactive dynamics of inertial particles in nonhyperbolic chaotic flows.

Anomalous kinetics of infective (e.g., autocatalytic) reactions in open, nonhyperbolic chaotic flows are important for many applications in biological, chemical, and environmental sciences. We present a scaling theory for the singular enhancement of the production caused by the universal, underlying fractal patterns. The key dynamical invariant quantities are the effective fractal dimension and effective escape rate, which are primarily determined by the hyperbolic components of the underlying dynamical invariant sets. The theory is general as it includes all previously studied hyperbolic reactive dynamics as a special case. We introduce a class of dissipative embedding maps for numerical verification.

Journal Article↗

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.

Journal Article↗

Searching in small-world networks.

We study the average time it takes to find a desired node in the Watts-Strogatz family of networks. We consider the case when the look-up time can be neglected and when it is important, where the look-up time is the time needed to choose one among all the neighboring nodes of a node at each step in the search. We show that in both cases, the search time is minimum in the small-world regime, when an appropriate distance between the nodes is defined. Through an analytical model, we show that the search time scales as N(1/D(D+1)) for small-world networks, where N is the number of nodes and D is the dimension of the underlying lattice. This model is shown to be in agreement with numerical simulations.

Journal Article↗

Signatures of small-world and scale-free properties in large computer programs.

A large computer program is typically divided into many hundreds or even thousands of smaller units, whose logical connections define a network in a natural way. This network reflects the internal structure of the program, and defines the "information flow" within the program. We show that (1) due to its growth in time this network displays a scale-free feature in that the probability of the number of links at a node obeys a power-law distribution, and (2) as a result of performance optimization of the program the network has a small-world structure. We believe that these features are generic for large computer programs. Our work extends the previous studies on growing networks, which have mostly been for physical networks, to the domain of computer software.

Journal Article↗

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.

Journal Article↗

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.

Journal Article↗

Cascade-based attacks on complex networks.

We live in a modern world supported by large, complex networks. Examples range from financial markets to communication and transportation systems. In many realistic situations the flow of physical quantities in the network, as characterized by the loads on nodes, is important. We show that for such networks where loads can redistribute among the nodes, intentional attacks can lead to a cascade of overload failures, which can in turn cause the entire or a substantial part of the network to collapse. This is relevant for real-world networks that possess a highly heterogeneous distribution of loads, such as the Internet and power grids. We demonstrate that the heterogeneity of these networks makes them particularly vulnerable to attacks in that a large-scale cascade may be triggered by disabling a single key node. This brings obvious concerns on the security of such systems.

Journal Article↗

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" node, 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.

Journal Article↗

Topology of the conceptual network of language.

We define two words in a language to be connected if they express similar concepts. The network of connections among the many thousands of words that make up a language is important not only for the study of the structure and evolution of languages, but also for cognitive science. We study this issue quantitatively, by mapping out the conceptual network of the English language, with the connections being defined by the entries in a Thesaurus dictionary. We find that this network presents a small-world structure, with an amazingly small average shortest path, and appears to exhibit an asymptotic scale-free feature with algebraic connectivity distribution.

Journal Article↗