The Law of Large Numbers for Capacity of Memoryless Channels with a Random Matrix of Transition Probabilities

We prove that the capacity of a discrete memoryless channel with a random $n\times n$ matrix of transition probabilities tends almost surely to $1-\gamma$ as $n\to\infty$, where $\gamma=0,5772\dots$ is the Euler constant.