|
|
| Line 1: |
Line 1: |
| In [[probability]] and [[statistics]], a '''point process operation''' is a type of [[mathematical operation]] performed on a [[random]] object known as a [[point process]], which are often used as [[mathematical models]] of phenomena that can be represented as [[point (geometry)|point]]s randomly located in space. These operations can be purely random, [[deterministic]] or both, and are used to construct new point processes, which can be then also used as mathematical models. The operations may include removing or ''thinning'' points from a point process, combining or ''superimposing'' multiple point processes into one point process or [[Transformation (function)|transforming]] the underlying space of the point process into another space.
| | Hi in that respect. My name is Maynard and I totally dig that manufacturer. Hiring has been my profession for days but soon my husband and I will start much of our business. His wife and him decided to reside in California but he must be move the his bloodline. One of my personal hobbies is always to ice skate but Do not think have the time lately. Check out the latest news on my website: http://devolro.com/video<br><br>my homepage; [http://devolro.com/video road] |
| | |
| One point process that gives particularly convenient results under point process operations is the [[Poisson point process]],<ref name="kingman1992poisson">J. F. C. Kingman. ''Poisson processes'', volume 3. Oxford university press, 1992.
| |
| | |
| </ref> hence it is often used as a mathematical model.<ref name="kingman1992poisson"/><ref name="stoyan1995stochastic">D. Stoyan, W. S. Kendall, J. Mecke, and L. Ruschendorf. ''Stochastic geometry and its applications'', volume 2. Wiley Chichester, 1995.</ref>
| |
| | |
| Point process operations and the resulting point processes are used in the theory of [[point process]]es and related fields such as [[stochastic geometry]] and [[spatial statistics]].<ref name="stoyan1995stochastic"/>
| |
| | |
| ==Point process notation==
| |
| {{Main|Point process notation}}
| |
| | |
| Point processes are mathematical objects that seek to represent collections of points randomly scattered on some underlying [[mathematical space]]. They have a number of interpretations, which is reflected by the various types of [[point process notation]].<ref name="stoyan1995stochastic"/><ref name="BB2">F. Baccelli and B. Błaszczyszyn. ''Stochastic Geometry and Wireless Networks, Volume II – Applications'', volume 4, No 1–2 of ''Foundations and Trends in Networking''. NoW Publishers, 2009.
| |
| | |
| </ref> For example, if a point <math>\textstyle x</math> belongs to or is a member of a point process, denoted by <math>\textstyle {N}</math>, then this can be written as:<ref name="stoyan1995stochastic"/>
| |
| | |
| : <math>\textstyle x\in {N},</math>
| |
| | |
| and represents the point process as a random [[Set (mathematics)|set]]. Alternatively, the number of points of <math>\textstyle {N}</math> located in some [[Borel set]] <math>\textstyle B</math> is often written as:<ref name="stoyan1995stochastic"/><ref name="moller2003statistical">{{cite doi|10.1201/9780203496930}}</ref><ref name="BB1"/>
| |
| | |
| : <math>\textstyle {N}(B),</math>
| |
| | |
| which reflects a [[random measure]] interpretation for point processes.
| |
| | |
| A point process needs to be defined on an underlying mathematical space. Often this space is ''d''-dimensional Euclidean space denoted here by <math>\textstyle \textbf{R}^{ d}</math>, although point processes can be defined on more [[Abstraction (mathematics)|abstract]] [[Space (mathematics)|mathematical spaces]].<ref name="daleyPPII2008"/>
| |
| | |
| ==Examples of operations==
| |
| | |
| To develop suitable models with point processes in stochastic geometry, spatial statistics and related fields, there are number of useful transformations that can be performed on points processes including: thinning, superposition, mapping (or transformation of space), clustering, and random displacement.<ref name="kingman1992poisson"/><ref name="stoyan1995stochastic"/><ref name="BB1">F. Baccelli and B. B{\l}aszczyszyn. ''Stochastic Geometry and Wireless Networks, Volume I – Theory'', volume 3, No 3–4 of ''Foundations and Trends in Networking''. NoW Publishers, 2009.
| |
| | |
| </ref><ref name="baddeley2007spatial">A. Baddeley, I. B{\'a}r{\'a}ny, and R. Schneider. Spatial point processes and their applications. ''Stochastic Geometry: Lectures given at the CIME Summer School held in Martina Franca, Italy, September 13–18, 2004'', pages 1–75, 2007.
| |
| | |
| </ref>
| |
| | |
| ===Thinning===
| |
| | |
| The thinning operation entails using some predefined rule to remove points from a point process <math>\textstyle {N}</math> to form a new point process <math>\textstyle {N}_p</math>. These rules may be completely random, which is the case for one of the simplest rules known as <math>\textstyle p</math>-thinning:<ref name="stoyan1995stochastic"/> each point of <math>\textstyle {N}</math> is independently removed (or kept) with some probability <math>\textstyle p</math> (or <math>\textstyle 1-p</math>). This rule may be generalized by introducing a non-negative function <math>\textstyle p(x)\leq 1</math> in order to define the located-dependent <math>\textstyle p(x)</math>-thinning where now the probability of a point being removed is <math>\textstyle p(x)</math> and is dependent on where the point of <math>\textstyle {N}</math> is located on the underlying space. A further generalization is to have the thinning probability <math>\textstyle p</math> random itself.
| |
| | |
| These three operations are all types of independent thinning, which means the interaction between points has no effect on the where a point is removed (or kept). Another generalization involves dependent thinning where points of the point process are removed (or kept) depending on their location to other points of the point process. Thinning can be used to create new point processes such as hard-core processes where points do not exist (due to thinning) within a certain radius of each point in the thinned point process.<ref name="stoyan1995stochastic"/>
| |
| | |
| ===Superposition===
| |
| | |
| If there is a [[countable set]] or collection of point processes <math>\textstyle {N}_1,{N}_2\dots</math> with mean measures <math>\textstyle \Lambda_1,\Lambda_2,\dots</math>, then their superposition
| |
| | |
| :<math> {N}=\bigcup_{i=1}^{\infty}{N}_i, </math> | |
| | |
| also forms a point process. In this expression the superposition operation is denoted by a [[Union (set theory)|set union]]), which implies the random set interpretation of point processes; see [[Point process notation]] for more information.
| |
| | |
| ====Poisson point process case====
| |
| | |
| In the case where each <math>\textstyle {N}_i</math> is a Poisson point process, then the resulting process <math>\textstyle {N}</math> is also a Poisson point process with mean intensity
| |
| | |
| :<math> \Lambda=\sum\limits_{i=1}^{\infty}\Lambda_i. </math> | |
| | |
| ===Clustering===
| |
| | |
| The point operation known as ''clustering'' entails replacing every point <math>\textstyle x</math> in a given point process <math>\textstyle {N}</math> with a ''cluster'' of points <math>\textstyle N^x</math>. Each cluster is also a point process, but with a finite number of points. The union of all the clusters forms a ''cluster point process''
| |
| | |
| :<math> {N}_c=\bigcup_{x\in{N}}N^x. </math>
| |
| | |
| Often is it assumed that the clusters <math>\textstyle N^x</math> are all sets of finite points with each set being [[independent and identically distributed]]. Furthermore, if the original point process <math>\textstyle {N}</math> has a constant intensity <math>\textstyle \lambda</math>, then the intensity of the cluster point process <math>\textstyle {N}_c</math> will be
| |
| | |
| :<math> \lambda_c= c \lambda, </math> | |
| | |
| where the constant <math>\textstyle c</math> is the mean of number of points in each <math>\textstyle N^x</math>.
| |
| | |
| ===Random displacement===
| |
| | |
| A mathematical model may require randomly moving points of a point process from some locations to other locations on the underlying [[mathematical space]].<ref name="kingman1992poisson"/> This point process operation is referred to as random ''displacement''<ref name="kingman1992poisson"/> or ''translation''.<ref name="daleyPPII2008"/> If each point in the process is displaced or translated independently to other all other points in the process, then the operation forms an ''independent'' displacement or or translation.<ref name="daleyPPII2008"/> It is usually assume that all the random translations have a common [[probability distribution]]; hence the displacements form a set of [[independent and identically distributed]] random vectors in the underlying mathematical space.
| |
| | |
| Applying random displacements or trnaslations to point processes may be used as mathematical models for mobility of objects in, for example, ecology<ref name="kingman1992poisson"/> or wireless networks.<ref name="BB2"/>
| |
| | |
| ====Poisson point process case====
| |
| | |
| The result known as the displacement theorem<ref name="kingman1992poisson"/> effectively says that the random [[Independence (probability theory)|independent]] displacement of points of a Poisson point process (on the same underlying space) forms another Poisson point process.
| |
| | |
| ===Transformation of space===
| |
| | |
| Another property that is considered useful is the ability to map a point process from one underlying space to another space. For example, a point process defined on the plane '''R'''<sup>2</sup> can be transformed from [[Cartesian coordinates]] to [[polar coordinates]].<ref name="kingman1992poisson"/>
| |
| | |
| ====Poisson point process case====
| |
| | |
| Provided that the mapping (or transformation) adheres to some conditions, then a result sometimes known as the ''mapping theorem''<ref name="kingman1992poisson"/> says that if the original process is a Poisson point process with some intensity measure, then the resulting mapped (or transformed) collection of points also forms a Poisson point process with another intensity measure.
| |
| | |
| ==Convergence of point process operations==
| |
| | |
| A point operation performed once on some point process can be, in general, performed again and again. In the theory of point processes, results have been derived to study the behaviour of the resulting point process, via [[convergence (mathematics)|convergence]] results, in the limit as the number of performed operations approaches infinity.<ref name="daleyPPII2008">D. J. Daley and D. Vere-Jones. ''An introduction to the theory of point processes. Vol. {II''}. Probability and its Applications (New York). Springer, New York, second edition, 2008.
| |
| | |
| </ref> For example, if each point in a general point process is repeatedly displaced in a certain random and independent manner, then the new point process, informally speaking, will more and more resemble a Poisson point process. Similar convergence results have been developed for the operations of thinning and superposition (with suitable rescaling of the underlying space).<ref name="daleyPPII2008"/>
| |
| | |
| ==References==
| |
| | |
| <references/>
| |
| | |
| [[Category:Point processes| ]]
| |
| [[Category:Spatial processes]]
| |
Hi in that respect. My name is Maynard and I totally dig that manufacturer. Hiring has been my profession for days but soon my husband and I will start much of our business. His wife and him decided to reside in California but he must be move the his bloodline. One of my personal hobbies is always to ice skate but Do not think have the time lately. Check out the latest news on my website: http://devolro.com/video
my homepage; road