Word diversity can accelerate consensus in naming game

In this paper,we introduce word diversity that reflects the inhomogeneity of words in a communication into the naming game.Diversity is realized by assigning a weight factor to each word.The weight is determined by three different distributions(uniform,exponential,and power-law distributions).During the communication,the probability that a word is selected from speaker’s memory depends on the introduced word diversity.Interestingly,we find that the word diversity following three different distributions can remarkably promote the final convergency,which is of high importance in the self-organized system.In particular,for all the ranges of amplitude of distribution,the powerlaw distribution enables the fastest consensus,while uniform distribution gives the slowest consensus.We provide an explanation of this effect based on both the number of different names and the number of total names,and find that a wide spread of names induced by the segregation of words is the main promotion factor.Other quantities,including the evolution of the averaging success rate of negotiation and the scaling behavior of consensus time,are also studied.These results are helpful for better understanding the dynamics of the naming game with word diversity.     

Coevolution with weights of names in structured language games

We propose a coevolutionary version to investigate the naming game, a model recently introduced to describe how shared vocabulary can emerge and persist spontaneously in communication systems. We base our model on the fact that more popular names have more opportunities to be selected by agents and then spread in the population. A name’s popularity is concerned with its communication frequency, characterized by its weight coevolving with the name. A tunable parameter governs the influence of name weight. We implement this modified version on both scale-free networks and small-world networks, in which interactions proceed between paired agents by means of the reverse naming game. It is found that there exists an optimal value of the parameter that induces the fastest convergence of the population. This illustration indicates that a moderately strong influence of evolving name weight favors the rapid achievement of final consensus, but very strong influences inhibit the convergence process. The rank-distribution of the final accumulated weights of names qualitatively explains this nontrivial phenomenon. Investigations of some pertinent quantities are also provided, including the time evolution of the number of different names and the success rate, as well as the total memory of agents for different parameter values, which are helpful for better understanding the coevolutionary dynamics. Finally, we explore the scaling behavior in the convergence time and conclude a smaller scaling parameter compared to the previous naming game models.     

Fast convergence in language games induced by majority rule

We propose a simple model to investigate the evolutionary dynamics of a naming game on well-mixed populations. We assume that each individual has an inherent propensity to maintain his own word about an object whereas other individuals would affect his decision when they communicate. On the one hand, individuals learn the word of another one with a probability pertaining to their propensities. On the other hand, the focal individual would adopt the word held by the majority in a randomly selected group. We have numerically explored how dynamical behavior evolves as a result of combination of these two competing update patterns. A parameter governs the time scale ratio at which the two update patterns separately progress. We find that an increasing tendency to adopt the word held by the majority results in a rapid extinction of most words, thus more easily induces the system to a global consensus. Large initial probabilities denoting propensity are found to be unfavorable for the achievement of the consensus. Interestingly, simulation results indicate that the convergence time is negligibly affected by the number of initial distinct words when this number exceeds a certain value. Results from our model may offer an insight into better understanding the intricate dynamics of naming games.     

Distribution of Chinese names

We present a statistical model for the distribution of Chinese names. Both family names and given names are studied on the same basis. With naive expectation, the distribution of family names can be very different from that of given names. One is affected mostly by genealogy, while the other can be dominated by cultural effects. However, we find that both distributions can be well described by the same model. Various scaling behaviors can be understood as a result of stochastic processes. The exponents of different power-law distributions are controlled by a single parameter. We also comment on the significance of full-name repetition in Chinese population.     

Heterogeneous distribution of metabolites across plant species

We investigate the distribution of flavonoids, a major category of plant secondary metabolites, across species. Flavonoids are known to show high species specificity, and were once considered as chemical markers for understanding adaptive evolution and characterization of living organisms. We investigate the distribution among species using bipartite networks, and find that two heterogeneous distributions are conserved among several families: the power-law distributions of the number of flavonoids in a species and the number of shared species of a particular flavonoid. In order to explain the possible origin of the heterogeneity, we propose a simple model with, essentially, a single parameter. As a result, we show that two respective power-law statistics emerge from simple evolutionary mechanisms based on a multiplicative process. These findings provide insights into the evolution of metabolite diversity and characterization of living organisms that defy genome sequence analysis for different reasons.     

A novel snowdrift game model with edge weighting mechanism on the square lattice

We propose a novel snowdrift game model with edge weighting mechanism to explore the cooperative behaviors among the players on the square lattice. Based on the assumption of three types of weight distribution including uniform, exponential and power-law schemes, the cooperation level is largely boosted in contrast with the traditional snowdrift game on the unweighted square lattice. Extensive numerical simulations indicate that the fraction of cooperators greatly augments, especially for the intermediate range of cost-to-benefit ratio r. Furthermore, we investigate how the cooperative behaviors are affected by the undulation amplitude of weight distribution and noise strength of strategy selection, respectively. The simulation results will be conducive to further understanding and analyzing the emergence of cooperation, which is a ubiquitous phenomenon in social and biological science.     

