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"
Bookmarks inbookmarks:mine
inbookmarks:1234
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
Search options user 39754

Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.

1
vote
You can use a Markov chain on the positions. In ten moves you can't get too far, so you can use a finite grid. In your specific example, the probability of ending up at least 4 blocks away is about 0. …
answered Oct 29 '15 by guest
3
votes
This isn't an answer so please vote it down, but if you want a closed-form approximation then you can say that you begin with some finite distribution of coin amounts, so instead of saying you start w …
answered Dec 3 '13 by guest