Searcharxiv⌕ Search

arXiv subjects

A. Diaz-Guilera

Publications and source records attributed to A. Diaz-Guilera.

16 recordsLinked to original sources
arXiv2003

Nonequilibrium phase transition in a model for the propagation of innovations among economic agents

We characterize the different morphological phases that occur in a simple one-dimensional model of propagation of innovations among economic agents [X.\ Guardiola, {\it et. al.}, Phys. Rev E {\bf 66}, 026121 (2002)]. We show that the model can be regarded as a nonequilibrium surface growth model. This allows us to demonstrate the presence of a continuous roughening transition between a flat (system size independent fluctuations) and a rough phase (system size dependent fluctuations). Finite-size scaling studies at the transition strongly suggest that the dynamic critical transition does not belong to directed percolation and, in fact, critical exponents do not seem to fit in any of the known universality classes of nonequilibrium phase transitions. Finally, we present an explanation for the occurrence of the roughening transition and argue that avalanche driven dynamics is responsible for the novel critical behavior.

cond-mat.stat-mech↗
arXiv2002

Self-similar community structure in organisations

The formal chart of an organisation is designed to handle routine and easily anticipated problems, but unexpected situations arise which require the formation of new ties so that the corresponding extra tasks can be properly accomplished. The characterisation of the structure of such informal networks behind the formal chart is a key element for successful management. We analyse the complex e-mail network of a real organisation with about 1,700 employees and determine its community structure. Our results reveal the emergence of self-similar properties that suggest that some universal mechanism could be the underlying driving force in the formation and evolution of informal networks in organisations, as happens in other self-organised complex systems.

cond-mat.dis-nn↗
arXiv2002

Optimal network topologies for local search with congestion

The problem of searchability in decentralized complex networks is of great importance in computer science, economy and sociology. We present a formalism that is able to cope simultaneously with the problem of search and the congestion effects that arise when parallel searches are performed, and obtain expressions for the average search cost--written in terms of the search algorithm and the topological properties of the network--both in presence and abscence of congestion. This formalism is used to obtain optimal network structures for a system using a local search algorithm. It is found that only two classes of networks can be optimal: star-like configurations, when the number of parallel searches is small, and homogeneous-isotropic configurations, when the number of parallel searches is large.

cond-mat.dis-nn↗
arXiv2002

Macro- and micro-structure of trust networks

A challenging problem in the social sciences is the characterization of the formation of ``social capital''. It is believed that societies with more social capital are more democratic and economically developed than societies with little social capital. However, social capital is a concept hard to quantify and measure in a ``real-word'' context. Here, we take advantage of an existing "web of trust'' between users of the "Pretty-Good-Privacy" (PGP) encryption algorithm, which is used in digital communication to ``sign'' documents so that the recipient knows for sure who the author is. Our analysis reveals the coexistence in the web of trust of a macro scale-free structure with micro strongly-connected cells in a complex network. We also show that when this network is intentionally attacked the scale-free structure rapidly disintegrates and that the resulting network is partitioned into a large number of small strongly-connected cells that are resilient to the intentional attack.

cond-mat.dis-nn↗
arXiv2002

Dynamical properties of model communication networks

We study the dynamical properties of a collection of models for communication processes, characterized by a single parameter $ξ$ representing the relation between information load of the nodes and its ability to deliver this information. The critical transition to congestion reported so far occurs only for $ξ=1$. This case is well analyzed for different network topologies. We focus of the properties of the order parameter, the susceptibility and the time correlations when approaching the critical point. For $ξ<1$ no transition to congestion is observed but it remains a cross-over from a low-density to a high-density state. For $ξ>1$ the transition to congestion is discontinuous and congestion nuclei arise.

cond-mat.stat-mech↗
arXiv2002

Modelling diffusion of innovations in a social network

A new simple model of diffusion of innovations in a social network with upgrading costs is introduced. Agents are characterized by a single real variable, their technological level. According to local information agents decide whether to upgrade their level or not balancing their possible benefit with the upgrading cost. A critical point where technological avalanches display a power-law behavior is also found. This critical point is characterized by a macroscopic observable that turns out to optimize technological growth in the stationary state. Analytical results supporting our findings are found for the globally coupled case.

cond-mat.stat-mech↗
arXiv2001

Self-organized criticality in evolutionary systems with local interaction

This paper studies a stylized model of local interaction where agents choose from an ever increasing set of vertically ranked actions, e.g. technologies. The driving forces of the model are infrequent upward shifts (``updates''), followed by a rapid process of local imitation (``diffusion''). Our main focus is on the regularities displayed by the long-run distribution of diffusion waves and their implication on the performance of the system. By integrating analytical techniques and numerical simulations, we come to the following two main conclusions. (1) If dis-coordination costs are sufficiently high, the system behaves critically, in the sense customarily used in physics. (2) The performance of the system is optimal at the frontier of the critical region. Heuristically, this may be interpreted as an indication that (performance-sensitive) evolutionary forces induce the system to be placed ``at the edge of order and chaos''

