In statistics and probability theory, a point process or point field is a set of a random number of mathematical points randomly located on a mathematical space such as the real line or Euclidean space.[1][2]

Point processes on the real line form an important special case that is particularly amenable to study,[3] because the points are ordered in a natural way, and the whole point process can be described completely by the (random) intervals between the points. These point processes are frequently used as models for random events in time, such as the arrival of customers in a queue (queueing theory), of impulses in a neuron (computational neuroscience), particles in a Geiger counter, location of radio stations in a telecommunication network[4] or of searches on the world-wide web.

General point processes on a Euclidean space can be used for spatial data analysis,[5][6] which is of interest in such diverse disciplines as forestry, plant ecology, epidemiology, geography, seismology, materials science, astronomy, telecommunications, computational neuroscience,[7] economics[8] and others.

Conventions

edit

Since point processes were historically developed by different communities, there are different mathematical interpretations of a point process, such as a random counting measure or a random set,[9][10] and different notations. The notations are described in detail on the point process notation page.

Some authors regard a point process and stochastic process as two different objects such that a point process is a random object that arises from or is associated with a stochastic process,[11][12] though it has been remarked that the difference between point processes and stochastic processes is not clear.[12] Others consider a point process as a stochastic process, where the process is indexed by sets of the underlying space[a] on which it is defined, such as the real line or  -dimensional Euclidean space.[15][16] Other stochastic processes such as renewal and counting processes are studied in the theory of point processes.[17][12] Sometimes the term "point process" is not preferred, as historically the word "process" denoted an evolution of some system in time, so point process is also called a random point field.[18]

Mathematics

edit

In mathematics, a point process is a random element whose values are "point patterns" on a set S. While in the exact mathematical definition a point pattern is specified as a locally finite counting measure, it is sufficient for more applied purposes to think of a point pattern as a countable subset of S that has no limit points.[clarification needed]

Definition

edit

To define general point processes, we start with a probability space  , and a measurable space   where   is a locally compact second countable Hausdorff space and   is its Borel σ-algebra. Consider now an integer-valued locally finite kernel   from   into  , that is, a mapping   such that:

  1. For every  ,   is a (integer-valued) locally finite measure on  .
  2. For every  ,   is a random variable over  .

This kernel defines a random measure in the following way. We would like to think of   as defining a mapping which maps   to a measure   (namely,  ), where   is the set of all locally finite measures on  . Now, to make this mapping measurable, we need to define a  -field over  . This  -field is constructed as the minimal algebra so that all evaluation maps of the form  , where   is relatively compact, are measurable. Equipped with this  -field, then   is a random element, where for every  ,   is a locally finite measure over  .

Now, by a point process on   we simply mean an integer-valued random measure (or equivalently, integer-valued kernel)   constructed as above. The most common example for the state space S is the Euclidean space Rn or a subset thereof, where a particularly interesting special case is given by the real half-line [0,∞). However, point processes are not limited to these examples and may among other things also be used if the points are themselves compact subsets of Rn, in which case ξ is usually referred to as a particle process.

Despite the name point process since S might not be a subset of the real line, as it might suggest that ξ is a stochastic process.

Representation

edit

Every instance (or event) of a point process ξ can be represented as

 

where   denotes the Dirac measure, n is an integer-valued random variable and   are random elements of S. If  's are almost surely distinct (or equivalently, almost surely   for all  ), then the point process is known as simple.

Another different but useful representation of an event (an event in the event space, i.e. a series of points) is the counting notation, where each instance is represented as an   function, a continuous function which takes integer values:  :

 

which is the number of events in the observation interval  . It is sometimes denoted by  , and   or   mean  .

Expectation measure

edit

The expectation measure (also known as mean measure) of a point process ξ is a measure on S that assigns to every Borel subset B of S the expected number of points of ξ in B. That is,

 

Laplace functional

edit

The Laplace functional   of a point process N is a map from the set of all positive valued functions f on the state space of N, to   defined as follows:

 

They play a similar role as the characteristic functions for random variable. One important theorem says that: two point processes have the same law if their Laplace functionals are equal.

Moment measure

edit

The  th power of a point process,   is defined on the product space   as follows :

 

By monotone class theorem, this uniquely defines the product measure on   The expectation   is called the   th moment measure. The first moment measure is the mean measure.

Let   . The joint intensities of a point process   w.r.t. the Lebesgue measure are functions   such that for any disjoint bounded Borel subsets  

 

Joint intensities do not always exist for point processes. Given that moments of a random variable determine the random variable in many cases, a similar result is to be expected for joint intensities. Indeed, this has been shown in many cases.[2]

