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 11540
3
votes
2
answers
1k
views
Reference Request: Cover time for simple random walk on $n \times n$ torus
I'm putting the finishing touches on my masters thesis and need a reference for the following fact (which my advisor told me):
Let $G$ be the $n\times n$ grid and identify the sides to make it a t …
- 30.3k
3
votes
1
answer
837
views
Transience of self avoiding random walks on $\mathbb{Z}^d$
I'm finishing up a masters thesis in computer science and want to say a bit in the introduction about self-avoiding walks. My thesis looks at a random process which arose in computer science and my ad …
- 30.3k
16
votes
5
answers
3k
views
Simple random walk on a locally finite graph: when is it recurrent?
I'm giving a talk tomorrow about a result in computer science which I recently proved. It's a recurrence-transience result on a random process which is related in spirit to a simple random walk. My re …
- 30.3k