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 markov-process
Search options not deleted
user 76815
A stochastic process with the property that the future is conditionally independent of the past, given the present.
4
votes
1
answer
3k
views
Computing the Entropy of a walk
Take for example a walk such as:
["school", "work", "home", "kindergarten", "home", "school", ...]
# or simply
[1, 2, 3, 4, 3, 1, ...]
What's the correct way of computing its entropy?
My current …
- 396