arXiv subjects

Andrea Baronchelli

Publications and source records attributed to Andrea Baronchelli.

At least 91 records · Page 5Linked to original sources

arXiv2013

The Biological Origin of Linguistic Diversity

In contrast with animal communication systems, diversity is characteristic of almost every aspect of human language. Languages variously employ tones, clicks, or manual signs to signal differences in meaning; some languages lack the noun-verb distinction (e.g., Straits Salish), whereas others have a proliferation of fine-grained syntactic categories (e.g., Tzeltal); and some languages do without morphology (e.g., Mandarin), while others pack a whole sentence into a single word (e.g., Cayuga). A challenge for evolutionary biology is to reconcile the diversity of languages with the high degree of biological uniformity of their speakers. Here, we model processes of language change and geographical dispersion and find a consistent pressure for flexible learning, irrespective of the language being spoken. This pressure arises because flexible learners can best cope with the observed high rates of linguistic change associated with divergent cultural evolution following human migration. Thus, rather than genetic adaptations for specific aspects of language, such as recursion, the coevolution of genes and fast-changing linguistic structure provides the biological basis for linguistic diversity. Only biological adaptations for flexible learning combined with cultural evolution can explain how each child has the potential to learn any human language.

physics.soc-ph↗

arXiv2013

Random walks and search in time-varying networks

The random walk process underlies the description of a large number of real world phenomena. Here we provide the study of random walk processes in time varying networks in the regime of time-scale mixing; i.e. when the network connectivity pattern and the random walk process dynamics are unfolding on the same time scale. We consider a model for time varying networks created from the activity potential of the nodes, and derive solutions of the asymptotic behavior of random walks and the mean first passage time in undirected and directed networks. Our findings show striking differences with respect to the well known results obtained in quenched and annealed networks, emphasizing the effects of dynamical connectivity patterns in the definition of proper strategies for search, retrieval and diffusion processes in time-varying networks

cond-mat.stat-mech↗

arXiv2012

The Twitter of Babel: Mapping World Languages through Microblogging Platforms

Large scale analysis and statistics of socio-technical systems that just a few short years ago would have required the use of consistent economic and human resources can nowadays be conveniently performed by mining the enormous amount of digital data produced by human activities. Although a characterization of several aspects of our societies is emerging from the data revolution, a number of questions concerning the reliability and the biases inherent to the big data "proxies" of social life are still open. Here, we survey worldwide linguistic indicators and trends through the analysis of a large-scale dataset of microblogging posts. We show that available data allow for the study of language geography at scales ranging from country-level aggregation to specific city neighborhoods. The high resolution and coverage of the data allows us to investigate different indicators such as the linguistic homogeneity of different countries, the touristic seasonal patterns within countries and the geographical distribution of different languages in multilingual regions. This work highlights the potential of geolocalized studies of open data sources to improve current analysis and develop indicators for major social phenomena in specific communities.

physics.soc-ph↗

arXiv2012

Ordering dynamics of the multi-state voter model

The voter model is a paradigm of ordering dynamics. At each time step, a random node is selected and copies the state of one of its neighbors. Traditionally, this state has been considered as a binary variable. Here, we relax this assumption and address the case in which the number of states is a parameter that can assume any value, from 2 to \infty, in the thermodynamic limit. We derive mean-field analytical expressions for the exit probability and the consensus time for the case of an arbitrary number of states. We then perform a numerical study of the model in low dimensional lattices, comparing the case of multiple states with the usual binary voter model. Our work generalizes the well-known results for the voter model, and sheds light on the role of the so far almost neglected parameter accounting for the number of states.

cond-mat.stat-mech↗

arXiv2012

Evolution of optimal Lévy-flight strategies in human mental searches

