2011
DOI: 10.1209/0295-5075/96/50009
|View full text |Cite
|
Sign up to set email alerts
|

Vicious accelerating walkers

Abstract: A vicious walker system consists of N random walkers on a line with any two walkers annihilating each other upon meeting. We study a system of N vicious accelerating walkers with the velocity undergoing Gaussian fluctuations, as opposed to the position. We numerically compute the survival probability exponent, α, for this system, which characterizes the probability for any two walkers not to meet. For example, for N = 3, α = 0.71 ± 0.01. Based on our numerical data, we conjecture that 1 8 N (N − 1) is an upper… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
7
0

Year Published

2013
2013
2013
2013

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(7 citation statements)
references
References 37 publications
0
7
0
Order By: Relevance
“…For N = 2, this problem is simply equivalent to a single random walker with an absorbing boundary at the origin and hence θ = 1/4 for N = 2. For N = 3, it was shown in [104] that the survival probability is equivalent to the one of a single particle performing a random acceleration process in two dimensions confined in a 60 • wedge geometry (Fig. 5), similarly to the case of three Brownian walkers discussed above in section 4.1.…”
Section: Persistence Exponents For Vicious Walkersmentioning
confidence: 74%
See 4 more Smart Citations
“…For N = 2, this problem is simply equivalent to a single random walker with an absorbing boundary at the origin and hence θ = 1/4 for N = 2. For N = 3, it was shown in [104] that the survival probability is equivalent to the one of a single particle performing a random acceleration process in two dimensions confined in a 60 • wedge geometry (Fig. 5), similarly to the case of three Brownian walkers discussed above in section 4.1.…”
Section: Persistence Exponents For Vicious Walkersmentioning
confidence: 74%
“…In Ref. [103], the authors studied the case where the process terminates upon the first encounter between two walkers (note that one could alternatively consider that it terminates upon the first crossing of two walkers, which is a different situation for Lévy flights [104], see below). Such Lévy flights, in d dimensional space, perform Markov random walks where at each time step they jump in a random direction (with an angle which is uniformly distributed between 0 and 2π) while the length of the jump η is drawn from a pdf φ(η) with an algebraic tail φ(η) ∼ η −d−µ .…”
Section: Persistence Exponents For Vicious Walkersmentioning
confidence: 99%
See 3 more Smart Citations