query: Markov chain on an $n$-dimensional hypercube?
positive_passages.docid: 148979
positive_passages.text: Expected hitting times for simple random walk on a hypercube
negative_passages.docid: 11656
negative_passages.text: 2D random walk within a bounded area
negative_passages.docid: 100061
negative_passages.text: The Maximum possible order for an element $S_n$
negative_passages.docid: 76381
negative_passages.text: Plain integer partitions of $n$ using $r$ parts
negative_passages.docid: 123626
negative_passages.text: Prove that even $n$ can be partitioned to $\frac n2$ edges
negative_passages.docid: 96249
negative_passages.text: Sampling uniformly from the standard n simplex with further constraints
negative_passages.docid: 32056
negative_passages.text: Symmetric random walk with bounds
negative_passages.docid: 106801
negative_passages.text: Labelled spanning trees of $K_n-e$
negative_passages.docid: 33348
negative_passages.text: Hitting probability of biased random walk on the integer line
negative_passages.docid: 66842
negative_passages.text: Number of $n^2\times n^2$ permutation matrices with a 1 in each $n\times n$ subgrid
negative_passages.docid: 123985
negative_passages.text: Simplex Random Walk
negative_passages.docid: 53261
negative_passages.text: Show that Pn is an (n+1)-dimensional subspace
negative_passages.docid: 145194
negative_passages.text: Matrix graph and irreducibility
negative_passages.docid: 43845
negative_passages.text: Partitioning the edges of $K_n$ into $\lfloor \frac n6 \rfloor$ planar subgraphs
negative_passages.docid: 103106
negative_passages.text: Proving that any permutation in $S_n$ can be written as a product of disjoint cycles
negative_passages.docid: 49439
negative_passages.text: Matrix exponential via Cayley-Hamilton Theorem
negative_passages.docid: 27263
negative_passages.text: How many ways can $b$ balls be distributed in $c$ containers with no more than $n$ balls in any given container?