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 not deleted
user 539001
2
votes
0
answers
57
views
Inclusion-Exclusion formulae for number of SAWs on $\mathbb{Z}^d$ of length $n$ [closed]
Here is my attempt at lower bounding the number of SAWs on $\mathbb{Z}^d$ of length $n$: In $\mathbb{Z}^d$, consider the $2^{d-1}$ lines of the form $\epsilon_1 x_1 = \epsilon_2 x_2 = \epsilon_3 x_3 \ …
- 21