Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with random-walks
Search options questions only
not deleted
user 3621
15
votes
2
answers
1k
views
self-avoidance time of random walk
How many steps on average does a simple random walk in the plane take before it visits a vertex it's visited before?
If an exact formula does not exist (as seems likely), then I'm interested in good …
- 19.7k
7
votes
1
answer
255
views
Counting returns in null-recurrent random walk
Consider two independent copies of IID random walk on ${\bf Z}$ starting from $0$, and let $N_1(t)$ (resp. $N_2(t)$) denote the number of times, up to time $t$, that the first (resp. second) walker ha …
- 19.7k
10
votes
1
answer
932
views
exactly simulating a random walk from infinity
In diffusion-limited aggregation on the square lattice, one lets a particle do "random walk from infinity" until it hits the current aggregate, at which point the site occupied by the particle is adde …
- 19.7k