21,131 research outputs found
Collective decision-making on triadic graphs
Many real-world networks exhibit community structures and non-trivial clustering associated with the occurrence of a considerable number of triangular subgraphs known as triadic motifs. Triads are a set of distinct triangles that do not share an edge with any other triangle in the network. Network motifs are subgraphs that occur significantly more often compared to random topologies. Two prominent examples, the feedforward loop and the feedback loop, occur in various real-world networks such as gene-regulatory networks, food webs or neuronal networks. However, as triangular connections are also prevalent in communication topologies of complex collective systems, it is worthwhile investigating the influence of triadic motifs on the collective decision-making dynamics. To this end, we generate networks called Triadic Graphs (TGs) exclusively from distinct triadic motifs. We then apply TGs as underlying topologies of systems with collective dynamics inspired from locust marching bands. We demonstrate that the motif type constituting the networks can have a paramount influence on group decision-making that cannot be explained solely in terms of the degree distribution. We find that, in contrast to the feedback loop, when the feedforward loop is the dominant subgraph, the resulting network is hierarchical and inhibits coherent behavior
Synchronizability determined by coupling strengths and topology on Complex Networks
We investigate in depth the synchronization of coupled oscillators on top of
complex networks with different degrees of heterogeneity within the context of
the Kuramoto model. In a previous paper [Phys. Rev. Lett. 98, 034101 (2007)],
we unveiled how for fixed coupling strengths local patterns of synchronization
emerge differently in homogeneous and heterogeneous complex networks. Here, we
provide more evidence on this phenomenon extending the previous work to
networks that interpolate between homogeneous and heterogeneous topologies. We
also present new details on the path towards synchronization for the evolution
of clustering in the synchronized patterns. Finally, we investigate the
synchronization of networks with modular structure and conclude that, in these
cases, local synchronization is first attained at the most internal level of
organization of modules, progressively evolving to the outer levels as the
coupling constant is increased. The present work introduces new parameters that
are proved to be useful for the characterization of synchronization phenomena
in complex networks.Comment: 11 pages, 10 figures and 1 table. APS forma
A Multilevel Approach to Topology-Aware Collective Operations in Computational Grids
The efficient implementation of collective communiction operations has
received much attention. Initial efforts produced "optimal" trees based on
network communication models that assumed equal point-to-point latencies
between any two processes. This assumption is violated in most practical
settings, however, particularly in heterogeneous systems such as clusters of
SMPs and wide-area "computational Grids," with the result that collective
operations perform suboptimally. In response, more recent work has focused on
creating topology-aware trees for collective operations that minimize
communication across slower channels (e.g., a wide-area network). While these
efforts have significant communication benefits, they all limit their view of
the network to only two layers. We present a strategy based upon a multilayer
view of the network. By creating multilevel topology-aware trees we take
advantage of communication cost differences at every level in the network. We
used this strategy to implement topology-aware versions of several MPI
collective operations in MPICH-G2, the Globus Toolkit[tm]-enabled version of
the popular MPICH implementation of the MPI standard. Using information about
topology provided by MPICH-G2, we construct these multilevel topology-aware
trees automatically during execution. We present results demonstrating the
advantages of our multilevel approach by comparing it to the default
(topology-unaware) implementation provided by MPICH and a topology-aware
two-layer implementation.Comment: 16 pages, 8 figure
Synchronization in complex networks
Synchronization processes in populations of locally interacting elements are
in the focus of intense research in physical, biological, chemical,
technological and social systems. The many efforts devoted to understand
synchronization phenomena in natural systems take now advantage of the recent
theory of complex networks. In this review, we report the advances in the
comprehension of synchronization phenomena when oscillating elements are
constrained to interact in a complex network topology. We also overview the new
emergent features coming out from the interplay between the structure and the
function of the underlying pattern of connections. Extensive numerical work as
well as analytical approaches to the problem are presented. Finally, we review
several applications of synchronization in complex networks to different
disciplines: biological systems and neuroscience, engineering and computer
science, and economy and social sciences.Comment: Final version published in Physics Reports. More information
available at http://synchronets.googlepages.com
Complex networks analysis in socioeconomic models
This chapter aims at reviewing complex networks models and methods that were
either developed for or applied to socioeconomic issues, and pertinent to the
theme of New Economic Geography. After an introduction to the foundations of
the field of complex networks, the present summary adds insights on the
statistical mechanical approach, and on the most relevant computational aspects
for the treatment of these systems. As the most frequently used model for
interacting agent-based systems, a brief description of the statistical
mechanics of the classical Ising model on regular lattices, together with
recent extensions of the same model on small-world Watts-Strogatz and
scale-free Albert-Barabasi complex networks is included. Other sections of the
chapter are devoted to applications of complex networks to economics, finance,
spreading of innovations, and regional trade and developments. The chapter also
reviews results involving applications of complex networks to other relevant
socioeconomic issues, including results for opinion and citation networks.
Finally, some avenues for future research are introduced before summarizing the
main conclusions of the chapter.Comment: 39 pages, 185 references, (not final version of) a chapter prepared
for Complexity and Geographical Economics - Topics and Tools, P.
Commendatore, S.S. Kayam and I. Kubin Eds. (Springer, to be published
MAGDA: A Mobile Agent based Grid Architecture
Mobile agents mean both a technology
and a programming paradigm. They allow for a
flexible approach which can alleviate a number
of issues present in distributed and Grid-based
systems, by means of features such as migration,
cloning, messaging and other provided mechanisms.
In this paper we describe an architecture
(MAGDA – Mobile Agent based Grid Architecture)
we have designed and we are currently
developing to support programming and execution
of mobile agent based application upon Grid
systems
Griffiths phases in infinite-dimensional, non-hierarchical modular networks
Griffiths phases (GPs), generated by the heterogeneities on modular networks,
have recently been suggested to provide a mechanism, rid of fine parameter
tuning, to explain the critical behavior of complex systems. One conjectured
requirement for systems with modular structures was that the network of modules
must be hierarchically organized and possess finite dimension. We investigate
the dynamical behavior of an activity spreading model, evolving on
heterogeneous random networks with highly modular structure and organized
non-hierarchically. We observe that loosely coupled modules act as effective
rare-regions, slowing down the extinction of activation. As a consequence, we
find extended control parameter regions with continuously changing dynamical
exponents for single network realizations, preserved after finite size
analyses, as in a real GP. The avalanche size distributions of spreading events
exhibit robust power-law tails. Our findings relax the requirement of
hierarchical organization of the modular structure, which can help to
rationalize the criticality of modular systems in the framework of GPs.Comment: 14 pages, 8 figure
- …