Campbell's theorem (probability)
In probability theory and statistics, Campbell's theorem or the Campbell–Hardy theorem is either a particular equation or set of results relating to the expectation of a function summed over a point process to an integral involving the mean measure of the point process, which allows for the calculation of expected value and variance of the random sum. One version of the theorem,[1] also known as Campbell's formula,[2]:28 entails an integral equation for the aforementioned sum over a general point process, and not necessarily a Poisson point process.[2] There also exist equations involving moment measures and factorial moment measures that are considered versions of Campbell's formula. All these results are employed in probability and statistics with a particular importance in the theory of point processes[3] and queueing theory[4] as well as the related fields stochastic geometry,[1] continuum percolation theory,[5] and spatial statistics.[2][6]
Another result by the name of Campbell's theorem[7] is specifically for the Poisson point process and gives a method for calculating moments as well as the Laplace functional of a Poisson point process.
The name of both theorems stems from the work[8][9] by Norman R. Campbell on thermionic noise, also known as shot noise, in vacuum tubes,[3][10] which was partly inspired by the work of Ernest Rutherford and Hans Geiger on alpha particle detection, where the Poisson point process arose as a solution to a family of differential equations by Harry Bateman.[10] In Campbell's work, he presents the moments and generating functions of the random sum of a Poisson process on the real line, but remarks that the main mathematical argument was due to G. H. Hardy, which has inspired the result to be sometimes called the Campbell–Hardy theorem.[10][11]
Background
For a point process [math]\displaystyle{ N }[/math] defined on d-dimensional Euclidean space [math]\displaystyle{ \textbf{R}^d }[/math],[lower-alpha 1] Campbell's theorem offers a way to calculate expectations of a real-valued function [math]\displaystyle{ f }[/math] defined also on [math]\displaystyle{ \textbf{R}^d }[/math] and summed over [math]\displaystyle{ N }[/math], namely:
- [math]\displaystyle{ \operatorname E\left[ \sum_{x\in N}f(x)\right], }[/math]
where [math]\displaystyle{ E }[/math] denotes the expectation and set notation is used such that [math]\displaystyle{ N }[/math] is considered as a random set (see Point process notation). For a point process [math]\displaystyle{ N }[/math], Campbell's theorem relates the above expectation with the intensity measure [math]\displaystyle{ \Lambda }[/math]. In relation to a Borel set B the intensity measure of [math]\displaystyle{ N }[/math] is defined as:
- [math]\displaystyle{ \Lambda(B)=\operatorname E[N(B)], }[/math]
where the measure notation is used such that [math]\displaystyle{ N }[/math] is considered a random counting measure. The quantity [math]\displaystyle{ \Lambda(B) }[/math] can be interpreted as the average number of points of the point process [math]\displaystyle{ N }[/math] located in the set B.
First definition: general point process
One version of Campbell's theorem is for a general (not necessarily simple) point process [math]\displaystyle{ N }[/math] with intensity measure:
- [math]\displaystyle{ \Lambda (B)=\operatorname E[N(B)], }[/math]
is known as Campbell's formula[2] or Campbell's theorem,[1][12][13] which gives a method for calculating expectations of sums of measurable functions [math]\displaystyle{ f }[/math] with ranges on the real line. More specifically, for a point process [math]\displaystyle{ N }[/math] and a measurable function [math]\displaystyle{ f: \textbf{R}^d\rightarrow \textbf{R} }[/math], the sum of [math]\displaystyle{ f }[/math] over the point process is given by the equation:
- [math]\displaystyle{ E\left[\sum_{x\in N}f(x)\right]=\int_{\textbf{R}^d} f(x)\Lambda (dx), }[/math]
where if one side of the equation is finite, then so is the other side.[14] This equation is essentially an application of Fubini's theorem[1] and it holds for a wide class of point processes, simple or not.[2] Depending on the integral notation,[lower-alpha 2] this integral may also be written as:[14]
- [math]\displaystyle{ \operatorname E\left[\sum_{x\in N}f(x)\right]=\int_{\textbf{R}^d} f \, d\Lambda , }[/math]
If the intensity measure [math]\displaystyle{ \Lambda }[/math] of a point process [math]\displaystyle{ N }[/math] has a density [math]\displaystyle{ \lambda(x) }[/math], then Campbell's formula becomes:
- [math]\displaystyle{ \operatorname E\left[\sum_{x\in N}f(x)\right]= \int_{\textbf{R}^d} f(x)\lambda(x) \, dx }[/math]
Stationary point process
For a stationary point process [math]\displaystyle{ N }[/math] with constant density [math]\displaystyle{ \lambda\gt 0 }[/math], Campbell's theorem or formula reduces to a volume integral:
- [math]\displaystyle{ \operatorname E\left[\sum_{x\in N}f(x)\right]=\lambda \int_{\textbf{R}^d} f(x) \, dx }[/math]
This equation naturally holds for the homogeneous Poisson point processes, which is an example of a stationary stochastic process.[1]
Applications: Random sums
Campbell's theorem for general point processes gives a method for calculating the expectation of a function of a point (of a point process) summed over all the points in the point process. These random sums over point processes have applications in many areas where they are used as mathematical models.
Shot noise
Campbell originally studied a problem of random sums motivated by understanding thermionic noise in valves, which is also known as shot-noise. Consequently, the study of random sums of functions over point processes is known as shot noise in probability and, particularly, point process theory.
Interference in wireless networks
In wireless network communication, when a transmitter is trying to send a signal to a receiver, all the other transmitters in the network can be considered as interference, which poses a similar problem as noise does in traditional wired telecommunication networks in terms of the ability to send data based on information theory. If the positioning of the interfering transmitters are assumed to form some point process, then shot noise can be used to model the sum of their interfering signals, which has led to stochastic geometry models of wireless networks.[15]
Generalizations
For general point processes, other more general versions of Campbell's theorem exist depending on the nature of the random sum and in particular the function being summed over the point process.
Functions of multiple points
If the function is a function of more than one point of the point process, the moment measures or factorial moment measures of the point process are needed, which can be compared to moments and factorial of random variables. The type of measure needed depends on whether the points of the point process in the random sum are need to be distinct or may repeat.
Repeating points
Moment measures are used when points are allowed to repeat.
Distinct points
Factorial moment measures are used when points are not allowed to repeat, hence points are distinct.
Functions of points and the point process
For general point processes, Campbell's theorem is only for sums of functions of a single point of the point process. To calculate the sum of a function of a single point as well as the entire point process, then generalized Campbell's theorems are required using the Palm distribution of the point process, which is based on the branch of probability known as Palm theory or Palm calculus.
Second definition: Poisson point process
Another version of Campbell's theorem[7] says that for a Poisson point process [math]\displaystyle{ N }[/math] with intensity measure [math]\displaystyle{ \Lambda }[/math] and a measurable function [math]\displaystyle{ f:\textbf{R}^d\rightarrow \textbf{R} }[/math], the random sum
- [math]\displaystyle{ S =\sum_{x\in N}f(x) }[/math]
is absolutely convergent with probability one if and only if the integral
- [math]\displaystyle{ \int_{\textbf{R}^d} \min(|f(x)|,1)\Lambda (dx) \lt \infty. }[/math]
Provided that this integral is finite, then the theorem further asserts that for any complex value [math]\displaystyle{ \theta }[/math] the equation
- [math]\displaystyle{ E(e^{\theta S})=\exp \left(\int_{\textbf{R}^d} [e^{\theta f(x)}-1]\Lambda (dx) \right), }[/math]
holds if the integral on the right-hand side converges, which is the case for purely imaginary [math]\displaystyle{ \theta }[/math]. Moreover,
- [math]\displaystyle{ E(S)=\int_{\textbf{R}^d} f(x)\Lambda (dx), }[/math]
and if this integral converges, then
- [math]\displaystyle{ \operatorname{Var}(S)=\int_{\textbf{R}^d} f(x)^2\Lambda (dx), }[/math]
where [math]\displaystyle{ \text{Var}(S) }[/math] denotes the variance of the random sum [math]\displaystyle{ S }[/math].
From this theorem some expectation results for the Poisson point process follow, including its Laplace functional.[7] [lower-alpha 3]
Application: Laplace functional
For a Poisson point process [math]\displaystyle{ N }[/math] with intensity measure [math]\displaystyle{ \Lambda }[/math], the Laplace functional is a consequence of the above version of Campbell's theorem[7] and is given by:[15]
- [math]\displaystyle{ \mathcal{L}_N(sf) := E\bigl[ e^{-s \sum_{x \in N} f(x) } \bigr] =\exp \Bigl[-\int_{\textbf{R}^d} (1-e^{-sf(x)})\Lambda(dx) \Bigr], }[/math]
which for the homogeneous case is:
- [math]\displaystyle{ \mathcal{L}_N(sf)=\exp\Bigl[-\lambda\int_{\textbf{R}^d}(1-e^{-sf(x)}) \, dx \Bigr]. }[/math]
Notes
- ↑ It can be defined on a more general mathematical space than Euclidean space, but often this space is used for models.[3]
- ↑ As discussed in Chapter 1 of Stoyan, Kendall and Mecke,[1] which applies to all other integrals presented here and elsewhere due to varying integral notation.
- ↑ Kingman[7] calls it a "characteristic functional" but Daley and Vere-Jones[3] and others call it a "Laplace functional",[1][15] reserving the term "characteristic functional" for when [math]\displaystyle{ \theta }[/math] is imaginary.
References
- ↑ 1.0 1.1 1.2 1.3 1.4 1.5 1.6 D. Stoyan, W. S. Kendall, J. Mecke. Stochastic geometry and its applications, volume 2. Wiley Chichester, 1995.
- ↑ 2.0 2.1 2.2 2.3 2.4 Baddeley, A.; Barany, I.; Schneider, R.; Weil, W. (2007). "Spatial Point Processes and their Applications". Stochastic Geometry. Lecture Notes in Mathematics. 1892. pp. 1. doi:10.1007/978-3-540-38175-4_1. ISBN 978-3-540-38174-7.
- ↑ 3.0 3.1 3.2 3.3 Daley, D. J.; Vere-Jones, D. (2003). An Introduction to the Theory of Point Processes. Probability and its Applications. doi:10.1007/b97277. ISBN 978-0-387-95541-4.
- ↑ Brémaud, Pierre; Baccelli, François (2002). Elements of queueing theory: Palm Martingale calculus and stochastic recurrences. Springer Science & Business Media. p. 18,195. ISBN 978-3-642-08537-6.
- ↑ R. Meester and R. Roy. Continuum percolation, volume 119 of Cambridge tracts in mathematics, 1996.
- ↑ Moller, J.; Plenge Waagepetersen, R. (2003). Statistical Inference and Simulation for Spatial Point Processes. C&H/CRC Monographs on Statistics & Applied Probability. 100. doi:10.1201/9780203496930. ISBN 978-1-58488-265-7.
- ↑ 7.0 7.1 7.2 7.3 7.4 Kingman, John (1993). Poisson Processes. Oxford Science Publications. p. 28. ISBN 978-0-19-853693-2.
- ↑ Campbell, N. (1909). "The study of discontinuous phenomena". Proc. Camb. Phil. Soc. 15: 117–136. https://archive.org/details/proceedingsofcam15190810camb.
- ↑ Campbell, N. (1910). "Discontinuities in light emission". Proc. Camb. Phil. Soc. 15: 310–328. https://archive.org/details/proceedingsofcam15190810camb.
- ↑ 10.0 10.1 10.2 Stirzaker, David (2000). "Advice to Hedgehogs, or, Constants Can Vary". The Mathematical Gazette 84 (500): 197–210. doi:10.2307/3621649.
- ↑ Grimmett G. and Stirzaker D. (2001). Probability and random processes. Oxford University Press. pp. 290.
- ↑ Daley, D. J.; Vere-Jones, D. (2008). An Introduction to the Theory of Point Processes. Probability and Its Applications. doi:10.1007/978-0-387-49835-5. ISBN 978-0-387-21337-8.
- ↑ P. Brémaud. Fourier Analysis of Stochastic Processes. Springer, 2014.
- ↑ 14.0 14.1 A. Baddeley. A crash course in stochastic geometry. Stochastic Geometry: Likelihood and Computation Eds OE Barndorff-Nielsen, WS Kendall, HNN van Lieshout (London: Chapman and Hall) pp, pages 1–35, 1999.
- ↑ 15.0 15.1 15.2 Baccelli, F. O. (2009). "Stochastic Geometry and Wireless Networks: Volume I Theory". Foundations and Trends in Networking 3 (3–4): 249–449. doi:10.1561/1300000006. https://hal.inria.fr/inria-00403039/file/FnT1.pdf.
 |  |
