arXiv subjects

Bing-Hong Wang

Publications and source records attributed to Bing-Hong Wang.

At least 145 records · Page 8Linked to original sources

arXiv2005

Random Apollonian Networks

In this letter, we propose a simple rule that generates scale-free networks with very large clustering coefficient and very small average distance. These networks are called {\bf Random Apollonian Networks}(RANs) as they can be considered as a variation of Apollonian networks. We obtain the analytic result of power-law exponent $γ=3$ and clustering coefficient $C={46/3}-36\texttt{ln}{3/2}\approx 0.74$, which agree very well with the simulation results. We prove that the increasing tendency of average distance of RAN is a little slower than the logarithm of the number of nodes in RAN. Since many real-life networks are both scale-free and small-world, RANs may perform well in mimicking the reality. The epidemic spreading process is also studied, we find that the diseases spread slower in RANs than BA networks in the early stage of SI process, indicating that the large clustering coefficient may slower the spreading velocity especially in the outbreaks.

cond-mat.dis-nn↗

arXiv2005

Analytical Studies on a Modified Nagel-Schreckenberg Model with the Fukui-Ishibashi Acceleration Rule

We propose and study a one-dimensional traffic flow cellular automaton model of high-speed vehicles with the Fukui-Ishibashi-type (FI) acceleration rule for all cars, and the Nagel-Schreckenberg-type (NS) stochastic delay mechanism. By using the car-oriented mean field theory, we obtain analytically the fundamental diagrams of the average speed and vehicle flux depending on the vehicle density and stochastic delay probability. Our theoretical results, which may contribute to the exact analytical theory of the NS model, are in excellent agreement with numerical simulations.

cond-mat.stat-mech↗

arXiv2004

Epidemic spread in weighted scale-free networks

In this letter, we investigate the detailed epidemic spreading process in scale-free networks with links' weights that denote familiarity between two individuals and find that spreading velocity reaches a peak quickly then decays in a power-law form. Numerical study exhibits that the nodes with larger strength is preferential to be infected, but the hierarchical dynamics are not clearly found, which is different from the well-known result in unweighed network case. In addition, also by numerical study, we demonstrate that larger dispersion of weight of networks results in slower spreading, which indicates that epidemic spreads more quickly on unweighted scale-free networks than on weighted scale-free networks with the same condition.

cond-mat.stat-mech↗

arXiv2004

Maximal planar networks with large clustering coefficient and power-law degree distribution

In this article, we propose a simple rule that generates scale-free networks with very large clustering coefficient and very small average distance. These networks are called {\bf Random Apollonian Networks}(RAN) as they can be considered as a variation of Apollonian networks. We obtain the analytic results of power-law exponent $γ=3$ and clustering coefficient $C={46/3}-36\texttt{ln}{3/2}\approx 0.74$, which agree very well with the simulation results. We prove that the increasing tendency of average distance of RAN is a little slower than the logarithm of the number of nodes in RAN. Since most real-life networks are both scale-free and small-world networks, RAN may perform well in mimicking the reality. The RAN possess hierarchical structure as $C(k)\sim k^{-1}$ that in accord with the observations of many real-life networks. In addition, we prove that RAN are maximal planar networks, which are of particular practicability for layout of printed circuits and so on. The percolation and epidemic spreading process are also studies and the comparison between RAN and Barabási-Albert(BA) as well as Newman-Watts(NW) networks are shown. We find that, when the network order $N$(the total number of nodes) is relatively small(as $N\sim 10^4$), the performance of RAN under intentional attack is not sensitive to $N$, while that of BA networks is much affected by $N$. And the diseases spread slower in RAN than BA networks during the outbreaks, indicating that the large clustering coefficient may slower the spreading velocity especially in the outbreaks.

cond-mat.stat-mech↗

arXiv2004

Clustering Evolutionary Stock Market Model

As a typical representation of complex networks studied relatively thoroughly, financial market presents some special details, such as its nonconservation and opinions spreading. In this model, agents congregate to form some clusters, which may grow or collapse with the evolution of the system. To mimic an open market, we allow some ones participate in or exit the market suggesting that the number of the agents would fluctuate. Simulation results show that the large events are frequent in the fluctuations of the stock price generated by the artificial stock market when compared with a normal process and the price return distribution is a \emph{lévy} distribution in the central part followed by an approximately exponential truncation.

cond-mat.other↗