Power-law regularities in human language

Complex structure of human language enables us to exchange very complicated information. This communication system obeys some common nonlinear statistical regularities. We investigate four important long-range features of human language. We perform our calculations for adopted works of seven famous litterateurs. Zipf’s law and Heaps’ law, which imply well-known power-law behaviors, are established in human language, showing a qualitative inverse relation with each other. Furthermore, the informational content associated with the words ordering, is measured by using an entropic metric. We also calculate fractal dimension of words in the text by using box counting method. The fractal dimension of each word, that is a positive value less than or equal to one, exhibits its spatial distribution in the text. Generally, we can claim that the Human language follows the mentioned power-law regularities. Power-law relations imply the existence of long-range correlations between the word types, to convey an especial idea.     

Naming game on small-world networks with geographical effects

The naming game model characterizes the main evolutionary features of languages or more generally of communication systems. Very recently, the combination of complex networks and the naming game has received much attention and the influences of various topological properties on the corresponding dynamical behavior have been widely studied. In this paper, we investigate the naming game on small-world geographical networks. The small-world geographical networks are constructed by randomly adding links to two-dimensional regular lattices, and it is found that the convergence time is a nonmonotonic function of the geographical distance of randomly added shortcuts. This phenomenon indicates that, although a long geographical distance of the added shortcuts favors consensus achievement, too long a geographical distance of the added shortcuts inhibits the convergence process, making it even slower than the moderates.     

Convergence speed of consensus problems over undirected scale-free networks

Scale-free networks and consensus behaviour among multiple agents have both attracted much attention.To investigate the consensus speed over scale-free networks is the major topic of the present work.A novel method is developed to construct scale-free networks due to their remarkable power-law degree distributions,while preserving the diversity of network topologies.The time cost or iterations for networks to reach a certain level of consensus is discussed,considering the influence from power-law parameters.They are both demonstrated to be reversed power-law functions of the algebraic connectivity,which is viewed as a measurement on convergence speed of the consensus behaviour.The attempts of tuning power-law parameters may speed up the consensus procedure,but it could also make the network less robust over time delay at the same time.Large scale of simulations are supportive to the conclusions.     

Statistical distribution of Chinese names

This paper studies the statistical characteristics of Chinese surnames, first names and full names based on a credible sample. The distribution of Chinese surnames, unlike that in any other countries, shows an exponential pattern in the top part and a power-law pattern in the tail part. The distributions of Chinese first names and full names have the characteristics of a power law with different exponents. Finally, the interrelation of the first name and the surname is demonstrated by using a computer simulation and an exhibition of the name network. Chinese people take the surname into account when they choose a first name for somebody.     

The physical position neighbourhood evolving network model

Many social, technological, biological and economical systems are properly described by evolved network models. In this paper, a new evolving network model with the concept of physical position neighbourhood connectivity is proposed and studied. This concept exists in many real complex networks such as communication networks. The simulation results for network parameters such as the first nonzero eigenvalue and maximal eigenvalue of the graph Laplacian, clustering coefficients, average distances and degree distributions for different evolving parameters of this model are presented. The dynamical behaviour of each node on the consensus problem is also studied. It is found that the degree distribution of this new model represents a transition between power-law and exponential scaling, while the Barábasi-Albert scale-free model is only one of its special (limiting) cases. It is also found that the time to reach a consensus becomes shorter sharply with increasing of neighbourhood scale of the nodes.     

Complex stock trading network among investors

We provide an empirical investigation aimed at uncovering the statistical properties of intricate stock trading networks based on the order flow data of a highly liquid stock (Shenzhen Development Bank) listed on Shenzhen Stock Exchange during the whole year of 2003. By reconstructing the limit order book, we can extract detailed information of each executed order for each trading day and demonstrate that the trade size distributions for different trading days exhibit power-law tails and that most of the estimated power-law exponents are well within the Lévy stable regime. Based on the records of order matching among investors, we can construct a stock trading network for each trading day, in which the investors are mapped into nodes and each transaction is translated as a direct edge from the seller to the buyer with the trade size as its weight. We find that all the trading networks comprise a giant component and have power-law degree distributions and disassortative architectures. In particular, the degrees are correlated with order sizes by a power-law function. By regarding the size of executed order as its fitness, the fitness model can reproduce the empirical power-law degree distribution.     

On the probability distribution of stock returns in the Mike-Farmer model

