3
votes
1answer
21 views

The expectation of total number of different states in N time points

[Conditions] (1) An object has K possible states. (2) This object can have only one state at a single time point. (3) The probability of each state at any single time point is 1/K, and each time ...
0
votes
2answers
76 views

How Do You Calculate Probabilities of Random Events Occuring in Sequence?

So I have a series: $f(x_{n+1})=x_n \pm t$ and $f(x_0)=W$ What I'd like to calculate is the probability in terms of $t$ and $W$ (assuming they're any constant $W>t$) that any $f(x_q)=0$ for all ...
1
vote
2answers
222 views

Probability of visiting state $s_1$ of a Markov chain more than $N$ times in $L$ steps.

Assume we have a two-state Markov chain, with $s_1$ and $s_0$ denoting the two states. The initial state of the Markov chain is either $s_1$ or $s_0$ with probability $p_1$ or $p_0$, respectively. The ...
1
vote
1answer
121 views

How can I count clockwise vs counterclockwise cycles in a series of (modular) integers?

I'm working with a Markov process that has a state and transition diagram like in the picture: The transition probabilities are not listed, but they are always positive, but not necessarily ...
4
votes
1answer
180 views

Combinatory + Coding Theory

I am reading about an algorithm for ļ¬nding minimum-weight words in large linear codes. Let $c$ be the codeword of weight $w$ to recover (with size $n$ and in $GF(2)$). Let $N = \left\{1, 2, \ldots, ...
4
votes
1answer
108 views

random walk along edges of tetrahedron — which face gets hit last?

Suppose we have a tetrahedron $abcd$, and start at edge $ab$. Now walk to any "adjacent" edge (i.e. in this case any edge other than $cd$), each with equal probability $1/4$. This gives a stationary ...