Recent analysis of empirical data [F. Radicchi, A. Baronchelli & L.A.N. Amaral. PloS ONE 7, e029910 (2012)] showed that humans adopt Lévy flight strategies when exploring the bid space in on-line auctions. A game theoretical model proved that the observed Lévy exponents are nearly optimal, being close to the exponent value that guarantees the maximal economical return to players. Here, we rationalize these findings by adopting an evolutionary perspective. We show that a simple evolutionary process is able to account for the empirical measurements with the only assumption that the reproductive fitness of a player is proportional to her search ability. Contrarily to previous modeling, our approach describes the emergence of the observed exponent without resorting to any strong assumptions on the initial searching strategies. Our results generalize earlier research, and open novel questions in cognitive, behavioral and evolutionary sciences.

physics.soc-ph↗

arXiv2012

Generalized voter-like models on heterogeneous networks

We describe a generalization of the voter model on complex networks that encompasses different sources of degree-related heterogeneity and that is amenable to direct analytical solution by applying the standard methods of heterogeneous mean-field theory. Our formalism allows for a compact description of previously proposed heterogeneous voter-like models, and represents a basic framework within which we can rationalize the effects of heterogeneity in voter-like models, as well as implement novel sources of heterogeneity, not previously considered in the literature.

physics.soc-ph↗

arXiv2012

Beating the news using Social Media: the case study of American Idol

We present a contribution to the debate on the predictability of social events using big data analytics. We focus on the elimination of contestants in the American Idol TV shows as an example of a well defined electoral phenomenon that each week draws millions of votes in the USA. We provide evidence that Twitter activity during the time span defined by the TV show airing and the voting period following it, correlates with the contestants ranking and allows the anticipation of the voting outcome. Furthermore, the fraction of Tweets that contain geolocation information allows us to map the fanbase of each contestant, both within the US and abroad, showing that strong regional polarizations occur. Although American Idol voting is just a minimal and simplified version of complex societal phenomena such as political elections, this work shows that the volume of information available in online systems permits the real time gathering of quantitative indicators anticipating the future unfolding of opinion formation events.

physics.soc-ph↗

arXiv2012

Heterogenous mean-field analysis of a generalized voter-like model on networks

We propose a generalized framework for the study of voter models in complex networks at the the heterogeneous mean-field (HMF) level that (i) yields a unified picture for existing copy/invasion processes and (ii) allows for the introduction of further heterogeneity through degree-selectivity rules. In the context of the HMF approximation, our model is capable of providing straightforward estimates for central quantities such as the exit probability and the consensus/fixation time, based on the statistical properties of the complex network alone. The HMF approach has the advantage of being readily applicable also in those cases in which exact solutions are difficult to work out. Finally, the unified formalism allows one to understand previously proposed voter-like processes as simple limits of the generalized model.

physics.soc-ph↗

arXiv2012

Random walks on temporal networks

Many natural and artificial networks evolve in time. Nodes and connections appear and disappear at various timescales, and their dynamics has profound consequences for any processes in which they are involved. The first empirical analysis of the temporal patterns characterizing dynamic networks are still recent, so that many questions remain open. Here, we study how random walks, as paradigm of dynamical processes, unfold on temporally evolving networks. To this aim, we use empirical dynamical networks of contacts between individuals, and characterize the fundamental quantities that impact any general process taking place upon them. Furthermore, we introduce different randomizing strategies that allow us to single out the role of the different properties of the empirical networks. We show that the random walk exploration is slower on temporal networks than it is on the aggregate projected network, even when the time is properly rescaled. In particular, we point out that a fundamental role is played by the temporal correlations between consecutive contacts present in the data. Finally, we address the consequences of the intrinsically limited duration of many real world dynamical networks. Considering the fundamental prototypical role of the random walk process, we believe that these results could help to shed light on the behavior of more complex dynamics on temporally evolving networks.

cond-mat.stat-mech↗

arXiv2012

Consensus in networks of mobile communicating agents

