Branching annihilating random walk on random regular graphs

Abstract

The branching annihilating random walk is studied on a random graph whose sites have uniform number of neighbors (z). The Monte Carlo simulations in agreement with the generalized mean-field analysis indicate that the concentration decreses linearly with the branching rate for $z\ge 4$ while the coefficient of the linear term becomes zero if $z=3$. These features are described by a modified mieb-field theory taking explicitly into consideration the probability of mutual annihilation of the parent and its offspring particles using the returning features of a single walker on the same graph.

4 pages

References in corpus (2)

• Emergence of scaling in random networks
• The inverse Mermin-Wagner theorem for classical spin models on graphs

Cited by in corpus (9)

• Epidemic spreading in scale-free networks
• Evolutionary games on graphs
• Cooperation in noisy case: prisoner's dilemma game on two types of regular random graphs
• Evolutionary prisoner's dilemma games with optional participation
• Rock-scissors-paper game on regular small-world networks
• Phase transitions for rock-scissors-paper game on different networks
• Return times of random walk on generalized random graphs
• Low prevalence, quasi-stationarity and power-law distribution in a model of spreading
• Branching Random Walks on Binary Strings for Evolutionary Processes