cond-mat.stat-mech↗
arXiv2001

Communication and optimal hierarchical networks

We study a general and simple model for communication processes. In the model, agents in a network (in particular, an organization) interchange information packets following simple rules that take into account the limited capability of the agents to deal with packets and the cost associated to the existence of open communication channels. Due to the limitation in the capability, the network collapses under certain conditions. We focus on when the collapse occurs for hierarchical networks and also on the influence of the flatness or steepness of the structure. We find that the need for hierarchy is related to the existence of costly connections.

cond-mat.stat-mech↗
arXiv2001

Communication in networks with hierarchical branching

We present a simple model of communication in networks with hierarchical branching. We analyze the behavior of the model from the viewpoint of critical systems under different situations. For certain values of the parameters, a continuous phase transition between a sparse and a congested regime is observed and accurately described by an order parameter and the power spectra. At the critical point the behavior of the model is totally independent of the number of hierarchical levels. Also scaling properties are observed when the size of the system varies. The presence of noise in the communication is shown to break the transition. Despite the simplicity of the model, the analytical results are a useful guide to forecast the main features of real networks.

cond-mat.stat-mech↗
arXiv2000

Synchronization, Diversity, and Topology of Networks of Integrate and Fire Oscillators

We study synchronization dynamics of a population of pulse-coupled oscillators. In particular, we focus our attention in the interplay between networks topological disorder and its synchronization features. Firstly, we analyze synchronization time $T$ in random networks, and find a scaling law which relates $T$ to networks connectivity. Then, we carry on comparing synchronization time for several other topological configurations, characterized by a different degree of randomness. The analysis shows that regular lattices perform better than any other disordered network. The fact can be understood by considering the variability in the number of links between two adjacent neighbors. This phenomenon is equivalent to have a non-random topology with a distribution of interactions and it can be removed by an adequate local normalization of the couplings.

cond-mat.stat-mech↗
arXiv1999

Pattern selection in a lattice of pulse-coupled oscillators

We study spatio-temporal pattern formation in a ring of N oscillators with inhibitory unidirectional pulselike interactions. The attractors of the dynamics are limit cycles where each oscillator fires once and only once. Since some of these limit cycles lead to the same pattern, we introduce the concept of pattern degeneracy to take it into account. Moreover, we give a qualitative estimation of the volume of the basin of attraction of each pattern by means of some probabilistic arguments and pattern degeneracy, and show how are they modified as we change the value of the coupling strength. In the limit of small coupling, our estimative formula gives a perfect agreement with numerical simulations.

cond-mat.stat-mech↗
arXiv1999

Self-organized evolution in socio-economic environments

We propose a general scenario to analyze social and economic changes in modern environments. We illustrate the ideas with a model that incorporating the main trends is simple enough to extract analytical results and, at the same time, sufficiently complex to display a rich dynamic behavior. Our study shows that there exists a macroscopic observable that is maximized in a regime where the system is critical, in the sense that the distribution of events follow power-laws. Computer simulations show that, in addition, the system always self-organizes to achieve the optimal performance in the stationary state.

cond-mat.stat-mech↗
arXiv1998

Synchronization in a ring of pulsating oscillators with bidirectional couplings

We study the dynamical behavior of an ensemble of oscillators interacting through short range bidirectional pulses. The geometry is 1D with periodic boundary conditions. Our interest is twofold. To explore the conditions required to reach fully synchronization and to invewstigate the time needed to get such state. We present both theoretical and numerical results.

cond-mat.stat-mech↗
arXiv1994

Scaling Relations and Exponents in the Growth of Rough Interfaces Through Random Media

The growth of a rough interface through a random media is modelled by a continuous stochastic equation with a quenched noise. By use of the Novikov theorem we can transform the dependence of the noise on the interface height into an effective temporal correlation for different regimes of the evolution of the interface. The exponents characterizing the roughness of the interface can thus be computed by simple scaling arguments showing a good agreement with recent experiments and numerical simulations.

cond-mat↗
arXiv1994

Self-organized criticality and synchronization in a lattice model of integrate-and-fire oscillators

We introduce two coupled map lattice models with nonconservative interactions and a continuous nonlinear driving. Depending on both the degree of conservation and the convexity of the driving we find different behaviors, ranging from self-organized criticality, in the sense that the distribution of events (avalanches) obeys a power law, to a macroscopic synchronization of the population of oscillators, with avalanches of the size of the system.

cond-mat↗