0

For example for [6], $d(1) = \gcd\{3, 5, 6,\, ...\} = 1$.

What do $3,5,6$ calculated from?

haunted85
  • 1,418
Scott
  • 65
  • 6
  • Seems to be times $k$ when $P_k(1,1)>0$ where $P_k(i,j) = \mathsf P(X_k = j|X_0 = i)$. – SBF Jan 03 '13 at 12:08

1 Answers1

1

For other readers' reference, this question refers to the Markov chain in [6] shown here:

enter image description here

and $d(i)$ is the $\gcd$ of those $n>0$ for which there is a path from $i$ to $i$ of length $n$.

How can you get from $1$ to $1$ in $>0$ steps?

Well you can go $1 \to 2 \to 3 \to 1$. That's $3$ steps.

Or you can go $1 \to 2 \to 3 \to 4 \to 3 \to 1$. That's $5$ steps.

Or you can go $1 \to 2 \to 3 \to 1 \to 2 \to 3 \to 1$. That's $6$ steps.

And so on.

Clive Newstead
  • 64,925