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 70627
2
votes
3
answers
171
views
The independence of all sub-paths between adjacent returns to origin in random walks
In random walks, a path may return to origin for the $r$-th time in $n$-th step ($r$ is given but $n$ is not given), and under this condition, these $n$ steps can be split into $r$ sections where each …
CommunityBot
- 1
0
votes
The independence of all sub-paths between adjacent returns to origin in random walks
Thanks to @Especially Lime's reminder of the difference between the median and the mean (in probability, the equivalents are quantile and expectation). And now I think this is exactly the key point le …
- 121