Stationarity

edit

A point process   is said to be stationary if   has the same distribution as   for all   For a stationary point process, the mean measure   for some constant   and where   stands for the Lebesgue measure. This   is called the intensity of the point process. A stationary point process on   has almost surely either 0 or an infinite number of points in total. For more on stationary point processes and random measure, refer to Chapter 12 of Daley & Vere-Jones.[2] Stationarity has been defined and studied for point processes in more general spaces than  .

Transformations

edit

A point process transformation is a function that maps a point process to another point process.

Examples

edit

We shall see some examples of point processes in  

Poisson point process

edit

The simplest and most ubiquitous example of a point process is the Poisson point process, which is a spatial generalisation of the Poisson process. A Poisson (counting) process on the line can be characterised by two properties : the number of points (or events) in disjoint intervals are independent and have a Poisson distribution. A Poisson point process can also be defined using these two properties. Namely, we say that a point process   is a Poisson point process if the following two conditions hold

1)   are independent for disjoint subsets  

2) For any bounded subset  ,   has a Poisson distribution with parameter   where   denotes the Lebesgue measure.

The two conditions can be combined and written as follows : For any disjoint bounded subsets   and non-negative integers   we have that

 

The constant   is called the intensity of the Poisson point process. Note that the Poisson point process is characterised by the single parameter   It is a simple, stationary point process. To be more specific one calls the above point process a homogeneous Poisson point process. An inhomogeneous Poisson process is defined as above but by replacing   with   where   is a non-negative function on  

Cox point process

edit

A Cox process (named after Sir David Cox) is a generalisation of the Poisson point process, in that we use random measures in place of  . More formally, let   be a random measure. A Cox point process driven by the random measure   is the point process   with the following two properties :

  1. Given  ,   is Poisson distributed with parameter   for any bounded subset  
  2. For any finite collection of disjoint subsets   and conditioned on   we have that   are independent.

It is easy to see that Poisson point process (homogeneous and inhomogeneous) follow as special cases of Cox point processes. The mean measure of a Cox point process is   and thus in the special case of a Poisson point process, it is  

For a Cox point process,   is called the intensity measure. Further, if   has a (random) density (Radon–Nikodym derivative)   i.e.,

 

then   is called the intensity field of the Cox point process. Stationarity of the intensity measures or intensity fields imply the stationarity of the corresponding Cox point processes.

There have been many specific classes of Cox point processes that have been studied in detail such as:

  • Log-Gaussian Cox point processes:[19]   for a Gaussian random field  
  • Shot noise Cox point processes:,[20]   for a Poisson point process   and kernel  
  • Generalised shot noise Cox point processes:[21]   for a point process   and kernel  
  • Lévy based Cox point processes:[22]   for a Lévy basis   and kernel  , and
  • Permanental Cox point processes:[23]   for k independent Gaussian random fields  's
  • Sigmoidal Gaussian Cox point processes:[24]   for a Gaussian random field   and random  

By Jensen's inequality, one can verify that Cox point processes satisfy the following inequality: for all bounded Borel subsets  ,

 

where   stands for a Poisson point process with intensity measure   Thus points are distributed with greater variability in a Cox point process compared to a Poisson point process. This is sometimes called clustering or attractive property of the Cox point process.

Determinantal point processes

edit

An important class of point processes, with applications to physics, random matrix theory, and combinatorics, is that of determinantal point processes.[25]

Hawkes (self-exciting) processes

edit

A Hawkes process  , also known as a self-exciting counting process, is a simple point process whose conditional intensity can be expressed as

 

where   is a kernel function which expresses the positive influence of past events   on the current value of the intensity process  ,   is a possibly non-stationary function representing the expected, predictable, or deterministic part of the intensity, and   is the time of occurrence of the i-th event of the process.[26]

Geometric processes

edit

Given a sequence of non-negative random variables  , if they are independent and the cdf of   is given by   for  , where   is a positive constant, then   is called a geometric process (GP).[27]

The geometric process has several extensions, including the α- series process[28] and the doubly geometric process.[29]

Point processes on the real half-line

edit

Historically the first point processes that were studied had the real half line R+ = [0,∞) as their state space, which in this context is usually interpreted as time. These studies were motivated by the wish to model telecommunication systems,[30] in which the points represented events in time, such as calls to a telephone exchange.

Point processes on R+ are typically described by giving the sequence of their (random) inter-event times (T1T2, ...), from which the actual sequence (X1X2, ...) of event times can be obtained as

 

