# 12.3: Arc Sine Laws**

- Page ID
- 3180

In Exercise 1.1.[exer 12.1.6], the distribution of the time of the last equalization in the symmetric random walk was determined. If we let \(\alpha_{2k, 2m}\) denote the probability that a random walk of length \(2m\) has its last equalization at time \(2k\), then we have \[\alpha_{2k, 2m} = u_{2k}u_{2m-2k}\ .\] We shall now show how one can approximate the distribution of the \(\alpha\)’s with a simple function. We recall that \[u_{2k} \sim {1\over{\sqrt {\pi k}}}\ .\] Therefore, as both \(k\) and \(m\) go to \(\infty\), we have \[\alpha_{2k, 2m} \sim {1\over{\pi \sqrt{k(m-k)}}}\ .\] This last expression can be written as \[{1\over{\pi m \sqrt{(k/m)(1 - k/m)}}}\ .\] Thus, if we define \[f(x) = {1\over{\pi \sqrt{x(1-x)}}}\ ,\] for \(0 < x < 1\), then we have \[\alpha_{2k, 2m} \approx {1\over m}f\biggl({k\over m}\biggr)\ .\] The reason for the \(\approx\) sign is that we no longer require that \(k\) get large. This means that we can replace the discrete \(\alpha_{2k, 2m}\) distribution by the continuous density \(f(x)\) on the interval \([0, 1]\) and obtain a good approximation. In particular, if \(x\) is a fixed real number between 0 and 1, then we have \[\sum_{k < xm}\alpha_{2k, 2m} \approx \int_0^x f(t)\,dt\ .\] It turns out that \(f(x)\) has a nice antiderivative, so we can write \[\sum_{k < xm}\alpha_{2k, 2m} \approx {2\over \pi}\arcsin \sqrt x\ .\] One can see from the graph of this last function that it has a minimum at \(x = 1/2\) and is symmetric about that point. As noted in the exercise, this implies that half of the walks of length \(2m\) have no equalizations after time \(m\), a fact which probably would not be guessed.

It turns out that the arc sine density comes up in the answers to many other questions concerning random walks on the line. Recall that in Section 1.1, a random walk could be viewed as a polygonal line connecting \((0,0)\) with \((m, S_m)\). Under this interpretation, we define \(b_{2k, 2m}\) to be the probability that a random walk of length \(2m\) has exactly \(2k\) of its \(2m\) polygonal line segments above the \(t\)-axis.

The probability \(b_{2k, 2m}\) is frequently interpreted in terms of a two-player game. (The reader will recall the game Heads or Tails, in Example [exam 1.3].) Player A is said to be in the lead at time \(n\) if the random walk is above the \(t\)-axis at that time, or if the random walk is on the \(t\)-axis at time \(n\) but above the \(t\)-axis at time \(n-1\). (At time 0, neither player is in the lead.) One can ask what is the most probable number of times that player A is in the lead, in a game of length \(2m\). Most people will say that the answer to this question is \(m\). However, the following theorem says that \(m\) is the least likely number of times that player A is in the lead, and the most likely number of times in the lead is 0 or \(2m\).

Theorem \(\PageIndex{1}\)

If Peter and Paul play a game of Heads or Tails of length \(2m\), the probability that Peter will be in the lead exactly \(2k\) times is equal to \[\alpha_{2k, 2m}\ .\]

Proof

To prove the theorem, we need to show that \[b_{2k, 2m} = \alpha_{2k, 2m}\ . \label{eq 12.3.1}\] Exercise 1.1.[exer 12.1.7] shows that \(b_{2m, 2m} = u_{2m}\) and \(b_{0, 2m} = u_{2m}\), so we only need to prove that Equation [eq 12.3.1] holds for \(1 \le k \le m-1\). We can obtain a recursion involving the \(b\)’s and the \(f\)’s (defined in Section 1.1) by counting the number of paths of length \(2m\) that have exactly \(2k\) of their segments above the \(t\)-axis, where \(1 \le k \le m-1\). To count this collection of paths, we assume that the first return occurs at time \(2j\), where \(1 \le j \le m-1\). There are two cases to consider. Either during the first \(2j\) outcomes the path is above the \(t\)-axis or below the \(t\)-axis. In the first case, it must be true that the path has exactly \((2k - 2j)\) line segments above the \(t\)-axis, between \(t = 2j\) and \(t = 2m\). In the second case, it must be true that the path has exactly \(2k\) line segments above the \(t\)-axis, between \(t = 2j\) and \(t = 2m\).

We now count the number of paths of the various types described above. The number of paths of length \(2j\) all of whose line segments lie above the \(t\)-axis and which return to the origin for the first time at time \(2j\) equals \((1/2)2^{2j}f_{2j}\). This also equals the number of paths of length \(2j\) all of whose line segments lie below the \(t\)-axis and which return to the origin for the first time at time \(2j\). The number of paths of length \((2m - 2j)\) which have exactly \((2k - 2j)\) line segments above the \(t\)-axis is \(b_{2k-2j, 2m-2j}\). Finally, the number of paths of length \((2m-2j)\) which have exactly \(2k\) line segments above the \(t\)-axis is \(b_{2k,2m-2j}\). Therefore, we have

\[b_{2k,2m} = {1\over 2} \sum_{j = 1}^k f_{2j}b_{2k-2j, 2m-2j} + {1\over 2}\sum_{j = 1}^{m-k} f_{2j}b_{2k, 2m-2j}\ .\]

