Content deleted Content added
Citation bot (talk | contribs) m Alter: isbn, template type. Add: doi, citeseerx. Removed parameters. | You can use this bot yourself. Report bugs here. | User-activated. |
|||
Line 3:
In [[probability]] and [[statistics]], '''point process notation''' comprises the range of [[mathematical notation]] used to symbolically represent [[random]] [[Mathematical object|objects]] known as [[point process]]es, which are used in related fields such as [[stochastic geometry]], [[spatial statistics]] and [[continuum percolation theory]] and frequently serve as [[mathematical models]] of random phenomena, representable as points, in time, space or both.
The notation varies due to the histories of certain mathematical fields and the different interpretations of point processes,<ref name="stoyan1995stochastic">D. Stoyan, W. S. Kendall, J. Mecke, and L. Ruschendorf. ''Stochastic geometry and its applications'', Second Edition, Section 4.1, Wiley Chichester, 1995.</ref><ref name="daleyPPI2003">{{Cite
==Interpretation of point processes==
Line 11:
===Random sequences of points===
In some mathematical frameworks, a given point process may be considered as a sequence of points with each point randomly positioned in ''d''-dimensional [[Euclidean space]] '''R'''<sup>''d''</sup><ref name="stoyan1995stochastic"/> as well as some other more abstract [[mathematical space]]s. In general, whether or not a random sequence is equivalent to the other interpretations of a point process depends on the underlying mathematical space, but this holds true for the setting of finite-dimensional Euclidean space '''R'''<sup>''d''</sup>.<ref name="daleyPPII2008">{{Cite
===Random set of points===
A point process is called ''simple'' if no two (or more points) coincide in ___location with [[Almost surely|probability one]]. Given that often point processes are simple and the order of the points does not matter, a collection of random points can be considered as a random set of points<ref name="stoyan1995stochastic"/><ref name="baddeley2007spatial">{{Cite book | doi = 10.1007/978-3-540-38175-4_1 | first1 = A. | last1 = Baddeley | first2 = I. | last2 = Barany | first3 = R. | last3 = Schneider | first4 = W. | last4 = Weil| chapter = Spatial Point Processes and their Applications | title = Stochastic Geometry | series = Lecture Notes in Mathematics | volume = 1892 | pages = 1 | year = 2007 | isbn = 978-3-540-38174-7 | pmid = | pmc = }}</ref> The theory of random sets was independently developed by [[David George Kendall|David Kendall]] and [[Georges Matheron]]. In terms of being considered as a random set, a sequence of random points is a random closed set if the sequence has no [[Limit point#Types of limit points|accumulation points]] with probability one<ref name="schneider2008stochastic">{{Cite
A point process is often denoted by a single letter,<ref name="stoyan1995stochastic"/><ref name="kingman1992poisson">[[J. F. C. Kingman]]. ''Poisson processes'', volume 3. Oxford university press, 1992.</ref><ref name="moller2003statistical">{{Cite
:<math> x\in {N}, </math>
Line 45:
<math> \Phi(B)=n</math>
to denote that there is the set <math> B</math> that contains <math> n</math> points of <math> {N}</math>. In other words, a point process can be considered as a [[random measure]] that assigns some non-negative integer-valued [[Measure (mathematics)|measure]] to sets.<ref name="stoyan1995stochastic"/> This interpretation has motivated a point process being considered just another name for a ''random counting measure''<ref name="molvcanov2005theory">{{Cite
==Dual notation==
|