arXiv2004

Evolutionary Dynamics in Complex Networks of Competing Boolean Agents

We investigate the dynamics of network minority games on Kauffman's NK networks (Kauffman nets), growing directed networks (GDNets), as well as growing directed networks with a small fraction of link reversals (GDRNets). We show that the dynamics and the associated phase structure of the game depend crucially on the structure of the underlying network. The dynamics on GDNets is very stable for all values of the connection number $K$, in contrast to the dynamics on Kauffman's NK networks, which becomes chaotic when $K>K_c=2$. The dynamics of GDRNets, on the other hand, is near critical. Under a simple evolutionary scheme, the network system with a "near" critical dynamics evolves to a high level of global coordination among its agents. In particular, the performance of the system is close to the optimum for the GDRNets; this suggests that criticality leads to the best performance. For Kauffman nets with $K>3$, the evolutionary scheme has no effect on the dynamics (it remains chaotic) and the performance of the MG resembles that of a random choice game (RCG).

cond-mat.other↗

arXiv2004

Continuous extremal optimization for Lennard-Jones Clusters

In this paper, we explore a general-purpose heuristic algorithm for finding high-quality solutions to continuous optimization problems. The method, called continuous extremal optimization(CEO), can be considered as an extension of extremal optimization(EO) and is consisted of two components, one is with responsibility for global searching and the other is with responsibility for local searching. With only one adjustable parameter, the CEO's performance proves competitive with more elaborate stochastic optimization procedures. We demonstrate it on a well known continuous optimization problem: the Lennerd-Jones clusters optimization problem.

cond-mat.mtrl-sci↗

arXiv2004

A weighted evolving network model more approach to reality

In search of many social and economical systems, it is found that node strength distribution as well as degree distribution demonstrate the behavior of power-law with droop-head and heavy-tail. We present a new model for the growth of weighted networks considering the connection of nodes with low strengths. Numerical simulations indicate that this network model yields three power-law distributions of the node degrees, node strengths and connection weights. Particularly, the droop-head and heavy-tail effects can be reflected in the first two ones by this new model.

cond-mat.dis-nn↗

arXiv2004

A Model of Weighted Network: the Student Relationships in a Class

A simple model is proposed to simulate the evolution of interpersonal relationships in a class. The small social network is simply assumed as an undirected and weighted graph, in which students are represented by vertices, and the extent of favor or disfavor between two of them are denoted by the weight of corresponding edge. Various weight distributions have been found by choosing different initial configurations. Analysis and experimental results reveal that the effect of first impressions has a crucial influence on the final weight distribution. The system also exhibits a phase transition in the final hostility (negative weights) proportion depending on the initial amity (positive weights) proportion.

cond-mat.other↗

arXiv2004

The Evolution of Interpersonal Relationships in a Social Group

A model has been proposed to simulate the evolution of interpersonal relationships in a social group. The small social community is simply assumed as an undirected and weighted graph, where individuals are denoted by vertices, and the extent of favor or disfavor between them are represented by the corresponding edge weight. One could further define the strength of vertices to describe the individual popularity. The strength evolution exhibits a nonlinear behavior. Meanwhile, various acute perturbations to the system have been investigated. In the framework of our model, it is also interesting to study the adaptive process of a new student joining a class midway.

cond-mat.other↗

arXiv2004

Perturbation: the Catastrophe Causer in Scale-Free Networks

A new model about cascading occurrences caused by perturbation is established to search after the mechanism because of which catastrophes in networks occur. We investigate the avalanche dynamics of our model on 2-dimension Euclidean lattices and scale-free networks and find out the avalanche dynamic behaviors is very sensitive to the topological structure of networks. The experiments show that the catastrophes occur much more frequently in scale-free networks than in Euclidean lattices and the greatest catastrophe in scale-free networks is much more serious than that in Euclidean lattices. Further more, we have studied how to reduce the catastrophes' degree, and have schemed out an effective strategy, called targeted safeguard-strategy for scale-free networks.

cond-mat.stat-mech↗

arXiv2004

Global Optimization of Minority Game by Smart Agents

We propose a new model of minority game with so-called smart agents such that the standard deviation and the total loss in this model reach the theoretical minimum values in the limit of long time. The smart agents use trail and error method to make a choice but bring global optimization to the system, which suggests that the economic systems may have the ability to self-organize into a highly optimized state by agents who are forced to make decisions based on inductive thinking for their limited knowledge and capabilities. When other kinds of agents are also present, the experimental results and analyses show that the smart agent can gain profits from producers and are much more competent than the noise traders and conventional agents in original minority game.