We now assume that Equation [eq 12.3.1] is true for \(m < n\). Then we have

\[\begin{aligned} b_{2k, 2n} &=& {1\over 2} \sum_{j = 1}^k f_{2j}\alpha_{2k-2j, 2m-2j} + {1\over 2}\sum_{j = 1}^{m-k} f_{2j}\alpha_{2k, 2m - 2j}\\ &=& {1\over 2}\sum_{j = 1}^k f_{2j}u_{2k-2j}u_{2m-2k} + {1\over 2}\sum_{j = 1}^{m-k} f_{2j}u_{2k}u_{2m - 2j - 2k}\\ &=& {1\over 2}u_{2m-2k}\sum_{j = 1}^k f_{2j}u_{2k - 2j} + {1\over 2}u_{2k}\sum_{j = 1}^{m-k} f_{2j}u_{2m - 2j - 2k}\\ &=& {1\over 2}u_{2m - 2k}u_{2k} + {1\over 2}u_{2k}u_{2m - 2k}\ ,\end{aligned}\]

where the last equality follows from Theorem [thm 12.1.2]. Thus, we have \[b_{2k, 2n} = \alpha_{2k, 2n}\ ,\] which completes the proof.

\(square\)

We illustrate the above theorem by simulating 10,000 games of Heads or Tails, with each game consisting of 40 tosses. The distribution of the number of times that Peter is in the lead is given in Figure [fig 12.2], together with the arc sine density.

We end this section by stating two other results in which the arc sine density appears. Proofs of these results may be found in Feller.^{8}

Theorem \(\PageIndex{2}\)

Let \(J\) be the random variable which, for a given random walk of length \(2m\), gives the smallest subscript \(j\) such that \(S_{j} = S_{2m}\). (Such a subscript \(j\) must be even, by parity considerations.) Let \(\gamma_{2k, 2m}\) be the probability that \(J = 2k\). Then we have

\[\gamma_{2k, 2m} = \alpha_{2k, 2m}\ .\]

The next theorem says that the arc sine density is applicable to a wide range of situations. A continuous distribution function \(F(x)\) is said to be if \(F(x) = 1 - F(-x)\). (If \(X\) is a continuous random variable with a symmetric distribution function, then for any real \(x\), we have \(P(X \le x) = P(X \ge -x)\).) We imagine that we have a random walk of length \(n\) in which each summand has the distribution \(F(x)\), where \(F\) is continuous and symmetric. The subscript of the of such a walk is the unique subscript \(k\) such that \[S_k > S_0,\ \ldots,\ S_k > S_{k-1},\ S_k \ge S_{k+1},\ \ldots,\ S_k \ge S_n\ .\] We define the random variable \(K_n\) to be the subscript of the first maximum. We can now state the following theorem concerning the random variable \(K_n\).

Theorem \(\PageIndex{3}\)

Let \(F\) be a symmetric continuous distribution function, and let \(\alpha\) be a fixed real number strictly between 0 and 1. Then as \(n \rightarrow \infty\), we have

\[P(K_n < n\alpha) \rightarrow {2\over \pi} \arcsin\sqrt \alpha\ .\]

A version of this theorem that holds for a symmetric random walk can also be found in Feller.

i[exer 12.3.1] For a random walk of length \(2m\), define \(\epsilon_k\) to equal 1 if \(S_k > 0\), or if \(S_{k-1} = 1\) and \(S_k = 0\). Define \(\epsilon_k\) to equal -1 in all other cases. Thus, \(\epsilon_k\) gives the side of the \(t\)-axis that the random walk is on during the time interval \([k-1, k]\). A “law of large numbers" for the sequence \(\{\epsilon_k\}\) would say that for any \(\delta > 0\), we would have \[P\biggl(-\delta <

```
Callstack:
at (Bookshelves/Probability_Theory/Book:_Introductory_Probability_(Grinstead_and_Snell)/12:_Random_Walks/12.03:_Arc_Sine_Laws**), /content/body/p[8]/span[2]/span, line 1, column 1
```

```
Callstack:
at (Bookshelves/Probability_Theory/Book:_Introductory_Probability_(Grinstead_and_Snell)/12:_Random_Walks/12.03:_Arc_Sine_Laws**), /content/body/p[8]/span[3]/span[1], line 1, column 1
```

```
Callstack:
at (Bookshelves/Probability_Theory/Book:_Introductory_Probability_(Grinstead_and_Snell)/12:_Random_Walks/12.03:_Arc_Sine_Laws**), /content/body/p[8]/span[3]/span[2], line 1, column 4
```

i[exer 12.3.2] Given a random walk \(W\) of length \(m\), with summands \[\{X_1, X_2, \ldots,X_m\}\ ,\] define the random walk to be the walk \(W^*\) with summands \[\{X_m, X_{m-1}, \ldots, X_1\}\ .\]

- Show that the \(k\)th partial sum \(S^*_k\) satisfies the equation \[S^*_k = S_m - S_{n-k}\ ,\] where \(S_k\) is the \(k\)th partial sum for the random walk \(W\).
- Explain the geometric relationship between the graphs of a random walk and its reversal. (It is not in general true that one graph is obtained from the other by reflecting in a vertical line.)
- Use parts (a) and (b) to prove Theorem [thm 12.3.2].