arXiv subjects

Adilson E. Motter

Publications and source records attributed to Adilson E. Motter.

140 records · Page 8Linked to original sources

arXiv2005

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.

cond-mat.dis-nn↗

arXiv2004

Cascade control and defense in complex networks

Complex networks with 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.

cond-mat.dis-nn↗

arXiv2004

Enhancing complex-network synchronization

Heterogeneity in the degree (connectivity) distribution has been shown to suppress synchronization in networks of symmetrically coupled oscillators with uniform coupling strength (unweighted coupling). Here we uncover a condition for enhanced synchronization in directed networks with weighted coupling. We show that, in the optimum regime, synchronizability is solely determined by the average degree and does not depend on the system size and the details of the degree distribution. In scale-free networks, where the average degree may increase with heterogeneity, synchronizability is drastically enhanced and may become positively correlated with heterogeneity, while the overall cost involved in the network coupling is significantly reduced as compared to the case of unweighted coupling.

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

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.

gr-qc↗

arXiv2003

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.

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↗

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

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.

cond-mat.dis-nn↗

arXiv2003

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.

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↗

arXiv2002

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.

cond-mat.dis-nn↗

arXiv2002

Cusp-scaling behavior in fractal dimension of chaotic scattering

A topological bifurcation in chaotic scattering is characterized by a sudden change in the topology of the infinite set of unstable periodic orbits embedded in the underlying chaotic invariant set. We uncover a scaling law for the fractal dimension of the chaotic set for such a bifurcation. Our analysis and numerical computations in both two- and three-degrees-of-freedom systems suggest a striking feature associated with these subtle bifurcations: the dimension typically exhibits a sharp, cusplike local minimum at the bifurcation.

nlin.CD↗