arXiv subjects

Zi-Gang Huang

Publications and source records attributed to Zi-Gang Huang.

23 records · Page 2Linked to original sources

arXiv2007

Memory based Boolean game and self-organized phenomenon on networks

We study a memory-based Boolean game (MBBG) taking place on the regular ring, wherein each agent acts according to its local optimal states of the last M time steps recorded in memory, and the agents in the minority are rewarded. One free parameter p among 0 and 1 is introduced to denote the strength of the agents' willing to make a decision according to its memory. We find that, given proper willing strength p, the MBBG system can spontaneously evolve to a state of better performance than the random game; while for larger p, the herd behavior emerges which reduces the system profit. By analyzing the dependence of the system's dynamics on the memory capacity M, we find that a higher memory capacity favors the emergence of the better performance state, and effectively restrains the herd behavior, therefore increases the system profit. Considering the high cost of long-time memory, the enhancement of memory capacity for restraining the herd behavior is also discussed, and the M=5 is suggested to be one good choice.

physics.soc-ph↗

arXiv2007

Evolutionary prisoner's dilemma game with dynamic preferential selection

We study a modified prisoner's dilemma game taking place on two-dimensional disordered square lattices. The players are pure strategists and can either cooperate or defect with their immediate neighbors. In the generations each player update its strategy by following one of the neighboring strategies with a probability dependent on the payoff difference. The neighbor selection obeys a dynamic preferential rule, i.e., the more frequently a neighbor's strategy was adopted by the focal player in the previous rounds, the larger probability it will be chosen to refer to in the subsequent rounds. It is found that cooperation is substantially promoted due to this simple selection mechanism. Corresponding analysis is provided by the investigations of the distribution of players' impact weights, persistence, and as well as correlation function.

physics.soc-ph↗

arXiv2007

Promotion of cooperation induced by nonlinear attractive effect in spatial Prisoner's Dilemma game

We introduce nonlinear attractive effects into a spatial Prisoner's Dilemma game where the players located on a square lattice can either cooperate with their nearest neighbors or defect. In every generation, each player updates its strategy by firstly choosing one of the neighbors with a probability proportional to $\mathcal{A}^α$ denoting the attractiveness of the neighbor, where $\mathcal{A}$ is the payoff collected by it and $α$ ($\geq$0) is a free parameter characterizing the extent of the nonlinear effect; and then adopting its strategy with a probability dependent on their payoff difference. Using Monte Carlo simulations, we investigate the density $ρ_C$ of cooperators in the stationary state for different values of $α$. It is shown that the introduction of such attractive effect remarkably promotes the emergence and persistence of cooperation over a wide range of the temptation to defect. In particular, for large values of $α$, i.e., strong nonlinear attractive effects, the system exhibits two absorbing states (all cooperators or all defectors) separated by an active state (coexistence of cooperators and defectors) when varying the temptation to defect. In the critical region where $ρ_C$ goes to zero, the extinction behavior is power law-like $ρ_C$ $\sim$ $(b_c-b)^β$, where the exponent $β$ accords approximatively with the critical exponent ($β\approx0.584$) of the two-dimensional directed percolation and depends weakly on the value of $α$.

physics.soc-ph↗

arXiv2006

Walks on Apollonian networks

We carry out comparative studies of random walks on deterministic Apollonian networks (DANs) and random Apollonian networks (RANs). We perform computer simulations for the mean first passage time, the average return time, the mean-square displacement, and the network coverage for unrestricted random walk. The diffusions both on DANs and RANs are proved to be sublinear. The search efficiency for walks with various strategies and the influence of the topology of underlying networks on the dynamics of walks are discussed. Contrary to one's intuition, it is shown that the self-avoiding random walk, which has been verified as an optimal strategy for searching on scale-free and small-world networks, is not the best strategy for the DAN in the thermodynamic limit.

cond-mat.stat-mech↗

arXiv2005

Description of dynamics of stock prices by a Langevin approach

We present a time-dependent Langevin description of dynamics of stock prices. Based on a simple sliding-window algorithm, the fluctuation of stock prices is discussed in the view of a time-dependent linear restoring force which is the linear approximation of the drift parameter in Langevin equation estimated from the financial time series. By choosing suitable weighted factor for the linear approximation, the relation between the dynamical effect of restoring force and the autocorrelation of the financial time series is deduced. We especially analyze the daily log-returns of S$&$P 500 index from 1950 to 1999. The significance of the restoring force towards the prices evolution are investigated from its two coefficients, slope coefficient and equilibrium position. The new simple form of the restoring force obtained both from statistical and theoretical analyses suggests that the Langevin approach can effectively present the macroscopical and the detail properties of the price evolution.

physics.soc-ph↗