cond-mat.stat-mech↗

arXiv2004

Modeling Stock Market Based on Genetic Cellular Automata

An artificial stock market is established with the modeling method and ideas of cellular automata. Cells are used to represent stockholders, who have the capability of self-teaching and are affected by the investing history of the neighboring ones. The neighborhood relationship among the stockholders is the expanded Von Neumann relationship, and the interaction among them is realized through selection operator and crossover operator. Experiment shows that the large events are frequent in the fluctuations of the stock price generated by the artificial stock market when compared with a normal process and the price returns distribution is a Levy distribution in the central part followed by an approximately exponential truncation.

cond-mat.other↗

arXiv2004

Power Law Distribution of Wealth in a Money-Based Model

A money-based model for the power law distribution (PLD) of wealth in an economically interacting population is introduced. The basic feature of our model is concentrating on the capital movements and avoiding the complexity of micro behaviors of individuals. It is proposed as an extension of the Equiluz and Zimmermann's (EZ) model for crowding and information transmission in financial markets. Still, we must emphasize that in EZ model the PLD without exponential correction is obtained only for a particular parameter, while our pattern will give it within a wide range. The Zipf exponent depends on the parameters in a nontrivial way and is exactly calculated in this paper.

cond-mat.other↗

arXiv2004

Theory of the Three-Group Evolutionary Minority Game

Based on the adiabatic theory for the evolutionary minority game (EMG) that we proposed earlier[1], we perform a detail analysis of the EMG limited to three groups of agents. We derive a formula for the critical point of the transition from segregation (into opposing groups) to clustering (towards cautious behaviors). Particular to the three-group EMG, the strategy switching in the "extreme" group does not occur at every losing step and is strongly intermittent. This leads to an correction to the critical value of the number of agents at the transition, $N_c$. Our expression for $N_c$ is in agreement with the results obtained from our numerical simulations.

cond-mat.stat-mech↗

arXiv2003

Theory of Phase Transition in the Evolutionary Minority Game

We discover the mechanism for the transition from self-segregation (into opposing groups) to clustering (towards cautious behaviors) in the evolutionary minority game (EMG). The mechanism is illustrated with a statistical mechanics analysis of a simplified EMG involving three groups of agents: two groups of opposing agents and one group of cautious agents. Two key factors affect the population distribution of the agents. One is the market impact (the self-interaction), which has been identified previously. The other is the market inefficiency due to the short-time imbalance in the number of agents using opposite strategies. Large market impact favors "extreme" players who choose fixed strategies, while large market inefficiency favors cautious players. The phase transition depends on the number of agents ($N$), the reward-to-fine ratio ($R$), as well as the wealth reduction threshold ($d$) for switching strategy. When the rate for switching strategy is large, there is strong clustering of cautious agents. On the other hand, when $N$ is small, the market impact becomes large, and the extreme behavior is favored.

cond-mat↗

arXiv2001

A cellular automaton traffic flow model between the Fukui-Ishibashi and Nagel-Schreckenberg models

We propose and study a new one-dimensional traffic flow cellular automaton (CA) model of high speed vehicles with the Fukui-Ishibashi-type acceleration for all cars and the Nagel-Schreckenberg-type (NS) stochastic delay only for the cars following the trail of the car ahead. The main difference in the delay scenario between the new model and the NS model is that a car with spacing ahead longer than the velocity limit $M$ may not be delayed in the new model. By using a car-oriented mean field theory, we derive the fundamental diagrams of the average speed as the function of car density analytically. Our theoretical results are in excellent agreement with numerical simulations.

cond-mat.stat-mech↗

arXiv2001

Statistical properties of the attendance time series in the minority game

We study the statistical properties of the attendance time series corresponding to the number of agents making a particular decision in the minority game (MG). We focus on the analysis of the probability distribution and the autocorrelation function of the attendance over a time interval in the efficient phase of the game. In this regime both the probability distribution and the autocorrelation function are shown to have similar behaviour for time differences corresponding to multiples of $2\cdot 2^{m}$, which is twice the number of possible history bit strings in a MG with agents making decisions based on the most recent $m$ outcomes of the game.

cond-mat.stat-mech↗