Populations of mobile and communicating agents describe a vast array of technological and natural systems, ranging from sensor networks to animal groups. Here, we investigate how a group-level agreement may emerge in the continuously evolving network defined by the local interactions of the moving individuals. We adopt a general scheme of motion in two dimensions and we let the individuals interact through the minimal naming game, a prototypical scheme to investigate social consensus. We distinguish different regimes of convergence determined by the emission range of the agents and by their mobility, and we identify the corresponding scaling behaviors of the consensus time. In the same way, we rationalize also the behavior of the maximum memory used during the convergence process, which determines the minimum cognitive/storage capacity needed by the individuals. Overall, we believe that the simple and general model presented in this paper can represent a helpful reference for a better understanding of the behavior of populations of mobile agents.

physics.soc-ph↗

arXiv2012

Rationality, irrationality and escalating behavior in lowest unique bid auctions

Information technology has revolutionized the traditional structure of markets. The removal of geographical and time constraints has fostered the growth of online auction markets, which now include millions of economic agents worldwide and annual transaction volumes in the billions of dollars. Here, we analyze bid histories of a little studied type of online auctions --- lowest unique bid auctions. Similarly to what has been reported for foraging animals searching for scarce food, we find that agents adopt Levy flight search strategies in their exploration of "bid space". The Levy regime, which is characterized by a power-law decaying probability distribution of step lengths, holds over nearly three orders of magnitude. We develop a quantitative model for lowest unique bid online auctions that reveals that agents use nearly optimal bidding strategies. However, agents participating in these auctions do not optimize their financial gain. Indeed, as long as there are many auction participants, a rational profit optimizing agent would choose not to participate in these auction markets.

physics.soc-ph↗

arXiv2011

Voter models on weighted networks

We study the dynamics of the voter and Moran processes running on top of complex network substrates where each edge has a weight depending on the degree of the nodes it connects. For each elementary dynamical step the first node is chosen at random and the second is selected with probability proportional to the weight of the connecting edge. We present a heterogeneous mean-field approach allowing to identify conservation laws and to calculate exit probabilities along with consensus times. In the specific case when the weight is given by the product of nodes' degree raised to a power theta, we derive a rich phase-diagram, with the consensus time exhibiting various scaling laws depending on theta and on the exponent of the degree distribution gamma. Numerical simulations give very good agreement for small values of |theta|. An additional analytical treatment (heterogeneous pair approximation) improves the agreement with numerics, but the theoretical understanding of the behavior in the limit of large |theta| remains an open challenge.

cond-mat.stat-mech↗

arXiv2011

Role of feedback and broadcasting in the naming game

The naming game (NG) describes the agreement dynamics of a population of agents that interact locally in a pairwise fashion, and in recent years statistical physics tools and techniques have greatly contributed to shed light on its rich phenomenology. Here we investigate in details the role played by the way in which the two agents update their states after an interaction. We show that slightly modifying the NG rules in terms of which agent performs the update in given circumstances (i.e. after a success) can either alter dramatically the overall dynamics or leave it qualitatively unchanged. We understand analytically the first case by casting the model in the broader framework of a generalized NG. As for the second case, on the other hand, we note that the modified rule reproducing the main features of the usual NG corresponds in fact to a simplification of it consisting in the elimination of feedback between the agents. This allows us to introduce and study a very natural broadcasting scheme on networks that can be potentially relevant for different applications, such as the design and implementation of autonomous sensor networks, as pointed out in the recent literature.

physics.soc-ph↗

arXiv2011

Complex networks and glassy dynamics: walks in the energy landscape

We present a simple mathematical framework for the description of the dynamics of glassy systems in terms of a random walk in a complex energy landscape pictured as a network of minima. We show how to use the tools developed for the study of dynamical processes on complex networks, in order to go beyond mean-field models that consider that all minima are connected to each other. We consider several possibilities for the transition rates between minima, and show that in all cases the existence of a glassy phase depends on a delicate interplay between the network's topology and the relationship between energy and degree of a minimum. Interestingly, the network's degree correlations and the details of the transition rates do not play any role in the existence (nor in the value) of the transition temperature, but have an impact only on more involved properties. For Glauber or Metropolis rates in particular, we find that the low-temperature phase can be further divided into two regions with different scaling properties of the average trapping time. Overall, our results rationalize and link the empirical findings about correlations between the energy of the minima and their degree, and should stimulate further investigations on this issue.

