Talk:Telegraph process

	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
Low	This article has been rated as Low-priority on the project's priority scale.

Statistics Low‑importance

	This article is within the scope of WikiProject Statistics, a collaborative effort to improve the coverage of statistics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.StatisticsWikipedia:WikiProject StatisticsTemplate:WikiProject StatisticsStatistics
Low	This article has been rated as Low-importance on the importance scale.

Does anyone know about the correlation ergodicity of this process? Please give me a hint

--Gogowitsch 14:05, 25 September 2007 (UTC)Reply

No clue! —Preceding unsigned comment added by 206.45.116.11 (talk) 16:30, 26 February 2009 (UTC)Reply

What do you mean by "correlation" ergodicity? (As a Markov chain it fairly trivially is ergodic except if μ is 0 or 1 right? I assume that's not what you're asking.) Cesiumfrog (talk) 00:40, 20 December 2017 (UTC)Reply

This page was redesigned at the edge.