Branching annihilating random walk on random regular graphs

Details Branching annihilating random walk on random regular graphs Branching annihilating random walk on random regular graphs

2000-08-22

arxiv.org/abs/cond-mat/0008310v1

Phys. Rev. E, 62 (2000) 7474.

Physics

Condensed Matter

Statistical Mechanics

4 pages

Scientific paper

10.1103/PhysRevE.62.7474

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.

Affiliated with

Also associated with

No associations

Rating

Branching annihilating random walk on random regular graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Branching annihilating random walk on random regular graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Branching annihilating random walk on random regular graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-133911