This article needs attention from an expert in Mathematics. The specific problem is: Needs a proof adding.WikiProject Mathematics may be able to help recruit an expert.(February 2009)
This article is about the theorem in Markov probability theory. For the theorem in electrical engineering, see Foster's reactance theorem.
In probability theory, Foster's theorem, named after Gordon Foster,[1] is used to draw conclusions about the positive recurrence of Markov chains with countable state spaces. It uses the fact that positive recurrent Markov chains exhibit a notion of "Lyapunov stability" in terms of returning to any state while starting from it within a finite time interval.
Theoremedit
Consider an irreducible discrete-time Markov chain on a countable state space having a transition probability matrix with elements for pairs , in . Foster's theorem states that the Markov chain is positive recurrent if and only if there exists a Lyapunov function, such that and
^Foster, F. G. (1953). "On the Stochastic Matrices Associated with Certain Queuing Processes". The Annals of Mathematical Statistics. 24 (3): 355. doi:10.1214/aoms/1177728976. JSTOR 2236286.
^Brémaud, P. (1999). "Lyapunov Functions and Martingales". Markov Chains. pp. 167. doi:10.1007/978-1-4757-3124-8_5. ISBN978-1-4419-3131-3.
This probability-related article is a stub. You can help Wikipedia by expanding it.
foster, theorem, this, article, needs, attention, from, expert, mathematics, specific, problem, needs, proof, adding, wikiproject, mathematics, able, help, recruit, expert, february, 2009, this, article, about, theorem, markov, probability, theory, theorem, el. This article needs attention from an expert in Mathematics The specific problem is Needs a proof adding WikiProject Mathematics may be able to help recruit an expert February 2009 This article is about the theorem in Markov probability theory For the theorem in electrical engineering see Foster s reactance theorem In probability theory Foster s theorem named after Gordon Foster 1 is used to draw conclusions about the positive recurrence of Markov chains with countable state spaces It uses the fact that positive recurrent Markov chains exhibit a notion of Lyapunov stability in terms of returning to any state while starting from it within a finite time interval Theorem editConsider an irreducible discrete time Markov chain on a countable state space S displaystyle S nbsp having a transition probability matrix P displaystyle P nbsp with elements p i j displaystyle p ij nbsp for pairs i displaystyle i nbsp j displaystyle j nbsp in S displaystyle S nbsp Foster s theorem states that the Markov chain is positive recurrent if and only if there exists a Lyapunov function V S R displaystyle V S to mathbb R nbsp such that V i 0 i S displaystyle V i geq 0 text forall text i in S nbsp and j S p i j V j lt displaystyle sum j in S p ij V j lt infty nbsp for i F displaystyle i in F nbsp j S p i j V j V i e displaystyle sum j in S p ij V j leq V i varepsilon nbsp for all i F displaystyle i notin F nbsp for some finite set F displaystyle F nbsp and strictly positive e displaystyle varepsilon nbsp 2 Related links editLyapunov optimizationReferences edit Foster F G 1953 On the Stochastic Matrices Associated with Certain Queuing Processes The Annals of Mathematical Statistics 24 3 355 doi 10 1214 aoms 1177728976 JSTOR 2236286 Bremaud P 1999 Lyapunov Functions and Martingales Markov Chains pp 167 doi 10 1007 978 1 4757 3124 8 5 ISBN 978 1 4419 3131 3 nbsp This probability related article is a stub You can help Wikipedia by expanding it vte Retrieved from https en wikipedia org w index php title Foster 27s theorem amp oldid 1158989542, wikipedia, wiki, book, books, library,