If the inter-event times are independent and identically distributed, the point process obtained is called a renewal process.

Intensity of a point process

edit

The intensity λ(t | Ht) of a point process on the real half-line with respect to a filtration Ht is defined as

 

Ht can denote the history of event-point times preceding time t but can also correspond to other filtrations (for example in the case of a Cox process).

In the  -notation, this can be written in a more compact form:

 

The compensator of a point process, also known as the dual-predictable projection, is the integrated conditional intensity function defined by

 
edit

Papangelou intensity function

edit

The Papangelou intensity function of a point process   in the  -dimensional Euclidean space   is defined as

 

where   is the ball centered at   of a radius  , and   denotes the information of the point process   outside  .

Likelihood function

edit

The logarithmic likelihood of a parameterized simple point process conditional upon some observed data is written as

 [31]

Point processes in spatial statistics

edit

The analysis of point pattern data in a compact subset S of Rn is a major object of study within spatial statistics. Such data appear in a broad range of disciplines,[32] amongst which are

  • forestry and plant ecology (positions of trees or plants in general)
  • epidemiology (home locations of infected patients)
  • zoology (burrows or nests of animals)
  • geography (positions of human settlements, towns or cities)
  • seismology (epicenters of earthquakes)
  • materials science (positions of defects in industrial materials)
  • astronomy (locations of stars or galaxies)
  • computational neuroscience (spikes of neurons).

The need to use point processes to model these kinds of data lies in their inherent spatial structure. Accordingly, a first question of interest is often whether the given data exhibit complete spatial randomness (i.e. are a realization of a spatial Poisson process) as opposed to exhibiting either spatial aggregation or spatial inhibition.

In contrast, many datasets considered in classical multivariate statistics consist of independently generated datapoints that may be governed by one or several covariates (typically non-spatial).

Apart from the applications in spatial statistics, point processes are one of the fundamental objects in stochastic geometry. Research has also focussed extensively on various models built on point processes such as Voronoi tessellations, random geometric graphs, and Boolean models.

See also

edit

Notes

edit
  1. ^ In the context of point processes, the term "state space" can mean the space on which the point process is defined such as the real line,[13][14] which corresponds to the index set in stochastic process terminology.

References