Recently, Mike and Farmer have constructed a very powerful and realistic behavioral model to mimick the dynamic process of stock price formation based on the empirical regularities of order placement and cancelation in a purely order-driven market, which can successfully reproduce the whole distribution of returns, not only the well-known power-law tails, together with several other important stylized facts. There are three key ingredients in the Mike-Farmer (MF) model: the long memory of order signs characterized by the Hurst index H_s, the distribution of relative order prices x in reference to the same best price described by a Student distribution (or Tsallis’ q-Gaussian), and the dynamics of order cancelation. They showed that different values of the Hurst index H_s and the freedom degree α_x of the Student distribution can always produce power-law tails in the return distribution f_r(r) with different tail exponent α_r. In this paper, we study the origin of the power-law tails of the return distribution f_r(r) in the MF model, based on extensive simulations with different combinations of the left part L(x) for x < 0 and the right part R(x) for x > 0 of f_x(x). We find that power-law tails appear only when L(x) has a power-law tail, no matter R(x) has a power-law tail or not. In addition, we find that the distributions of returns in the MF model at different timescales can be well modeled by the Student distributions, whose tail exponents are close to the well-known cubic law and increase with the timescale.     

Social influence in small—world networks

We report on our numerical studies of the Axelrod model for social influence in small-world networks.Our simulation results show that the topology of the network has a crucial effect on the evolution of cultures .As the randomness of the network increases,the system undergoes a transition from a highly fragmented phase to a uniform phase.we also find that the power-law distribution at the transition point,reported by castellano et al,is not a critical phenomenon;it exists not only at the onset of transition but also for almost any control parameters,All these power-law distributions are stable against pertubations.A mean-field theory is developed to explain these phenomena.     

Betweenness centrality in finite components of complex networks

We use generating function formalism to obtain an exact formula of the betweenness centrality in finite components of random networks with arbitrary degree distributions. The formula is obtained as a function of the degree and the component size, and is confirmed by simulations for Poisson, exponential, and power-law degree distributions. We find that the betweenness centralities for the three distributions are asymptotically power laws with an exponent 1.5 and are invariant to the particular distribution parameters.     

Effects of heterogeneous adoption thresholds on contact-limited social contagions

Limited contact capacity and heterogeneous adoption thresholds have been proven to be two essential characteristics of individuals in natural complex social systems, and their impacts on social contagions exhibit complex nature. With this in mind, a heterogeneous contact-limited threshold model is proposed, which adopts one of four threshold distributions, namely Gaussian distribution, log-normal distribution, exponential distribution and power-law distribution. The heterogeneous edge-based compartmental theory is developed for theoretical analysis, and the calculation methods of the final adoption size and outbreak threshold are given theoretically. Many numerical simulations are performed on the Erdös-Rényi and scale-free networks to study the impact of different forms of the threshold distribution on hierarchical spreading process, the final adoption size, the outbreak threshold and the phase transition in contact-limited propagation networks. We find that the spreading process of social contagions is divided into three distinct stages. Moreover, different threshold distributions cause different spreading processes, especially for some threshold distributions, there is a change from a discontinuous first-order phase transition to a continuous second-order phase transition. Further, we find that changing the standard deviation of different threshold distributions will cause the final adoption size and outbreak threshold to change, and finally tend to be stable with the increase of standard deviation.     

The origin of preferential attachment and the generalized preferential attachment for weighted networks

In this paper, we first discuss the origin of preferential attachment. Then we establish the generalized preferential attachment (GPA) which has two new properties; first, it encapsulates both the topological and weight aspects of a network, which makes it is neither entirely degree preferential nor entirely weight preferential. Second, it can tell us not only the chance that each already-existing vertex being connected but also how much weight each new edge has. The GPA can generate four power-law distributions, besides the three for vertex degrees, vertex strengths, and edge weights, it yields a new power-law distribution for the subgraph degrees.     

Degree distributions of the visibility graphs mapped from fractional Brownian motions and multifractal random walks

The dynamics of a complex system is usually recorded in the form of time series, which can be studied through its visibility graph from a complex network perspective. We investigate the visibility graphs extracted from fractional Brownian motions and multifractal random walks, and find that the degree distributions exhibit power-law behaviors, in which the power-law exponent α is a linear function of the Hurst index H of the time series. We also find that the degree distribution of the visibility graph is mainly determined by the temporal correlation of the original time series with minor influence from the possible multifractal nature. As an example, we study the visibility graphs constructed from three Chinese stock market indexes and unveil that the degree distributions have power-law tails, where the tail exponents of the visibility graphs and the Hurst indexes of the indexes are close to the α∼H linear relationship.     

Excess entropy in natural language: Present state and perspectives

We review recent progress in understanding the meaning of mutual information in natural language. Let us define words in a text as strings that occur sufficiently often. In a few previous papers, we have shown that a power-law distribution for so defined words (a.k.a. Herdan's law) is obeyed if there is a similar power-law growth of (algorithmic) mutual information between adjacent portions of texts of increasing length. Moreover, the power-law growth of information holds if texts describe a complicated infinite (algorithmically) random object in a highly repetitive way, according to an analogous power-law distribution. The described object may be immutable (like a mathematical or physical constant) or may evolve slowly in time (like cultural heritage). Here, we reflect on the respective mathematical results in a less technical way. We also discuss feasibility of deciding to what extent these results apply to the actual human communication.