arXiv subjects

Bing-Hong Wang

Publications and source records attributed to Bing-Hong Wang.

At least 109 records · Page 6Linked to original sources

arXiv2006

Interplay between evolutionary game and network structure: the coevolution of social net, cooperation and wealth

We study the interplay between evolutionary game and network structure and show how the dynamics of the game affect the growth pattern of the network and how the evolution of the network influence the cooperative behavior in the game. Simulation results show that the payoff-based preferential attachment mechanism leads to the emergence of a scale-free structural property, $P(k)\sim k^{-γ}$. Moreover, we investigate the average path length and the assortative mixing features. The obtained results indicate that the network has small-world and positive assortative behaviors, which are consistent with the observations of some real social networks. In parallel, we found that the evolution of the underlying network structure effectively promotes the cooperation level of the game. We also investigate the wealth distribution obtained by our model, which is consistent with the Pareto law in the real observation. In addition, the analysis of the generated scale-free network structure is provided for better understanding the evolutionary dynamics of our model.

physics.soc-ph↗

arXiv2006

Better synchronizability predicted by a new coupling method

In this paper, inspired by the idea that the hub nodes of a highly heterogeneous network are not only the bottlenecks, but also effective controllers in the network synchronizing process, we bring forward an asymmetrical coupling method where the coupling strength of each node depends on its neighbors' degrees. Compared with the uniform coupled method and the recently proposed Motter-Zhou-Kurth method, the synchronizability of scale-free networks can be remarkably enhanced by using the present coupled method.

cond-mat.stat-mech↗

arXiv2006

Epidemic spreading on heterogeneous networks with identical infectivity

In this paper, we propose a modified susceptible-infected-recovered (SIR) model, in which each node is assigned with an identical capability of active contacts, $A$, at each time step. In contrast to the previous studies, we find that on scale-free networks, the density of the recovered individuals in the present model shows a threshold behavior. We obtain the analytical results using the mean-field theory and find that the threshold value equals 1/A, indicating that the threshold value is independent of the topology of the underlying network. The simulations agree well with the analytic results. Furthermore, we study the time behavior of the epidemic propagation and find a hierarchical dynamics with three plateaus. Once the highly connected hubs are reached, the infection pervades almost the whole network in a progressive cascade across smaller degree classes. Then, after the previously infected hubs are recovered, the disease can only propagate to the class of smallest degree till the infected individuals are all recovered. The present results could be of practical importance in the setup of dynamic control strategies.

physics.soc-ph↗

arXiv2006

Traffic flow and efficient routing on scale-free networks: A survey

Recently, motivated by the pioneer works in revealing the small-world effect and scale-free property of various real-life networks, many scientists devote themselves to studying complex networks. In this paper, we give a brief review on the studies of traffic flow and efficient routing on scale-free networks, including the traffic dynamics based on global routing protocol, Traffic dynamics based on local routing protocol, and the critical phenomena and scaling behaviors of real and artificial traffic. Finally, perspectives and some interesting problems are proposed.

physics.soc-ph↗

arXiv2006

Scaling behavior of an artificial traffic model on scale-free networks

In this article, we investigate an artificial traffic model on scale-free networks. Instead of using the routing strategy of the shortest path, a generalized routing algorithm is introduced to improve the transportation throughput, which is measured by the value of the critical point disjoining the free-flow phase and the congested phase. By using the detrended fluctuation analysis, we found that the traffic rate fluctuation near the critical point exhibits the $1/f$-type scaling in the power spectrum. The simulation results agree very well with the empirical data, thus the present model may contribute to the understanding of the underlying mechanism of network traffics.

physics.soc-ph↗

arXiv2006

Diffusion entropy analysis on the stride interval fluctuation of human gait

In this paper, the diffusion entropy technique is applied to investigate the scaling behavior of stride interval fluctuations of human gait. The scaling behavior of the stride interval of human walking at normal, slow and fast rate are similar; with the scale-invariance exponents in the interval $[0.663,0.955]$, of which the mean value is $0.821\pm0.011$. Dynamical analysis of these stride interval fluctuations reveals a self-similar pattern: Fluctuation at one time scale are statistically similar to those at multiple other time scales, at least over hundreds of steps, while the healthy subjects walk at their normal rate. The long-range correlations are observed during the spontaneous walking after the removal of the trend in the time series with Fourier filter. These findings uncover that the fractal dynamics of stride interval of human gait are normally intrinsic to the locomotor systems.

physics.bio-ph↗

arXiv2006

Behaviors of susceptible-infected epidemics on scale-free networks with identical infectivity