edit
  1. ^ Kallenberg, O. (1986). Random Measures, 4th edition. Academic Press, New York, London; Akademie-Verlag, Berlin. ISBN 0-12-394960-2, MR854102.
  2. ^ a b c Daley, D.J, Vere-Jones, D. (1988). An Introduction to the Theory of Point Processes. Springer, New York. ISBN 0-387-96666-8, MR950166.
  3. ^ Last, G., Brandt, A. (1995).Marked point processes on the real line: The dynamic approach. Probability and its Applications. Springer, New York. ISBN 0-387-94547-4, MR1353912
  4. ^ Gilbert E.N. (1961). "Random plane networks". Journal of the Society for Industrial and Applied Mathematics. 9 (4): 533–543. doi:10.1137/0109045.
  5. ^ Diggle, P. (2003). Statistical Analysis of Spatial Point Patterns, 2nd edition. Arnold, London. ISBN 0-340-74070-1.
  6. ^ Baddeley, A. (2006). Spatial point processes and their applications. In A. Baddeley, I. Bárány, R. Schneider, and W. Weil, editors, Stochastic Geometry: Lectures given at the C.I.M.E. Summer School held in Martina Franca, Italy, September 13–18, 2004, Lecture Notes in Mathematics 1892, Springer. ISBN 3-540-38174-0, pp. 1–75
  7. ^ Brown E. N., Kass R. E., Mitra P. P. (2004). "Multiple neural spike train data analysis: state-of-the-art and future challenges". Nature Neuroscience. 7 (5): 456–461. doi:10.1038/nn1228. PMID 15114358. S2CID 562815.{{cite journal}}: CS1 maint: multiple names: authors list (link)
  8. ^ Engle Robert F., Lunde Asger (2003). "Trades and Quotes: A Bivariate Point Process" (PDF). Journal of Financial Econometrics. 1 (2): 159–188. doi:10.1093/jjfinec/nbg011.
  9. ^ Sung Nok Chiu; Dietrich Stoyan; Wilfrid S. Kendall; Joseph Mecke (27 June 2013). Stochastic Geometry and Its Applications. John Wiley & Sons. p. 108. ISBN 978-1-118-65825-3.
  10. ^ Martin Haenggi (2013). Stochastic Geometry for Wireless Networks. Cambridge University Press. p. 10. ISBN 978-1-107-01469-5.
  11. ^ D.J. Daley; D. Vere-Jones (10 April 2006). An Introduction to the Theory of Point Processes: Volume I: Elementary Theory and Methods. Springer Science & Business Media. p. 194. ISBN 978-0-387-21564-8.
  12. ^ a b c Cox, D. R.; Isham, Valerie (1980). Point Processes. CRC Press. p. 3. ISBN 978-0-412-21910-8.
  13. ^ J. F. C. Kingman (17 December 1992). Poisson Processes. Clarendon Press. p. 8. ISBN 978-0-19-159124-2.
  14. ^ Jesper Moller; Rasmus Plenge Waagepetersen (25 September 2003). Statistical Inference and Simulation for Spatial Point Processes. CRC Press. p. 7. ISBN 978-0-203-49693-0.
  15. ^ Samuel Karlin; Howard E. Taylor (2 December 2012). A First Course in Stochastic Processes. Academic Press. p. 31. ISBN 978-0-08-057041-9.
  16. ^ Volker Schmidt (24 October 2014). Stochastic Geometry, Spatial Statistics and Random Fields: Models and Algorithms. Springer. p. 99. ISBN 978-3-319-10064-7.
  17. ^ D.J. Daley; D. Vere-Jones (10 April 2006). An Introduction to the Theory of Point Processes: Volume I: Elementary Theory and Methods. Springer Science & Business Media. ISBN 978-0-387-21564-8.
  18. ^ Sung Nok Chiu; Dietrich Stoyan; Wilfrid S. Kendall; Joseph Mecke (27 June 2013). Stochastic Geometry and Its Applications. John Wiley & Sons. p. 109. ISBN 978-1-118-65825-3.
  19. ^ Moller, J.; Syversveen, A. R.; Waagepetersen, R. P. (1998). "Log Gaussian Cox Processes". Scandinavian Journal of Statistics. 25 (3): 451. CiteSeerX 10.1.1.71.6732. doi:10.1111/1467-9469.00115. S2CID 120543073.
  20. ^ Moller, J. (2003) Shot noise Cox processes, Adv. Appl. Prob., 35.[page needed]
  21. ^ Moller, J. and Torrisi, G.L. (2005) "Generalised Shot noise Cox processes", Adv. Appl. Prob., 37.
  22. ^ Hellmund, G., Prokesova, M. and Vedel Jensen, E.B. (2008) "Lévy-based Cox point processes", Adv. Appl. Prob., 40. [page needed]
  23. ^ Mccullagh,P. and Moller, J. (2006) "The permanental processes", Adv. Appl. Prob., 38.[page needed]
  24. ^ Adams, R. P., Murray, I. MacKay, D. J. C. (2009) "Tractable inference in Poisson processes with Gaussian process intensities", Proceedings of the 26th International Conference on Machine Learning doi:10.1145/1553374.1553376
  25. ^ Hough, J. B., Krishnapur, M., Peres, Y., and Virág, B., Zeros of Gaussian analytic functions and determinantal point processes. University Lecture Series, 51. American Mathematical Society, Providence, RI, 2009.
  26. ^ Patrick J. Laub, Young Lee, Thomas Taimre, The Elements of Hawkes Processes, Springer, 2022.
  27. ^ Lin, Ye (Lam Yeh) (1988). "Geometric processes and replacement problem". Acta Mathematicae Applicatae Sinica. 4 (4): 366–377. doi:10.1007/BF02007241. S2CID 123338120.
  28. ^ Braun, W. John; Li, Wei; Zhao, Yiqiang Q. (2005). "Properties of the geometric and related processes". Naval Research Logistics. 52 (7): 607–616. CiteSeerX 10.1.1.113.9550. doi:10.1002/nav.20099. S2CID 7745023.
  29. ^ Wu, Shaomin (2018). "Doubly geometric processes and applications" (PDF). Journal of the Operational Research Society. 69: 66–77. doi:10.1057/s41274-017-0217-4. S2CID 51889022.
  30. ^ Palm, C. (1943). Intensitätsschwankungen im Fernsprechverkehr (German). Ericsson Technics no. 44, (1943). MR11402
  31. ^ Rubin, I. (Sep 1972). "Regular point processes and their detection". IEEE Transactions on Information Theory. 18 (5): 547–557. doi:10.1109/tit.1972.1054897.
  32. ^ Baddeley, A., Gregori, P., Mateu, J., Stoica, R., and Stoyan, D., editors (2006). Case Studies in Spatial Point Pattern Modelling, Lecture Notes in Statistics No. 185. Springer, New York. ISBN 0-387-28311-0.