cond-mat.stat-mech↗

arXiv2011

Aging in language dynamics

Human languages evolve continuously, and a puzzling problem is how to reconcile the apparent robustness of most of the deep linguistic structures we use with the evidence that they undergo possibly slow, yet ceaseless, changes. Is the state in which we observe languages today closer to what would be a dynamical attractor with statistically stationary properties or rather closer to a non-steady state slowly evolving in time? Here we address this question in the framework of the emergence of shared linguistic categories in a population of individuals interacting through language games. The observed emerging asymptotic categorization, which has been previously tested - with success - against experimental data from human languages, corresponds to a metastable state where global shifts are always possible but progressively more unlikely and the response properties depend on the age of the system. This aging mechanism exhibits striking quantitative analogies to what is observed in the statistical mechanics of glassy systems. We argue that this can be a general scenario in language dynamics where shared linguistic conventions would not emerge as attractors, but rather as metastable states.

physics.soc-ph↗

arXiv2010

A fast no-rejection algorithm for the Category Game

The Category Game is a multi-agent model that accounts for the emergence of shared categorization patterns in a population of interacting individuals. In the framework of the model, linguistic categories appear as long lived consensus states that are constantly reshaped and re-negotiated by the communicating individuals. It is therefore crucial to investigate the long time behavior to gain a clear understanding of the dynamics. However, it turns out that the evolution of the emerging category system is so slow, already for small populations, that such an analysis has remained so far impossible. Here, we introduce a fast no-rejection algorithm for the Category Game that disentangles the physical simulation time from the CPU time, thus opening the way for thorough analysis of the model. We verify that the new algorithm is equivalent to the old one in terms of the emerging phenomenology and we quantify the CPU performances of the two algorithms, pointing out the neat advantages offered by the no-rejection one. This technical advance has already opened the way to new investigations of the model, thus helping to shed light on the fundamental issue of categorization.

physics.comp-ph↗

arXiv2010

Mean-field diffusive dynamics on weighted networks

Diffusion is a key element of a large set of phenomena occurring on natural and social systems modeled in terms of complex weighted networks. Here, we introduce a general formalism that allows to easily write down mean-field equations for any diffusive dynamics on weighted networks. We also propose the concept of annealed weighted networks, in which such equations become exact. We show the validity of our approach addressing the problem of the random walk process, pointing out a strong departure of the behavior observed in quenched real scale-free networks from the mean-field predictions. Additionally, we show how to employ our formalism for more complex dynamics. Our work sheds light on mean-field theory on weighted networks and on its range of validity, and warns about the reliability of mean-field results for complex dynamics.

cond-mat.stat-mech↗

arXiv2010

Modeling the emergence of universality in color naming patterns

The empirical evidence that human color categorization exhibits some universal patterns beyond superficial discrepancies across different cultures is a major breakthrough in cognitive science. As observed in the World Color Survey (WCS), indeed, any two groups of individuals develop quite different categorization patterns, but some universal properties can be identified by a statistical analysis over a large number of populations. Here, we reproduce the WCS in a numerical model in which different populations develop independently their own categorization systems by playing elementary language games. We find that a simple perceptual constraint shared by all humans, namely the human Just Noticeable Difference (JND), is sufficient to trigger the emergence of universal patterns that unconstrained cultural interaction fails to produce. We test the results of our experiment against real data by performing the same statistical analysis proposed to quantify the universal tendencies shown in the WCS [Kay P and Regier T. (2003) Proc. Natl. Acad. Sci. USA 100: 9085-9089], and obtain an excellent quantitative agreement. This work confirms that synthetic modeling has nowadays reached the maturity to contribute significantly to the ongoing debate in cognitive science.

physics.soc-ph↗