<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://en.formulasearchengine.com/index.php?action=history&amp;feed=atom&amp;title=Cauchy_process</id>
	<title>Cauchy process - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://en.formulasearchengine.com/index.php?action=history&amp;feed=atom&amp;title=Cauchy_process"/>
	<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/index.php?title=Cauchy_process&amp;action=history"/>
	<updated>2026-05-10T02:38:07Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.0-wmf.28</generator>
	<entry>
		<id>https://en.formulasearchengine.com/index.php?title=Cauchy_process&amp;diff=28805&amp;oldid=prev</id>
		<title>en&gt;Melcombe: move characteristic functions as they don&#039;t define the process</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/index.php?title=Cauchy_process&amp;diff=28805&amp;oldid=prev"/>
		<updated>2013-03-29T17:51:38Z</updated>

		<summary type="html">&lt;p&gt;move characteristic functions as they don&amp;#039;t define the process&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;In [[probability theory]], &amp;#039;&amp;#039;&amp;#039;Kelly&amp;#039;s lemma&amp;#039;&amp;#039;&amp;#039; states that for a stationary [[continuous time Markov chain]], a process defined as the time-reversed process has the same stationary distribution as the forward-time process.&amp;lt;ref name=&amp;quot;bou&amp;quot;&amp;gt;{{cite book | page = 222 | title = Queueing Networks: A Fundamental Approach | first1 = Richard J. |last1= Boucherie | first2= N. M. | last2 = van Dijk | publisher = Springer | year = 2011 | isbn = 144196472X}}&amp;lt;/ref&amp;gt; The theorem is named after [[Frank Kelly (mathematician)|Frank Kelly]].&amp;lt;ref&amp;gt;{{cite book | page = 22 | title = Reversibility and Stochastic Networks | url = http://www.statslab.cam.ac.uk/~frank/BOOKS/kelly_book.html | first = Frank P. | last = Kelly | authorlink = Frank P. Kelly | year = 1979 | publisher = J. Wiley | isbn = 0471276014}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite book | page = 63 (Lemma 2.8.5) | title = An introduction to queueing networks | first = Jean | last = Walrand | year = 1988 | publisher = Prentice Hall | isbn = 013474487X}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite jstor|1425912}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite doi|10.1007/0-387-21525-5_2}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Statement==&lt;br /&gt;
&lt;br /&gt;
For a continuous time Markov chain with state space &amp;#039;&amp;#039;S&amp;#039;&amp;#039; and [[transition rate matrix]] &amp;#039;&amp;#039;Q&amp;#039;&amp;#039; (with elements &amp;#039;&amp;#039;q&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;ij&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt;) if we can find a set of numbers &amp;#039;&amp;#039;q&amp;#039;&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;ij&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt; and &amp;#039;&amp;#039;π&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;i&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt; summing to 1 where&amp;lt;ref name=&amp;quot;bou&amp;quot; /&amp;gt;&lt;br /&gt;
::&amp;lt;math&amp;gt;\begin{align}&lt;br /&gt;
  \sum_{j \neq i} \pi_i q&amp;#039;_{ij} &amp;amp;= \sum_{j \neq i} q_{ij} \quad \forall i\in S\\&lt;br /&gt;
  \pi_i q_{ij} &amp;amp;= \pi_jq_{ji}&amp;#039; \quad \forall i,j \in S&lt;br /&gt;
\end{align}&amp;lt;/math&amp;gt;&lt;br /&gt;
then &amp;#039;&amp;#039;q&amp;#039;&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;ij&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt; are the rates for the reversed process and &amp;#039;&amp;#039;π&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;i&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt; are the stationary distribution for both processes.&lt;br /&gt;
&lt;br /&gt;
===Proof===&lt;br /&gt;
&lt;br /&gt;
Given the assumptions made on the &amp;#039;&amp;#039;q&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;ij&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt; and &amp;#039;&amp;#039;π&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;i&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt; we can see&lt;br /&gt;
::&amp;lt;math&amp;gt; \sum_{i \neq j} \pi_i q_{ij} = \sum_{i \neq j} \pi_j q&amp;#039;_{ji} = \pi_j \sum_{i \neq j} q_{ji} = -\pi_j q_{jj}&amp;lt;/math&amp;gt;&lt;br /&gt;
so the [[global balance equation]]s are satisfied and the &amp;#039;&amp;#039;π&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;i&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt; are a stationary distribution for both processes.&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
{{Reflist}}&lt;br /&gt;
&lt;br /&gt;
[[Category:Stochastic processes]]&lt;br /&gt;
[[Category:Queueing theory]]&lt;/div&gt;</summary>
		<author><name>en&gt;Melcombe</name></author>
	</entry>
</feed>