arXiv subjects

Albert Diaz-Guilera

Publications and source records attributed to Albert Diaz-Guilera.

At least 37 records · Page 2Linked to original sources

arXiv2009

Synchronization in symmetric bipolar population networks

We analyze populations of Kuramoto oscillators with a particular distribution of natural frequencies. Inspired by networks where there are two groups of nodes with opposite behaviors, as for instance in power-grids where energy is either generated or consumed at different locations, we assume that the frequencies can take only two different values. Correlations between the value of the frequency of a given node and its topological localization are considered in both regular and random topologies. Synchronization is enhanced when nodes are surrounded by nodes of the opposite frequency. We find analytical estimations for the minimum value of the coupling strength between oscillators that guarantees the achievement of a globally synchronized state, getting a very good agreement with the numerical simulations.

nlin.PS↗

arXiv2009

Universal Complex Structures in Written Language

Quantitative linguistics has provided us with a number of empirical laws that characterise the evolution of languages and competition amongst them. In terms of language usage, one of the most influential results is Zipf's law of word frequencies. Zipf's law appears to be universal, and may not even be unique to human language. However, there is ongoing controversy over whether Zipf's law is a good indicator of complexity. Here we present an alternative approach that puts Zipf's law in the context of critical phenomena (the cornerstone of complexity in physics) and establishes the presence of a large scale "attraction" between successive repetitions of words. Moreover, this phenomenon is scale-invariant and universal -- the pattern is independent of word frequency and is observed in texts by different authors and written in different languages. There is evidence, however, that the shape of the scaling relation changes for words that play a key role in the text, implying the existence of different "universality classes" in the repetition of words. These behaviours exhibit striking parallels with complex catastrophic phenomena.

physics.soc-ph↗

arXiv2009

On the rich-club effect in dense and weighted networks

For many complex networks present in nature only a single instance, usually of large size, is available. Any measurement made on this single instance cannot be repeated on different realizations. In order to detect significant patterns in a real--world network it is therefore crucial to compare the measured results with a null model counterpart. Here we focus on dense and weighted networks, proposing a suitable null model and studying the behaviour of the degree correlations as measured by the rich-club coefficient. Our method solves an existing problem with the randomization of dense unweighted graphs, and at the same time represents a generalization of the rich--club coefficient to weighted networks which is complementary to other recently proposed ones.

physics.soc-ph↗

arXiv2008

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.

physics.soc-ph↗

arXiv2008

Synchronization in Random Geometric Graphs

In this paper we study the synchronization properties of random geometric graphs. We show that the onset of synchronization takes place roughly at the same value of the order parameter that a random graph with the same size and average connectivity. However, the dependence of the order parameter with the coupling strength indicates that the fully synchronized state is more easily attained in random graphs. We next focus on the complete synchronized state and show that this state is less stable for random geometric graphs than for other kinds of complex networks. Finally, a rewiring mechanism is proposed as a way to improve the stability of the fully synchronized state as well as to lower the value of the coupling strength at which it is achieved. Our work has important implications for the synchronization of wireless networks, and should provide valuable insights for the development and deployment of more efficient and robust distributed synchronization protocols for these systems.

physics.soc-ph↗

arXiv2008

Impact of community structure on information transfer

The observation that real complex networks have internal structure has important implication for dynamic processes occurring on such topologies. Here we investigate the impact of community structure on a model of information transfer able to deal with both search and congestion simultaneously. We show that networks with fuzzy community structure are more efficient in terms of packet delivery that those with pronounced community structure. We also propose an alternative packet routing algorithm which takes advantage of the knowledge of communities to improve information transfer and show that in the context of the model an intermediate level of community structure is optimal. Finally, we show that in a hierarchical network setting, providing knowledge of communities at the level of highest modularity will improve network capacity by the largest amount.

physics.soc-ph↗

arXiv2006

Synchronization and modularity in complex networks

We investigate the connection between the dynamics of synchronization and the modularity on complex networks. Simulating the Kuramoto's model in complex networks we determine patterns of meta-stability and calculate the modularity of the partition these patterns provide. The results indicate that the more stable the patterns are, the larger tends to be the modularity of the partition defined by them. This correlation works pretty well in homogeneous networks (all nodes have similar connectivity) but fails when networks contain hubs, mainly because the modularity is never improved where isolated nodes appear, whereas in the synchronization process the characteristic of hubs is to have a large stability when forming its own community.

cond-mat.dis-nn↗

arXiv2006

Synchronization processes in complex networks

We present an extended analysis, based on the dynamics towards synchronization of a system of coupled oscillators, of the hierarchy of communities in complex networks. In the synchronization process, different structures corresponding to well defined communities of nodes appear in a hierarchical way. The analysis also provides a useful connection between synchronization dynamics, complex networks topology and spectral graph analysis.

nlin.AO↗

arXiv2006

Effect of size heterogeneity on community identification in complex networks

Identifying community structure can be a potent tool in the analysis and understanding of the structure of complex networks. Up to now, methods for evaluating the performance of identification algorithms use ad-hoc networks with communities of equal size. We show that inhomogeneities in community sizes can and do affect the performance of algorithms considerably, and propose an alternative method which takes these factors into account. Furthermore, we propose a simple modification of the algorithm proposed by Newman for community detection (Phys. Rev. E {\bf 69} 066133) which treats communities of different sizes on an equal footing, and show that it outperforms the original algorithm while retaining its speed.

