Branching annihilating random walk with long-range repulsion: logarithmic scaling, reentrant phase transitions, and crossover behaviors
Su-Chan Park

TL;DR
This paper investigates phase transitions in a one-dimensional branching annihilating random walk with long-range repulsion, revealing logarithmic scaling, reentrant phase transitions, and crossover behaviors depending on interaction parameters.
Contribution
It introduces a detailed analysis of how long-range repulsive interactions influence phase transitions and reentrant behaviors in branching annihilating random walks.
Findings
Reentrant phase transitions occur for odd offspring number when interaction exceeds a threshold.
System with even offspring number remains active for nonzero branching rate if interaction exceeds the threshold.
Crossover exponent for attractive interaction with even offspring number is approximately 1.123.
Abstract
We study absorbing phase transitions in the one-dimensional branching annihilating random walk with long-range repulsion. The repulsion is implemented as hopping bias in such a way that a particle is more likely to hop away from its closest particle. The bias strength due to long-range interaction has the form , where is the distance from a particle to its closest particle, , and the sign of determines whether the interaction is repulsive (positive ) or attractive (negative ). A state without particles is the absorbing state. We find a threshold such that the absorbing state is dynamically stable for small branching rate if . The threshold differs significantly, depending on parity of the number of offspring. When ,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Theoretical and Computational Physics · Diffusion and Search Dynamics