In this article, we proposed a susceptible-infected model with identical infectivity, in which, at every time step, each node can only contact a constant number of neighbors. We implemented this model on scale-free networks, and found that the infected population grows in an exponential form with the time scale proportional to the spreading rate. Further more, by numerical simulation, we demonstrated that the targeted immunization of the present model is much less efficient than that of the standard susceptible-infected model. Finally, we investigated a fast spreading strategy when only local information is available. Different from the extensively studied path finding strategy, the strategy preferring small-degree nodes is more efficient than that preferring large-degree nodes. Our results indicate the existence of an essential relationship between network traffic and network epidemic on scale-free networks.

physics.bio-ph↗

arXiv2006

Phase Synchronization of non-Abelian Oscillators on Small-World Networks

In this paper, by extending the concept of Kuramoto oscillator to the left-invariant flow on general Lie group, we investigate the generalized phase synchronization on networks. The analyses and simulations of some typical dynamical systems on Watts-Strogatz networks are given, including the $n$-dimensional torus, the identity component of 3-dimensional general linear group, the special unitary group, and the special orthogonal group. In all cases, the greater disorder of networks will predict better synchronizability, and the small-world effect ensures the global synchronization for sufficiently large coupling strength. The collective synchronized behaviors of many dynamical systems, such as the integrable systems, the two-state quantum systems and the top systems, can be described by the present phase synchronization frame. In addition, it is intuitive that the low-dimensional systems are more easily to synchronize, however, to our surprise, we found that the high-dimensional systems display obviously synchronized behaviors in regular networks, while these phenomena can not be observed in low-dimensional systems.

cond-mat.stat-mech↗

arXiv2006

Urban Traffic Dynamics: A Scale-Free Network Perspective

This letter propose a new model for characterizing traffic dynamics in scale-free networks. With a replotted road map of cities with roads mapped to vertices and intersections to edges, and introducing the road capacity L and its handling ability at intersections C, the model can be applied to urban traffic system. Simulations give the overall capacity of the traffic system which is quantified by a phase transition from free flow to congestion. Moreover, we report the fundamental diagram of flow against density, in which hysteresis is found, indicating that the system is bistable in a certain range of vehicle density. In addition, the fundamental diagram is significantly different from single-lane traffic model and 2-D BML model with four states: free flow, saturated flow, bistable and jammed.

physics.soc-ph↗

arXiv2006

A Unified Framework for the Pareto Law and Matthew Effect using Scale-Free Networks

We investigate the accumulated wealth distribution by adopting evolutionary games taking place on scale-free networks. The system self-organizes to a critical Pareto distribution (1897) of wealth $P(m)\sim m^{-(v+1)}$ with $1.6 < v <2.0$ (which is in agreement with that of U.S. or Japan). Particularly, the agent's personal wealth is proportional to its number of contacts (connectivity), and this leads to the phenomenon that the rich gets richer and the poor gets relatively poorer, which is consistent with the Matthew Effect present in society, economy, science and so on. Though our model is simple, it provides a good representation of cooperation and profit accumulation behavior in economy, and it combines the network theory with econophysics.

physics.soc-ph↗

arXiv2006

Integrating static and dynamic information for routing traffic

The efficiency of traffic routing on complex networks can be reflected by two key measurements i.e. the system capacity and the average data packets travel time. In this paper, we propose a mixing routing strategy by integrating local static and dynamic information for enhancing the efficiency of traffic on scale-free networks. The strategy is governed by a single parameter. Simulation results show that there exists a optimal parameter value by considering both maximizing the network capacity and reducing the packet travel time. Comparing with the strategy by adopting exclusive local static information, the new strategy shows its advantages in improving the efficiency of the system. The detailed analysis of the mixing strategy is provided. This work suggests that how to effectively utilize the larger degree nodes plays the key role in the scale-free traffic systems.

physics.soc-ph↗

arXiv2006

Synchronization on community networks

In this Letter, we propose a growing network model that can generate scale-free networks with a tunable community strength. The community strength, $C$, is directly measured by the ratio of the number of external edges to internal ones; a smaller $C$ corresponds to a stronger community structure. According to the criterion obtained based on the master stability function, we show that the synchronizability of a community network is significantly weaker than that of the original Barabási-Albert network. Interestingly, we found an unreported linear relationship between the smallest nonzero eigenvalue and the community strength, which can be analytically obtained by using the combinatorial matrix theory. Furthermore, we investigated the Kuramoto model and found an abnormal region ($C\leq 0.002$), in which the network has even worse synchronizability than the uncoupled case (C=0). On the other hand, the community effect will vanish when $C$ exceeds 0.1. Between these two extreme regions, a strong community structure will hinder global synchronization.

cond-mat.dis-nn↗

arXiv2006