physics.soc-ph↗

arXiv2005

Synchronization reveals topological scales in complex networks

We study the relationship between topological scales and dynamic time scales in complex networks. The analysis is based on the full dynamics towards synchronization of a system of coupled oscillators. In the synchronization process, modular structures corresponding to well defined communities of nodes emerge in different time scales, ordered in a hierarchical way. The analysis also provides a useful connection between synchronization dynamics, complex networks topology and spectral graph analysis.

cond-mat.dis-nn↗

arXiv2005

Comparing community structure identification

We compare recent approaches to community structure identification in terms of sensitivity and computational cost. The recently proposed modularity measure is revisited and the performance of the methods as applied to ad hoc networks with known community structure, is compared. We find that the most accurate methods tend to be more computationally expensive, and that both aspects need to be considered when choosing a method for practical purposes. The work is intended as an introduction as well as a proposal for a standard benchmark test of community detection methods.

cond-mat.dis-nn↗

arXiv2005

Modeling the Internet

We model the Internet as a network of interconnected Autonomous Systems which self-organize under an absolute lack of centralized control. Our aim is to capture how the Internet evolves by reproducing the assembly that has led to its actual structure and, to this end, we propose a growing weighted network model driven by competition for resources and adaptation to maintain functionality in a demand and supply ``equilibrium''. On the demand side, we consider the environment, a pool of users which need to transfer information and ask for service. On the supply side, ASs compete to gain users, but to be able to provide service efficiently, they must adapt their bandwidth as a function of their size. Hence, the Internet is not modeled as an isolated system but the environment, in the form of a pool of users, is also a fundamental part which must be taken into account. ASs compete for users and big and small come up, so that not all ASs are identical. New connections between ASs are made or old ones are reinforced according to the adaptation needs. Thus, the evolution of the Internet can not be fully understood if just described as a technological isolated system. A socio-economic perspective must also be considered.

physics.soc-ph↗

arXiv2004

Emergence of Complex Dynamics in a Simple Model of Signaling Networks

A variety of physical, social and biological systems generate complex fluctuations with correlations across multiple time scales. In physiologic systems, these long-range correlations are altered with disease and aging. Such correlated fluctuations in living systems have been attributed to the interaction of multiple control systems; however, the mechanisms underlying this behavior remain unknown. Here, we show that a number of distinct classes of dynamical behaviors, including correlated fluctuations characterized by $1/f$-scaling of their power spectra, can emerge in networks of simple signaling units. We find that under general conditions, complex dynamics can be generated by systems fulfilling two requirements: i) a ``small-world'' topology and ii) the presence of noise. Our findings support two notable conclusions: first, complex physiologic-like signals can be modeled with a minimal set of components; and second, systems fulfilling conditions (i) and (ii) are robust to some degree of degradation, i.e., they will still be able to generate $1/f$-dynamics.

q-bio.OT↗

arXiv2004

Competition and adaptation in an Internet evolution model

We model the evolution of the Internet at the Autonomous System level as a process of competition for users and adaptation of bandwidth capability. We find the exponent of the degree distribution as a simple function of the growth rates of the number of autonomous systems and the total number of connections in the Internet, both empirically measurable quantities. This fact place our model apart from others in which this exponent depends on parameters that need to be adjusted in a model dependent way. Our approach also accounts for a high level of clustering as well as degree-degree correlations, both with the same hierarchical structure present in the real Internet. Further, it also highlights the interplay between bandwidth, connectivity and traffic of the network.

cond-mat.dis-nn↗

arXiv2003

Community analysis in social networks

We present an empirical study of different social networks obtained from digital repositories. Our analysis reveals the community structure and provides a useful visualising technique. We investigate the scaling properties of the community size distribution, and that find all the networks exhibit power law scaling in the community size distributions with exponent either -0.5 or -1. Finally we find that the networks' community structure is topologically self-similar using the Horton-Strahler index.

cond-mat.stat-mech↗

arXiv2003

Emergence of clustering, correlations, and communities in a social network model

We propose a simple model of social network formation that parameterizes the tendency to establish acquaintances by the relative distance in a representative social space. By means of analytical calculations and numerical simulations, we show that the model reproduces the main characteristics of real social networks: non- vanishing clustering coefficient, assortative degree correlations, and the emergence of a hierarchy of communities. Our results highlight the importance of communities in the understanding of the structure of social networks.

cond-mat.stat-mech↗

arXiv2003

Optimization as a result of the interplay between dynamics and structure

In this work we study the interplay between the dynamics of a model of diffusion governed by a mechanism of imitation and its underlying structure. The dynamics of the model can be quantified by a macroscopic observable which permits the characterization of an optimal regime. We show that dynamics and underlying network cannot be considered as separated ingredients in order to achieve an optimal behavior.

cond-mat.stat-mech↗

arXiv2003

Search and Congestion in Complex Networks

A model of communication that is able to cope simultaneously with the problems of search and congestion is presented. We investigate the communication dynamics in model networks and introduce a general framework that enables a search of optimal structures.

cond-mat.stat-mech↗