We extend the classical Barabási-Albert preferential attachment procedure to graphs with internal vertex structure given by weights of vertices. In our model, weight dynamics depends on the current vertex degree distribution and the preferential attachment procedure takes into account both weights and degrees of vertices. We prove that such a coupled dynamics leads to scale-free graphs with exponents depending on parameters of the weight dynamics.
1 December 2004 in International Journal of Game Theory
We discuss combined effects of stochasticity and time delays in simple evolutionary games with a unique mixed evolutionarily stable strategy. We present three models of time-delay stochastic dynamics of finite well-mixed or random-matching populations. We show that in the first two models the evolutionarily stable strategy loses its stability and there appears a stable cycle around it with the time period and the amplitude proportional to the delay. In the third model, only one randomly chosen individual can update his strategy at a time. This slows down the dynamics and makes the evolutionarily stable strategy stable with respect to both time delay and stochastic perturbations.