Relations between Average Distance, Heterogeneity and Network Synchronizability

By using the random interchanging algorithm, we investigate the relations between average distance, standard deviation of degree distribution and synchronizability of complex networks. We find that both increasing the average distance and magnifying the degree deviation will make the network synchronize harder. Only the combination of short average distance and small standard deviation of degree distribution that ensures strong synchronizability. Some previous studies assert that the maximal betweenness is a right quantity to estimate network synchronizability: the larger the maximal betweenness, the poorer the network synchronizability. Here we address an interesting case, which strongly suggests that the single quantity, maximal betweenness, may not give a comprehensive description of network synchronizability.

cond-mat.stat-mech↗

arXiv2006

Dynamical Coarse Graining of Large Scale-Free Boolean networks

We present a renormalization-grouplike method performed in the state space for detecting the dynamical behaviors of large scale-free Boolean networks, especially for the chaotic regime as well as the edge of chaos. Numerical simulations with different coarse-graining level show that the state space networks of scale-free Boolean networks follow universal power-law distributions of in and out strength, in and out degree, as well as weight. These interesting results indicate scale-free Boolean networks still possess self-organized mechanism near the edge of chaos in the chaotic regime. The number of state nodes as a function of biased parameter for distinct coarse-graining level also demonstrates that the power-law behaviors are not the artifact of coarse-graining procedure. Our work may also shed some light on the investigation of brain dynamics.

cond-mat.dis-nn↗

arXiv2006

Emergence of cooperation induced by preferential learning

The evolutionary Prisoner's Dilemma Game (PDG) and the Snowdrift Game (SG) with preferential learning mechanism are studied in the Barabási-Albert network. Simulation results demonstrate that the preferential learning of individuals remarkably promotes the cooperative behavior for both two games over a wide range of payoffs. To understand the effect of preferential learning on the evolution of the systems, we investigate the time series of the cooperator density for different preferential strength and payoffs. It is found that in some specific cases two games both show the $1/f$-scaling behaviors, which indicate the existence of long range correlation. We also figure out that when the large degree nodes have high probability to be selected, the PDG displays a punctuated equilibrium-type behavior. On the contrary, the SG exhibits a sudden increase feature. These temporary instable behaviors are ascribed to the strategy shift of the large degree nodes.

physics.soc-ph↗

arXiv2006

Diffusion-limited-aggregation on a directed small world network

For real world systems, nonuniform medium is ubiquitous. Therefore, we investigate the diffusion-limited-aggregation process on a two dimensional directed small-world network instead of regular lattice. The network structure is established by rewiring connections on the two dimensional directed lattice. Those rewired edges are controlled by two parameters $θ$ and $m$, which characterize the spatial length and the density of the long-range connections, respectively. Simulations show that there exists a maximum value of the fractal dimension when $θ$ equals zero. Interestingly, we find that the symmetry of the aggregation pattern is broken when rewired connections are long enough, which may be an explanation for the formation of asymmetrical fractal in nature. Then, we perform multifractal analysis on the patterns further.

physics.comp-ph↗

arXiv2006

Interplay between HIV/AIDS Epidemics and Demographic Structures Based on Sexual Contact Networks

In this article, we propose a network spread model for HIV epidemics, wherein each individual is represented by a node of the transmission network and the edges are the connections between individuals along which the infection may spread. The sexual activity of each individual, measured by its degree, is not homogeneous but obeys a power-law distribution. Due to the heterogeneity of activity, the infection can persistently exist at a very low prevalence, which has been observed in real data but can not be illuminated by previous models with homogeneous mixing hypothesis. Furthermore, the model displays a clear picture of hierarchical spread: In the early stage the infection is adhered to these high-risk persons, and then, diffuses toward low-risk population. The prediction results show that the development of epidemics can be roughly categorized into three patterns for different countries, and the pattern of a given country is mainly determined by the average sex-activity and transmission probability per sexual partner. In most cases, the effect of HIV epidemics on demographic structure is very small. However, for some extremely countries, like Botswana, the number of sex-active people can be depressed to nearly a half by AIDS.

physics.bio-ph↗

arXiv2006

Growing Scale-free Small-world Networks with Tunable Assortative Coefficient

In this paper, we propose a simple rule that generates scale-free small-world networks with tunable assortative coefficient. These networks are constructed by two-stage adding process for each new node. The model can reproduce scale-free degree distributions and small-world effect. The simulation results are consistent with the theoretical predictions approximately. Interestingly, we obtain the nontrivial clustering coefficient $C$ and tunable degree assortativity $r$ by adjusting the parameter: the preferential exponent $β$. The model can unify the characterization of both assortative and disassortative networks.

physics.soc-ph↗