In probability theory, the Palm–Khintchine theorem, the work of Conny Palm and Aleksandr Khinchin, expresses that a large number of renewal processes, not necessarily Poissonian, when combined ("superimposed") will have Poissonian properties. It is used to generalise the behaviour of users or clients in queuing theory. It is also used in dependability and reliability modelling of computing and telecommunications.
Theorem According to Heyman and Sobel (2003), the theorem states that the superposition of a large number of independent equilibrium renewal processes, each with a finite intensity, behaves asymptotically like a Poisson process: Let { N i ( t ) , t ≥ 0 } , i = 1 , 2 , … , m {\displaystyle \{N_{i}(t),t\geq 0\},i=1,2,\ldots ,m} be independent renewal processes and { N ( t ) , t > 0 } {\displaystyle \{N(t),t>0\}} be the superposition of these processes. Denote by X j m {\displaystyle X_{jm}} the time between the first and the second renewal epochs in process j {\displaystyle j} . Define N j m ( t ) {\displaystyle N_{jm}(t)} the j {\displaystyle j} th counting process, F j m ( t ) = P ( X j m ≤ t ) {\displaystyle F_{jm}(t)=P(X_{jm}\leq t)} and λ j m = 1 / ( E ( ( X j m ) ) ) {\displaystyle \lambda _{jm}=1/(E((X_{jm)}))} . If the following assumptions hold 1) For all sufficiently large m {\displaystyle m} : λ 1 m + λ m + ⋯ + λ m m = λ < ∞ {\displaystyle \lambda _{1m}+\lambda _{m}+\cdots +\lambda _{mm}=\lambda <\infty }
2) Given ε > 0 {\displaystyle \varepsilon >0} , for every t > 0 {\displaystyle t>0} and sufficiently large m {\displaystyle m} : F j m ( t ) < ε {\displaystyle F_{jm}(t)<\varepsilon } for all j {\displaystyle j}
then the superposition N 0 m ( t ) = N 1 m ( t ) + N m ( t ) + ⋯ + N m m ( t ) {\displaystyle N_{0m}(t)=N_{1m}(t)+N_{m}(t)+\cdots +N_{mm}(t)} of the counting processes approaches a Poisson process as m → ∞ {\displaystyle m\to \infty } .
See also Law of large numbers
References