Intermittency in the Fisher's droplet model

Intermittent behaviour of fragment multiplicity distributions in the nuclear liquid-gas phase transition is studied in terms of the droplet model of Fisher. The anomalous fractal dimensions are compared with data on heavy ion reactions and classical molecular dynamics simulations. A signature of the transition in the anomalous fractal dimensions is shown.We thank Profs. S. Ayik, M. Di Toro and V. Kondratyev for discussions. One of us (T.K.) acknowledges the support of INFN-LNS.     

Power-law time distribution of large earthquakes

We study the statistical properties of time distribution of seismicity in California by means of a new method of analysis, the diffusion entropy. We find that the distribution of time intervals between a large earthquake (the main shock of a given seismic sequence) and the next one does not obey Poisson statistics, as assumed by the current models. We prove that this distribution is an inverse power law with an exponent mu=2.06+/-0.01. We propose the long-range model, reproducing the main properties of the diffusion entropy and describing the seismic triggering mechanisms induced by large earthquakes.     

Compromise and synchronization in opinion dynamics

We discuss two models of opinion dynamics. We first present a brief review of the Hegselmann and Krause (HK) compromise model in two dimensions, showing that it is possible to simulate the dynamics in the limit of an infinite number of agents by solving numerically a rate equation for a continuum distribution of opinions. Then, we discuss the Opinion Changing Rate (OCR) model, which allows to study under which conditions a group of agents with a different natural tendency (rate) to change opinion can find the agreement. In the context of the this model, consensus is viewed as a synchronization process.     

Components in time-varying graphs

Real complex systems are inherently time-varying. Thanks to new communication systems and novel technologies, today it is possible to produce and analyze social and biological networks with detailed information on the time of occurrence and duration of each link. However, standard graph metrics introduced so far in complex network theory are mainly suited for static graphs, i.e., graphs in which the links do not change over time, or graphs built from time-varying systems by aggregating all the links as if they were concurrent in time. In this paper, we extend the notion of connectedness, and the definitions of node and graph components, to the case of time-varying graphs, which are represented as time-ordered sequences of graphs defined over a fixed set of nodes. We show that the problem of finding strongly connected components in a time-varying graph can be mapped into the problem of discovering the maximal-cliques in an opportunely constructed static graph, which we name the affine graph. It is, therefore, an NP-complete problem. As a practical example, we have performed a temporal component analysis of time-varying graphs constructed from three data sets of human interactions. The results show that taking time into account in the definition of graph components allows to capture important features of real systems. In particular, we observe a large variability in the size of node temporal in- and out-components. This is due to intrinsic fluctuations in the activity patterns of individuals, which cannot be detected by static graph analysis.     

Scaling breakdown in flow fluctuations on complex networks

We propose a model of random diffusion to investigate flow fluctuations in complex networks. We derive an analytical law showing that the dependence of fluctuations with the mean traffic in a network is ruled by the delicate interplay of three factors, respectively, of dynamical, topological and statistical nature. In particular, we demonstrate that the existence of a power-law scaling characterizing the flow fluctuations at every node in the network cannot be claimed. We show the validity of this scaling breakdown under quite general topological and dynamical situations by means of different traffic algorithms and by analyzing real data.     

Emerging meso- and macroscales from synchronization of adaptive networks

We consider a set of interacting phase oscillators, with a coupling between synchronized nodes adaptively reinforced, and the constraint of a limited resource for a node to establish connections with the other units of the network. We show that such a competitive mechanism leads to the emergence of a rich modular structure underlying cluster synchronization, and to a scale-free distribution for the connection strengths of the units.     

Communities recognition in the Chesapeake Bay ecosystem by dynamical clustering algorithms based on different oscillators systems

We have recently introduced [Phys. Rev. E 75, 045102(R) (2007); AIP Conference Proceedings 965, 2007, p. 323] an efficient method for the detection and identification of modules in complex networks, based on the de-synchronization properties (dynamical clustering) of phase oscillators. In this paper we apply the dynamical clustering tecnique to the identification of communities of marine organisms living in the Chesapeake Bay food web. We show that our algorithm is able to perform a very reliable classification of the real communities existing in this ecosystem by using different kinds of dynamical oscillators. We compare also our results with those of other methods for the detection of community structures in complex networks.     

Social Cohesion, Structural Holes, and a Tale of Two Measures

In the social sciences, the debate over the structural foundations of social capital has long vacillated between two positions on the relative benefits associated with two types of social structures: closed structures, rich in third-party relationships, and open structures, rich in structural holes and brokerage opportunities. In this paper, we engage with this debate by focusing on the measures typically used for formalising the two conceptions of social capital: clustering and effective size. We show that these two measures are simply two sides of the same coin, as they can be expressed one in terms of the other through a simple functional relation. Building on this relation, we then attempt to reconcile closed and open structures by proposing a new measure, Simmelian brokerage, that captures opportunities of brokerage between otherwise disconnected cohesive groups of contacts. Implications of our findings for research on social capital and complex networks are discussed.     

Traffic optimization in transport networks based on local routing

Congestion in transport networks is a topic of theoretical interest and practical importance. In this paper we study the flow of vehicles in urban street networks. In particular, we use a cellular automata model on a complex network to simulate the motion of vehicles along streets, coupled with a congestion-aware routing at street crossings. Such routing makes use of the knowledge of agents about traffic in nearby roads and allows the vehicles to dynamically update the routes towards their destinations. By implementing the model in real urban street patterns of various cities, we show that it is possible to achieve a global traffic optimization based on local agent decisions.