Point process

<h2 id="conventions">Conventions</h2>
Since point processes were historically developed by different communities, there are different mathematical interpretations of a point process, such as a <a href="/facts/Random_counting_measure/kBFkYw1G">random counting measure</a> or a random set,<a class="footnote-ref" id="fnref:9" href="#fn:9">9</a><a class="footnote-ref" id="fnref:10" href="#fn:10">10</a> and different notations. The notations are described in detail on the <a href="/facts/Point_process_notation/WsgC72t7">point process notation</a> 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,<a class="footnote-ref" id="fnref:11" href="#fn:11">11</a><a class="footnote-ref" id="fnref:12" href="#fn:12">12</a> though it has been remarked that the difference between point processes and stochastic processes is not clear.<a class="footnote-ref" id="fnref:13" href="#fn:13">13</a> Others consider a point process as a stochastic process, where the process is indexed by sets of the underlying space<a class="footnote-ref" id="fnref:14" href="#fn:14">14</a> on which it is defined, such as the real line or 
 
 
 
 n
 
 
 {\displaystyle n}
 
-dimensional Euclidean space.<a class="footnote-ref" id="fnref:15" href="#fn:15">15</a><a class="footnote-ref" id="fnref:16" href="#fn:16">16</a> Other stochastic processes such as renewal and counting processes are studied in the theory of point processes.<a class="footnote-ref" id="fnref:17" href="#fn:17">17</a><a class="footnote-ref" id="fnref:18" href="#fn:18">18</a> 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.<a class="footnote-ref" id="fnref:19" href="#fn:19">19</a>

<h2 id="mathematics">Mathematics</h2>
In mathematics, a point process is a <a href="/facts/Random_element/y0H37fQx">random element</a> whose values are "point patterns" on a <a href="/facts/Set_(mathematics)/BfucfHMq">set</a> S. While in the exact mathematical definition a point pattern is specified as a <a href="/facts/Locally_finite_measure/LKAJ96ED">locally finite</a> <a href="/facts/Counting_measure/TA4u39yF">counting measure</a>, it is sufficient for more applied purposes to think of a point pattern as a <a href="/facts/Countable_set/Wj4DmWPv">countable</a> subset of S that has no <a href="/facts/Limit_point/95MykoGU">limit points</a>.

<h3>Definition</h3>
To define general point processes, we start with a probability space 
 
 
 
 (
 Ω
 ,
 
 
 F
 
 
 ,
 P
 )
 
 
 {\displaystyle (\Omega ,{\mathcal {F}},P)}
 
,
and a measurable space 
 
 
 
 (
 S
 ,
 
 
 S
 
 
 )
 
 
 {\displaystyle (S,{\mathcal {S}})}
 
 where 
 
 
 
 S
 
 
 {\displaystyle S}
 
 is a <a href="/facts/Locally_compact_space/hesalT7q">locally compact</a>
<a href="/facts/Second-countable_space/qw9YdnBN">second countable</a> <a href="/facts/Hausdorff_space/gbKIrusl">Hausdorff space</a> and 
 
 
 
 
 
 S
 
 
 
 
 {\displaystyle {\mathcal {S}}}
 
 is its
<a href="/facts/Borel_sigma-algebra/jvSsfpkP">Borel σ-algebra</a>. Consider now an integer-valued locally finite kernel 
 
 
 
 ξ
 
 
 {\displaystyle \xi }

from 
  
    
      
        (
        Ω
        ,
        
          
            F
          
        
        )
      
    
    {\displaystyle (\Omega ,{\mathcal {F}})}
  
 into 
  
    
      
        (
        S
        ,
        
          
            S
          
        
        )
      
    
    {\displaystyle (S,{\mathcal {S}})}
  
, that is, a mapping

Ω
 ×
 
 
 S
 
 
 ↦
 
 
 Z
 
 
 +
 
 
 
 
 {\displaystyle \Omega \times {\mathcal {S}}\mapsto \mathbb {Z} _{+}}
 
 such that:

<ol><li>For every 
 
 
 
 ω
 ∈
 Ω
 
 
 {\displaystyle \omega \in \Omega }
 
, 
 
 
 
 ξ
 (
 ω
 ,
 ⋅
 )
 
 
 {\displaystyle \xi (\omega ,\cdot )}
 
 is a (integer-valued) <a href="/facts/Locally_finite_measure/LKAJ96ED">locally finite measure</a> on 
 
 
 
 S
 
 
 {\displaystyle S}
 
.</li>
<li>For every 
 
 
 
 B
 ∈
 
 
 S
 
 
 
 
 {\displaystyle B\in {\mathcal {S}}}
 
, 
 
 
 
 ξ
 (
 ⋅
 ,
 B
 )
 :
 Ω
 →
 
 
 Z
 
 
 +
 
 
 
 
 {\displaystyle \xi (\cdot ,B):\Omega \to \mathbb {Z} _{+}}
 
 is a random variable over 
 
 
 
 
 
 Z
 
 
 +
 
 
 
 
 {\displaystyle \mathbb {Z} _{+}}
 
.</li></ol>
This kernel defines a <a href="/facts/Random_measure/kBFkYw1G">random measure</a> in the following way. We would like to think of 
 
 
 
 ξ
 
 
 {\displaystyle \xi }

as defining a mapping which maps 
  
    
      
        ω
        ∈
        Ω
      
    
    {\displaystyle \omega \in \Omega }
  
 to a measure 
  
    
      
        
          ξ
          
            ω
          
        
        ∈
        
          
            M
          
        
        (
        
          
            S
          
        
        )
      
    
    {\displaystyle \xi _{\omega }\in {\mathcal {M}}({\mathcal {S}})}

(namely, 
  
    
      
        Ω
        ↦
        
          
            M
          
        
        (
        
          
            S
          
        
        )
      
    
    {\displaystyle \Omega \mapsto {\mathcal {M}}({\mathcal {S}})}
  
),
where 
  
    
      
        
          
            M
          
        
        (
        
          
            S
          
        
        )
      
    
    {\displaystyle {\mathcal {M}}({\mathcal {S}})}
  
 is the set of all locally finite measures on 
  
    
      
        S
      
    
    {\displaystyle S}
  
.
Now, to make this mapping measurable, we need to define a 
  
    
      
        σ
      
    
    {\displaystyle \sigma }
  
-field over 
  
    
      
        
          
            M
          
        
        (
        
          
            S
          
        
        )
      
    
    {\displaystyle {\mathcal {M}}({\mathcal {S}})}
  
.
This 
  
    
      
        σ
      
    
    {\displaystyle \sigma }
  
-field is constructed as the minimal algebra so that all evaluation maps of the form

π
 
 B
 
 
 :
 μ
 ↦
 μ
 (
 B
 )
 
 
 {\displaystyle \pi _{B}:\mu \mapsto \mu (B)}
 
, where 
 
 
 
 B
 ∈
 
 
 S
 
 
 
 
 {\displaystyle B\in {\mathcal {S}}}
 
 is <a href="/facts/Relatively_compact_subset/z5uIqMDp">relatively compact</a>,
are measurable. Equipped with this 
 
 
 
 σ
 
 
 {\displaystyle \sigma }
 
-field, then 
 
 
 
 ξ
 
 
 {\displaystyle \xi }
 
 is a random element, where for every

ω
 ∈
 Ω
 
 
 {\displaystyle \omega \in \Omega }
 
, 
 
 
 
 
 ξ
 
 ω
 
 
 
 
 {\displaystyle \xi _{\omega }}
 
 is a locally finite measure over 
 
 
 
 S
 
 
 {\displaystyle S}
 
.
Now, by a point process on 
 
 
 
 S
 
 
 {\displaystyle S}
 
 we simply mean an integer-valued random measure (or equivalently, integer-valued
kernel) 
 
 
 
 ξ
 
 
 {\displaystyle \xi }
 
 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 <a href="/facts/Stochastic_process/Ng1n1dnB">stochastic process</a>.

<h3>Representation</h3>
Every instance (or event) of a point process ξ can be represented as

ξ
        =
        
          ∑
          
            i
            =
            1
          
          
            n
          
        
        
          δ
          
            
              X
              
                i
              
            
          
        
        ,
      
    
    {\displaystyle \xi =\sum _{i=1}^{n}\delta _{X_{i}},}

where 
 
 
 
 δ
 
 
 {\displaystyle \delta }
 
 denotes the <a href="/facts/Dirac_measure/mj8Qfhr2">Dirac measure</a>, n is an integer-valued random variable and 
 
 
 
 
 X
 
 i
 
 
 
 
 {\displaystyle X_{i}}
 
 are random elements of S. If 
 
 
 
 
 X
 
 i
 
 
 
 
 {\displaystyle X_{i}}
 
's are <a href="/facts/Almost_surely/fWaxzpBA">almost surely</a> distinct (or equivalently, almost surely 
 
 
 
 ξ
 (
 x
 )
 ≤
 1
 
 
 {\displaystyle \xi (x)\leq 1}
 
 for all 
 
 
 
 x
 ∈
 
 
 R
 
 
 d
 
 
 
 
 {\displaystyle x\in \mathbb {R} ^{d}}
 
), then the point process is known as <a href="/facts/Simple_point_process/dlK2FR7w">simple</a>.
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 
 
 
 
 N
 (
 t
 )
 
 
 {\displaystyle N(t)}
 
 function, a continuous function which takes integer values: 
 
 
 
 N
 :
 
 
 R
 
 
 →
 
 
 
 Z
 
 
 0
 
 
 +
 
 
 
 
 
 {\displaystyle N:{\mathbb {R} }\rightarrow {\mathbb {Z} _{0}^{+}}}
 
:

N
        (
        
          t
          
            1
          
        
        ,
        
          t
          
            2
          
        
        )
        =
        
          ∫
          
            
              t
              
                1
              
            
          
          
            
              t
              
                2
              
            
          
        
        ξ
        (
        t
        )
        
        d
        t
      
    
    {\displaystyle N(t_{1},t_{2})=\int _{t_{1}}^{t_{2}}\xi (t)\,dt}

which is the number of events in the observation interval 
 
 
 
 (
 
 t
 
 1
 
 
 ,
 
 t
 
 2
 
 
 ]
 
 
 {\displaystyle (t_{1},t_{2}]}
 
. It is sometimes denoted by 
 
 
 
 
 N
 
 
 t
 
 1
 
 
 ,
 
 t
 
 2
 
 
 
 
 
 
 {\displaystyle N_{t_{1},t_{2}}}
 
, and 
 
 
 
 
 N
 
 T
 
 
 
 
 {\displaystyle N_{T}}
 
 or 
 
 
 
 N
 (
 T
 )
 
 
 {\displaystyle N(T)}
 
 mean 
 
 
 
 
 N
 
 0
 ,
 T
 
 
 
 
 {\displaystyle N_{0,T}}
 
.

<h3>Expectation measure</h3>
Main article: <a href="/facts/Intensity_measure/w8DRBe93">Intensity measure</a>
The expectation measure Eξ (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,

E
        ξ
        (
        B
        )
        :=
        E
        
          
            (
          
        
        ξ
        (
        B
        )
        
          
            )
          
        
        
        
          for every 
        
        B
        ∈
        
          
            B
          
        
        .
      
    
    {\displaystyle E\xi (B):=E{\bigl (}\xi (B){\bigr )}\quad {\text{for every }}B\in {\mathcal {B}}.}

<h3>Laplace functional</h3>
The Laplace functional 
 
 
 
 
 Ψ
 
 N
 
 
 (
 f
 )
 
 
 {\displaystyle \Psi _{N}(f)}
 
 of a point process N is a
map from the set of all positive valued functions f on the state space of N, to 
 
 
 
 [
 0
 ,
 ∞
 )
 
 
 {\displaystyle [0,\infty )}
 
 defined as follows:

Ψ
          
            N
          
        
        (
        f
        )
        =
        E
        [
        exp
        ⁡
        (
        −
        N
        (
        f
        )
        )
        ]
      
    
    {\displaystyle \Psi _{N}(f)=E[\exp(-N(f))]}

They play a similar role as the <a href="/facts/Characteristic_function_(probability_theory)/rl3uAGKM">characteristic functions</a> for <a href="/facts/Random_variable/TwTBXnLT">random variable</a>. One important theorem says that: two point processes have the same law if their Laplace functionals are equal.

<h3>Moment measure</h3>
Main article: <a href="/facts/Moment_measure/KK8xl3DW">Moment measure</a>
The 
 
 
 
 n
 
 
 {\displaystyle n}
 
th power of a point process, 
 
 
 
 
 ξ
 
 n
 
 
 ,
 
 
 {\displaystyle \xi ^{n},}
 
 is defined on the product space 
 
 
 
 
 S
 
 n
 
 
 
 
 {\displaystyle S^{n}}
 
 as follows :

ξ
          
            n
          
        
        (
        
          A
          
            1
          
        
        ×
        ⋯
        ×
        
          A
          
            n
          
        
        )
        =
        
          ∏
          
            i
            =
            1
          
          
            n
          
        
        ξ
        (
        
          A
          
            i
          
        
        )
      
    
    {\displaystyle \xi ^{n}(A_{1}\times \cdots \times A_{n})=\prod _{i=1}^{n}\xi (A_{i})}

By <a href="/facts/Monotone_class_theorem/7kk5VbNj">monotone class theorem</a>, this uniquely defines the product measure on 
 
 
 
 (
 
 S
 
 n
 
 
 ,
 B
 (
 
 S
 
 n
 
 
 )
 )
 .
 
 
 {\displaystyle (S^{n},B(S^{n})).}
 
 The expectation 
 
 
 
 E
 
 ξ
 
 n
 
 
 (
 ⋅
 )
 
 
 {\displaystyle E\xi ^{n}(\cdot )}
 
 is called
the 
 
 
 
 n
 
 
 {\displaystyle n}
 
 th <a href="/facts/Moment_measure/KK8xl3DW">moment measure</a>. The first moment measure is the mean measure.
Let 
 
 
 
 S
 =
 
 
 R
 
 
 d
 
 
 
 
 {\displaystyle S=\mathbb {R} ^{d}}
 
 . The joint intensities of a point process 
 
 
 
 ξ
 
 
 {\displaystyle \xi }
 
 w.r.t. the <a href="/facts/Lebesgue_measure/8us9cGoW">Lebesgue measure</a> are functions 
 
 
 
 
 ρ
 
 (
 k
 )
 
 
 :
 (
 
 
 R
 
 
 d
 
 
 
 )
 
 k
 
 
 →
 [
 0
 ,
 ∞
 )
 
 
 {\displaystyle \rho ^{(k)}:(\mathbb {R} ^{d})^{k}\to [0,\infty )}
 
 such that for any disjoint bounded Borel subsets 
 
 
 
 
 B
 
 1
 
 
 ,
 …
 ,
 
 B
 
 k
 
 
 
 
 {\displaystyle B_{1},\ldots ,B_{k}}

E
        
          (
          
            
              ∏
              
                i
              
            
            ξ
            (
            
              B
              
                i
              
            
            )
          
          )
        
        =
        
          ∫
          
            
              B
              
                1
              
            
            ×
            ⋯
            ×
            
              B
              
                k
              
            
          
        
        
          ρ
          
            (
            k
            )
          
        
        (
        
          x
          
            1
          
        
        ,
        …
        ,
        
          x
          
            k
          
        
        )
        
        d
        
          x
          
            1
          
        
        ⋯
        d
        
          x
          
            k
          
        
        .
      
    
    {\displaystyle E\left(\prod _{i}\xi (B_{i})\right)=\int _{B_{1}\times \cdots \times B_{k}}\rho ^{(k)}(x_{1},\ldots ,x_{k})\,dx_{1}\cdots dx_{k}.}

Joint intensities do not always exist for point processes. Given that <a href="/facts/Moment_(mathematics)/GL7vJ1nb">moments</a> of a <a href="/facts/Random_variable/TwTBXnLT">random variable</a> 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.<a class="footnote-ref" id="fnref:20" href="#fn:20">20</a>

<h3>Stationarity</h3>
A point process 
 
 
 
 ξ
 ⊂
 
 
 R
 
 
 d
 
 
 
 
 {\displaystyle \xi \subset \mathbb {R} ^{d}}
 
 is said to be stationary if 
 
 
 
 ξ
 +
 x
 :=
 
 ∑
 
 i
 =
 1
 
 
 N
 
 
 
 δ
 
 
 X
 
 i
 
 
 +
 x
 
 
 
 
 {\displaystyle \xi +x:=\sum _{i=1}^{N}\delta _{X_{i}+x}}
 
 has the same distribution as 
 
 
 
 ξ
 
 
 {\displaystyle \xi }
 
 for all 
 
 
 
 x
 ∈
 
 
 R
 
 
 d
 
 
 .
 
 
 {\displaystyle x\in \mathbb {R} ^{d}.}
 
 For a stationary point process, the mean measure 
 
 
 
 E
 ξ
 (
 ⋅
 )
 =
 λ
 ‖
 ⋅
 ‖
 
 
 {\displaystyle E\xi (\cdot )=\lambda \|\cdot \|}
 
 for some constant 
 
 
 
 λ
 ≥
 0
 
 
 {\displaystyle \lambda \geq 0}
 
 and where 
 
 
 
 ‖
 ⋅
 ‖
 
 
 {\displaystyle \|\cdot \|}
 
 stands for the Lebesgue measure. This 
 
 
 
 λ
 
 
 {\displaystyle \lambda }
 
 is called the intensity of the point process. A stationary point process on 
 
 
 
 
 
 R
 
 
 d
 
 
 
 
 {\displaystyle \mathbb {R} ^{d}}
 
 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.<a class="footnote-ref" id="fnref:21" href="#fn:21">21</a> Stationarity has been defined and studied for point processes in more general spaces than 
 
 
 
 
 
 R
 
 
 d
 
 
 
 
 {\displaystyle \mathbb {R} ^{d}}
 
.

<h3>Transformations</h3>
Main article: <a href="/facts/Point_process_operation/6RD6WrD4">Point process operation</a>
A point process transformation is a function that maps a point process to another point process.

<h2 id="examples">Examples</h2>
We shall see some examples of point processes in 
 
 
 
 
 
 R
 
 
 d
 
 
 .
 
 
 {\displaystyle \mathbb {R} ^{d}.}

<h3>Poisson point process</h3>
Main article: <a href="/facts/Poisson_point_process/8uphjAUc">Poisson point process</a>
The simplest and most ubiquitous example of a point process is the Poisson point process, which is a spatial generalisation of the <a href="/facts/Poisson_process/8uphjAUc">Poisson process</a>. 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 <a href="/facts/Poisson_distribution/CvCzXkHr">Poisson distribution</a>. A Poisson point process can also be defined using these two properties. Namely, we say that a point process 
 
 
 
 ξ
 
 
 {\displaystyle \xi }
 
 is a Poisson point process if the following two conditions hold
1) 
 
 
 
 ξ
 (
 
 B
 
 1
 
 
 )
 ,
 …
 ,
 ξ
 (
 
 B
 
 n
 
 
 )
 
 
 {\displaystyle \xi (B_{1}),\ldots ,\xi (B_{n})}
 
 are independent for disjoint subsets

B
          
            1
          
        
        ,
        …
        ,
        
          B
          
            n
          
        
        .
      
    
    {\displaystyle B_{1},\ldots ,B_{n}.}

2) For any bounded subset 
 
 
 
 B
 
 
 {\displaystyle B}
 
, 
 
 
 
 ξ
 (
 B
 )
 
 
 {\displaystyle \xi (B)}
 
 has a <a href="/facts/Poisson_distribution/CvCzXkHr">Poisson distribution</a> with parameter 
 
 
 
 λ
 ‖
 B
 ‖
 ,
 
 
 {\displaystyle \lambda \|B\|,}
 
 where

‖
 ⋅
 ‖
 
 
 {\displaystyle \|\cdot \|}
 
 denotes the <a href="/facts/Lebesgue_measure/8us9cGoW">Lebesgue measure</a>.
The two conditions can be combined and written as follows : For any disjoint bounded subsets 
 
 
 
 
 B
 
 1
 
 
 ,
 …
 ,
 
 B
 
 n
 
 
 
 
 {\displaystyle B_{1},\ldots ,B_{n}}
 
 and non-negative integers 
 
 
 
 
 k
 
 1
 
 
 ,
 …
 ,
 
 k
 
 n
 
 
 
 
 {\displaystyle k_{1},\ldots ,k_{n}}
 
 we have that

Pr
        [
        ξ
        (
        
          B
          
            i
          
        
        )
        =
        
          k
          
            i
          
        
        ,
        1
        ≤
        i
        ≤
        n
        ]
        =
        
          ∏
          
            i
          
        
        
          e
          
            −
            λ
            ‖
            
              B
              
                i
              
            
            ‖
          
        
        
          
            
              (
              λ
              ‖
              
                B
                
                  i
                
              
              ‖
              
                )
                
                  
                    k
                    
                      i
                    
                  
                
              
            
            
              
                k
                
                  i
                
              
              !
            
          
        
        .
      
    
    {\displaystyle \Pr[\xi (B_{i})=k_{i},1\leq i\leq n]=\prod _{i}e^{-\lambda \|B_{i}\|}{\frac {(\lambda \|B_{i}\|)^{k_{i}}}{k_{i}!}}.}

The constant 
 
 
 
 λ
 
 
 {\displaystyle \lambda }
 
 is called the intensity of the Poisson point process. Note that the Poisson point process is characterised by the single parameter 
 
 
 
 λ
 .
 
 
 {\displaystyle \lambda .}
 
 It is a simple, stationary point process.
To be more specific one calls the above point process a homogeneous Poisson point process. An <a href="/facts/Inhomogeneous_Poisson_process/8uphjAUc">inhomogeneous Poisson process</a> is defined as above but by replacing 
 
 
 
 λ
 ‖
 B
 ‖
 
 
 {\displaystyle \lambda \|B\|}
 
 with 
 
 
 
 
 ∫
 
 B
 
 
 λ
 (
 x
 )
 
 d
 x
 
 
 {\displaystyle \int _{B}\lambda (x)\,dx}
 
 where 
 
 
 
 λ
 
 
 {\displaystyle \lambda }
 
 is a non-negative function on 
 
 
 
 
 
 R
 
 
 d
 
 
 .
 
 
 {\displaystyle \mathbb {R} ^{d}.}

<h3>Cox point process</h3>
A <a href="/facts/Cox_process/6A45sqyH">Cox process</a> (named after <a href="/facts/David_Cox_(statistician)/RM7agpV5">Sir David Cox</a>) is a generalisation of the Poisson point process, in that we use <a href="/facts/Random_measure/kBFkYw1G">random measures</a> in place of 
 
 
 
 λ
 ‖
 B
 ‖
 
 
 {\displaystyle \lambda \|B\|}
 
. More formally, let 
 
 
 
 Λ
 
 
 {\displaystyle \Lambda }
 
 be a <a href="/facts/Random_measure/kBFkYw1G">random measure</a>. A Cox point process driven by the <a href="/facts/Random_measure/kBFkYw1G">random measure</a> 
 
 
 
 Λ
 
 
 {\displaystyle \Lambda }
 
 is the point process 
 
 
 
 ξ
 
 
 {\displaystyle \xi }
 
 with the following two properties :

<ol><li>Given 
 
 
 
 Λ
 (
 ⋅
 )
 
 
 {\displaystyle \Lambda (\cdot )}
 
, 
 
 
 
 ξ
 (
 B
 )
 
 
 {\displaystyle \xi (B)}
 
 is Poisson distributed with parameter 
 
 
 
 Λ
 (
 B
 )
 
 
 {\displaystyle \Lambda (B)}
 
 for any bounded subset 
 
 
 
 B
 .
 
 
 {\displaystyle B.}
 
</li>
<li>For any finite collection of disjoint subsets 
 
 
 
 
 B
 
 1
 
 
 ,
 …
 ,
 
 B
 
 n
 
 
 
 
 {\displaystyle B_{1},\ldots ,B_{n}}
 
 and conditioned on 
 
 
 
 Λ
 (
 
 B
 
 1
 
 
 )
 ,
 …
 ,
 Λ
 (
 
 B
 
 n
 
 
 )
 ,
 
 
 {\displaystyle \Lambda (B_{1}),\ldots ,\Lambda (B_{n}),}
 
 we have that 
 
 
 
 ξ
 (
 
 B
 
 1
 
 
 )
 ,
 …
 ,
 ξ
 (
 
 B
 
 n
 
 
 )
 
 
 {\displaystyle \xi (B_{1}),\ldots ,\xi (B_{n})}
 
 are independent.</li></ol>
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 
 
 
 
 E
 ξ
 (
 ⋅
 )
 =
 E
 Λ
 (
 ⋅
 )
 
 
 {\displaystyle E\xi (\cdot )=E\Lambda (\cdot )}
 
 and thus in the special case of a Poisson point process, it is 
 
 
 
 λ
 ‖
 ⋅
 ‖
 .
 
 
 {\displaystyle \lambda \|\cdot \|.}

For a Cox point process, 
 
 
 
 Λ
 (
 ⋅
 )
 
 
 {\displaystyle \Lambda (\cdot )}
 
 is called the intensity measure. Further, if 
 
 
 
 Λ
 (
 ⋅
 )
 
 
 {\displaystyle \Lambda (\cdot )}
 
 has a (random) density (<a href="/facts/Radon%25E2%2580%2593Nikodym_theorem/uWepNG2B">Radon–Nikodym derivative</a>) 
 
 
 
 λ
 (
 ⋅
 )
 
 
 {\displaystyle \lambda (\cdot )}
 
 i.e.,

Λ
        (
        B
        )
        
        
          
            
              
                =
              
              
                a.s.
              
            
          
        
        
        
          ∫
          
            B
          
        
        λ
        (
        x
        )
        
        d
        x
        ,
      
    
    {\displaystyle \Lambda (B)\,{\stackrel {\text{a.s.}}{=}}\,\int _{B}\lambda (x)\,dx,}

then 
 
 
 
 λ
 (
 ⋅
 )
 
 
 {\displaystyle \lambda (\cdot )}
 
 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:

<ul><li>Log-Gaussian Cox point processes:<a class="footnote-ref" id="fnref:22" href="#fn:22">22</a> 
 
 
 
 λ
 (
 y
 )
 =
 exp
 ⁡
 (
 X
 (
 y
 )
 )
 
 
 {\displaystyle \lambda (y)=\exp(X(y))}
 
 for a <a href="/facts/Gaussian_random_field/qGKLczth">Gaussian random field</a> 
 
 
 
 X
 (
 ⋅
 )
 
 
 {\displaystyle X(\cdot )}
 
</li>
<li>Shot noise Cox point processes:,<a class="footnote-ref" id="fnref:23" href="#fn:23">23</a> 
 
 
 
 λ
 (
 y
 )
 =
 
 ∑
 
 X
 ∈
 Φ
 
 
 h
 (
 X
 ,
 y
 )
 
 
 {\displaystyle \lambda (y)=\sum _{X\in \Phi }h(X,y)}
 
 for a Poisson point process 
 
 
 
 Φ
 (
 ⋅
 )
 
 
 {\displaystyle \Phi (\cdot )}
 
 and kernel 
 
 
 
 h
 (
 ⋅
 ,
 ⋅
 )
 
 
 {\displaystyle h(\cdot ,\cdot )}
 
</li>
<li>Generalised shot noise Cox point processes:<a class="footnote-ref" id="fnref:24" href="#fn:24">24</a> 
 
 
 
 λ
 (
 y
 )
 =
 
 ∑
 
 X
 ∈
 Φ
 
 
 h
 (
 X
 ,
 y
 )
 
 
 {\displaystyle \lambda (y)=\sum _{X\in \Phi }h(X,y)}
 
 for a point process 
 
 
 
 Φ
 (
 ⋅
 )
 
 
 {\displaystyle \Phi (\cdot )}
 
 and kernel 
 
 
 
 h
 (
 ⋅
 ,
 ⋅
 )
 
 
 {\displaystyle h(\cdot ,\cdot )}
 
</li>
<li>Lévy based Cox point processes:<a class="footnote-ref" id="fnref:25" href="#fn:25">25</a> 
 
 
 
 λ
 (
 y
 )
 =
 ∫
 h
 (
 x
 ,
 y
 )
 L
 (
 d
 x
 )
 
 
 {\displaystyle \lambda (y)=\int h(x,y)L(dx)}
 
 for a Lévy basis 
 
 
 
 L
 (
 ⋅
 )
 
 
 {\displaystyle L(\cdot )}
 
 and kernel 
 
 
 
 h
 (
 ⋅
 ,
 ⋅
 )
 
 
 {\displaystyle h(\cdot ,\cdot )}
 
, and</li>
<li>Permanental Cox point processes:<a class="footnote-ref" id="fnref:26" href="#fn:26">26</a> 
 
 
 
 λ
 (
 y
 )
 =
 
 X
 
 1
 
 
 2
 
 
 (
 y
 )
 +
 ⋯
 +
 
 X
 
 k
 
 
 2
 
 
 (
 y
 )
 
 
 {\displaystyle \lambda (y)=X_{1}^{2}(y)+\cdots +X_{k}^{2}(y)}
 
 for k independent Gaussian random fields 
 
 
 
 
 X
 
 i
 
 
 (
 ⋅
 )
 
 
 {\displaystyle X_{i}(\cdot )}
 
's</li>
<li>Sigmoidal Gaussian Cox point processes:<a class="footnote-ref" id="fnref:27" href="#fn:27">27</a> 
 
 
 
 λ
 (
 y
 )
 =
 
 λ
 
 ⋆
 
 
 
 /
 
 (
 1
 +
 exp
 ⁡
 (
 −
 X
 (
 y
 )
 )
 )
 
 
 {\displaystyle \lambda (y)=\lambda ^{\star }/(1+\exp(-X(y)))}
 
 for a Gaussian random field 
 
 
 
 X
 (
 ⋅
 )
 
 
 {\displaystyle X(\cdot )}
 
 and random 
 
 
 
 
 λ
 
 ⋆
 
 
 >
 0
 
 
 {\displaystyle \lambda ^{\star }>0}
 
</li></ul>
By Jensen's inequality, one can verify that Cox point processes satisfy the following inequality: for all bounded Borel subsets 
 
 
 
 B
 
 
 {\displaystyle B}
 
,

Var
        ⁡
        (
        ξ
        (
        B
        )
        )
        ≥
        Var
        ⁡
        (
        
          ξ
          
            α
          
        
        (
        B
        )
        )
        ,
      
    
    {\displaystyle \operatorname {Var} (\xi (B))\geq \operatorname {Var} (\xi _{\alpha }(B)),}

where 
 
 
 
 
 ξ
 
 α
 
 
 
 
 {\displaystyle \xi _{\alpha }}
 
 stands for a Poisson point process with intensity measure 
 
 
 
 α
 (
 ⋅
 )
 :=
 E
 ξ
 (
 ⋅
 )
 =
 E
 Λ
 (
 ⋅
 )
 .
 
 
 {\displaystyle \alpha (\cdot ):=E\xi (\cdot )=E\Lambda (\cdot ).}
 
 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.

<h3>Determinantal point processes</h3>
An important class of point processes, with applications to <a href="/facts/Physics/a7aH2y08">physics</a>, <a href="/facts/Random_matrix_theory/Yqo1lwFW">random matrix theory</a>, and <a href="/facts/Combinatorics/k14xUoKT">combinatorics</a>, is that of <a href="/facts/Determinantal_point_process/WHCSI09F">determinantal point processes</a>.<a class="footnote-ref" id="fnref:28" href="#fn:28">28</a>

<h3>Hawkes (self-exciting) processes</h3>
Main article: <a href="/facts/Hawkes_process/zsJmxmFf">Hawkes process</a>
A Hawkes process 
 
 
 
 
 N
 
 t
 
 
 
 
 {\displaystyle N_{t}}
 
, also known as a self-exciting counting process, is a simple point process whose conditional intensity can be expressed as

λ
 (
 t
 )
 
 
 
 =
 μ
 (
 t
 )
 +
 
 ∫
 
 −
 ∞
 
 
 t
 
 
 ν
 (
 t
 −
 s
 )
 
 d
 
 N
 
 s
 
 
 
 
 
 
 
 
 =
 μ
 (
 t
 )
 +
 
 ∑
 
 
 T
 
 k
 
 
 <
 t
 
 
 ν
 (
 t
 −
 
 T
 
 k
 
 
 )
 
 
 
 
 
 
 {\displaystyle {\begin{aligned}\lambda (t)&=\mu (t)+\int _{-\infty }^{t}\nu (t-s)\,dN_{s}\\[5pt]&=\mu (t)+\sum _{T_{k}<t}\nu (t-T_{k})\end{aligned}}}

where 
 
 
 
 ν
 :
 
 
 R
 
 
 +
 
 
 →
 
 
 R
 
 
 +
 
 
 
 
 {\displaystyle \nu :\mathbb {R} ^{+}\rightarrow \mathbb {R} ^{+}}
 
 is a kernel function which expresses the positive influence of past events 
 
 
 
 
 T
 
 i
 
 
 
 
 {\displaystyle T_{i}}
 
 on the current value of the intensity process 
 
 
 
 λ
 (
 t
 )
 
 
 {\displaystyle \lambda (t)}
 
, 
 
 
 
 μ
 (
 t
 )
 
 
 {\displaystyle \mu (t)}
 
 is a possibly non-stationary function representing the expected, predictable, or deterministic part of the intensity, and 
 
 
 
 {
 
 T
 
 i
 
 
 :
 
 T
 
 i
 
 
 <
 
 T
 
 i
 +
 1
 
 
 }
 ∈
 
 R
 
 
 
 {\displaystyle \{T_{i}:T_{i}<T_{i+1}\}\in \mathbb {R} }
 
 is the time of occurrence of the i-th event of the process.<a class="footnote-ref" id="fnref:29" href="#fn:29">29</a>

<h3>Geometric processes</h3>
Given a sequence of non-negative random variables 
 
 
 
 {
 
 X
 
 k
 
 
 ,
 k
 =
 1
 ,
 2
 ,
 …
 }
 
 
 {\textstyle \{X_{k},k=1,2,\dots \}}
 
, if they are independent and the cdf of 
 
 
 
 
 X
 
 k
 
 
 
 
 {\displaystyle X_{k}}
 
 is given by 
 
 
 
 F
 (
 
 a
 
 k
 −
 1
 
 
 x
 )
 
 
 {\displaystyle F(a^{k-1}x)}
 
 for 
 
 
 
 k
 =
 1
 ,
 2
 ,
 …
 
 
 {\displaystyle k=1,2,\dots }
 
, where 
 
 
 
 a
 
 
 {\displaystyle a}
 
 is a positive constant, then 
 
 
 
 {
 
 X
 
 k
 
 
 ,
 k
 =
 1
 ,
 2
 ,
 …
 }
 
 
 {\displaystyle \{X_{k},k=1,2,\ldots \}}
 
 is called a geometric process (GP).<a class="footnote-ref" id="fnref:30" href="#fn:30">30</a>
The geometric process has several extensions, including the α- series process<a class="footnote-ref" id="fnref:31" href="#fn:31">31</a> and the doubly geometric process.<a class="footnote-ref" id="fnref:32" href="#fn:32">32</a>

<h2 id="point-processes-on-the-real-half-line">Point processes on the real half-line</h2>
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,<a class="footnote-ref" id="fnref:33" href="#fn:33">33</a> 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 (T1, T2, ...), from which the actual sequence (X1, X2, ...) of event times can be obtained as

X
          
            k
          
        
        =
        
          ∑
          
            j
            =
            1
          
          
            k
          
        
        
          T
          
            j
          
        
        
        
          for 
        
        k
        ≥
        1.
      
    
    {\displaystyle X_{k}=\sum _{j=1}^{k}T_{j}\quad {\text{for }}k\geq 1.}

If the inter-event times are independent and identically distributed, the point process obtained is called a <a href="/facts/Renewal_theory/1rDc2czB">renewal process</a>.

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

λ
        (
        t
        ∣
        
          H
          
            t
          
        
        )
        =
        
          lim
          
            Δ
            t
            →
            0
          
        
        
          
            1
            
              Δ
              t
            
          
        
        Pr
        (
        
          One event occurs in the time-interval
        
        
        [
        t
        ,
        t
        +
        Δ
        t
        ]
        ∣
        
          H
          
            t
          
        
        )
        ,
      
    
    {\displaystyle \lambda (t\mid H_{t})=\lim _{\Delta t\to 0}{\frac {1}{\Delta t}}\Pr({\text{One event occurs in the time-interval}}\,[t,t+\Delta t]\mid H_{t}),}

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 
 
 
 
 N
 (
 t
 )
 
 
 {\displaystyle N(t)}
 
-notation, this can be written in a more compact form:

λ
        (
        t
        ∣
        
          H
          
            t
          
        
        )
        =
        
          lim
          
            Δ
            t
            →
            0
          
        
        
          
            1
            
              Δ
              t
            
          
        
        Pr
        (
        N
        (
        t
        +
        Δ
        t
        )
        −
        N
        (
        t
        )
        =
        1
        ∣
        
          H
          
            t
          
        
        )
        .
      
    
    {\displaystyle \lambda (t\mid H_{t})=\lim _{\Delta t\to 0}{\frac {1}{\Delta t}}\Pr(N(t+\Delta t)-N(t)=1\mid H_{t}).}

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

Λ
        (
        s
        ,
        u
        )
        =
        
          ∫
          
            s
          
          
            u
          
        
        λ
        (
        t
        ∣
        
          H
          
            t
          
        
        )
        
        
          d
        
        t
      
    
    {\displaystyle \Lambda (s,u)=\int _{s}^{u}\lambda (t\mid H_{t})\,\mathrm {d} t}

<h2 id="related-functions">Related functions</h2>
<h3>Papangelou intensity function</h3>
The Papangelou intensity function of a point process 
 
 
 
 N
 
 
 {\displaystyle N}
 
 in the 
 
 
 
 n
 
 
 {\displaystyle n}
 
-dimensional Euclidean space 
 
 
 
 
 
 R
 
 
 n
 
 
 
 
 {\displaystyle \mathbb {R} ^{n}}

is defined as

λ
          
            p
          
        
        (
        x
        )
        =
        
          lim
          
            δ
            →
            0
          
        
        
          
            1
            
              
                |
              
              
                B
                
                  δ
                
              
              (
              x
              )
              
                |
              
            
          
        
        
          P
        
        {
        
          One event occurs in 
        
        
        
          B
          
            δ
          
        
        (
        x
        )
        ∣
        σ
        [
        N
        (
        
          
            R
          
          
            n
          
        
        ∖
        
          B
          
            δ
          
        
        (
        x
        )
        )
        ]
        }
        ,
      
    
    {\displaystyle \lambda _{p}(x)=\lim _{\delta \to 0}{\frac {1}{|B_{\delta }(x)|}}{P}\{{\text{One event occurs in }}\,B_{\delta }(x)\mid \sigma [N(\mathbb {R} ^{n}\setminus B_{\delta }(x))]\},}

where 
 
 
 
 
 B
 
 δ
 
 
 (
 x
 )
 
 
 {\displaystyle B_{\delta }(x)}
 
 is the ball centered at 
 
 
 
 x
 
 
 {\displaystyle x}
 
 of a radius 
 
 
 
 δ
 
 
 {\displaystyle \delta }
 
, and 
 
 
 
 σ
 [
 N
 (
 
 
 R
 
 
 n
 
 
 ∖
 
 B
 
 δ
 
 
 (
 x
 )
 )
 ]
 
 
 {\displaystyle \sigma [N(\mathbb {R} ^{n}\setminus B_{\delta }(x))]}
 
 denotes the information of the point process 
 
 
 
 N
 
 
 {\displaystyle N}

outside 
 
 
 
 
 B
 
 δ
 
 
 (
 x
 )
 
 
 {\displaystyle B_{\delta }(x)}
 
.

<h3>Likelihood function</h3>
The logarithmic likelihood of a parameterized simple point process conditional upon some observed data is written as

ln
 ⁡
 
 
 L
 
 
 (
 N
 (
 t
 
 )
 
 t
 ∈
 [
 0
 ,
 T
 ]
 
 
 )
 =
 
 ∫
 
 0
 
 
 T
 
 
 (
 1
 −
 λ
 (
 s
 )
 )
 
 d
 s
 +
 
 ∫
 
 0
 
 
 T
 
 
 ln
 ⁡
 λ
 (
 s
 )
 
 d
 
 N
 
 s
 
 
 
 
 {\displaystyle \ln {\mathcal {L}}(N(t)_{t\in [0,T]})=\int _{0}^{T}(1-\lambda (s))\,ds+\int _{0}^{T}\ln \lambda (s)\,dN_{s}}
 
<a class="footnote-ref" id="fnref:34" href="#fn:34">34</a>
<h2 id="point-processes-in-spatial-statistics">Point processes in spatial statistics</h2>
The analysis of point pattern data in a compact subset S of Rn is a major object of study within <a href="/facts/Spatial_statistics/R6rlDzRl">spatial statistics</a>. Such data appear in a broad range of disciplines,<a class="footnote-ref" id="fnref:35" href="#fn:35">35</a> amongst which are

<ul><li>forestry and plant ecology (positions of trees or plants in general)</li>
<li>epidemiology (home locations of infected patients)</li>
<li>zoology (burrows or nests of animals)</li>
<li>geography (positions of human settlements, towns or cities)</li>
<li>seismology (epicenters of earthquakes)</li>
<li>materials science (positions of defects in industrial materials)</li>
<li>astronomy (locations of stars or galaxies)</li>
<li>computational neuroscience (spikes of neurons).</li></ul>
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 <a href="/facts/Complete_spatial_randomness/bdyuoY75">complete spatial randomness</a> (i.e. are a realization of a spatial <a href="/facts/Poisson_process/8uphjAUc">Poisson process</a>) as opposed to exhibiting either spatial aggregation or spatial inhibition.
In contrast, many datasets considered in classical <a href="/facts/Multivariate_statistics/tDuNcWrL">multivariate statistics</a> 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 <a href="/facts/Stochastic_geometry/r7BW9A8k">stochastic geometry</a>. Research has also focussed extensively on various models built on point processes such as <a href="/facts/Voronoi_tessellation/AhQY5LD8">Voronoi tessellations</a>, <a href="/facts/Random_geometric_graph/alyjKu21">random geometric graphs</a>, and <a href="/facts/Boolean_model_(probability_theory)/qdgQxDx8">Boolean models</a>.

<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/Empirical_measure/cVHxwALN">Empirical measure</a></li>
<li><a href="/facts/Random_measure/kBFkYw1G">Random measure</a></li>
<li><a href="/facts/Point_process_notation/WsgC72t7">Point process notation</a></li>
<li><a href="/facts/Point_process_operation/6RD6WrD4">Point process operation</a></li>
<li><a href="/facts/Poisson_process/8uphjAUc">Poisson process</a></li>
<li><a href="/facts/Renewal_theory/1rDc2czB">Renewal theory</a></li>
<li><a href="/facts/Invariant_measure/X75B3PcM">Invariant measure</a></li>
<li><a href="/facts/Transfer_operator/e9HDGlfV">Transfer operator</a></li>
<li><a href="/facts/Koopman_operator/j2Tzx5w4">Koopman operator</a></li>
<li><a href="/facts/Shift_operator/6c6lc0ks">Shift operator</a></li></ul>
<h2 id="notes">Notes</h2>

<h2 id="references">References</h2>

<ol>
<li id="fn:1">Kallenberg, O. (1986). Random Measures, 4th edition. Academic Press, New York, London; Akademie-Verlag, Berlin. ISBN 0-12-394960-2, MR854102. <a href="/wiki/Olav_Kallenberg" target="_blank">/wiki/Olav_Kallenberg</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></li>
<li id="fn:2">Daley, D.J, Vere-Jones, D. (1988). An Introduction to the Theory of Point Processes. Springer, New York. ISBN 0-387-96666-8, MR950166. <a href="/wiki/ISBN_(identifier)" target="_blank">/wiki/ISBN_(identifier)</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></li>
<li id="fn: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 <a href="/wiki/ISBN_(identifier)" target="_blank">/wiki/ISBN_(identifier)</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></li>
<li id="fn: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. <a href="/wiki/Edgar_N._Gilbert" target="_blank">/wiki/Edgar_N._Gilbert</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></li>
<li id="fn:5">Diggle, P. (2003). Statistical Analysis of Spatial Point Patterns, 2nd edition. Arnold, London. ISBN 0-340-74070-1. <a href="/wiki/ISBN_(identifier)" target="_blank">/wiki/ISBN_(identifier)</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></li>
<li id="fn: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 <a href="/wiki/ISBN_(identifier)" target="_blank">/wiki/ISBN_(identifier)</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></li>
<li id="fn: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) <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></li>
<li id="fn: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. <a href="https://escholarship.org/content/qt8bh079sq/qt8bh079sq.pdf?t=li5awc" target="_blank">https://escholarship.org/content/qt8bh079sq/qt8bh079sq.pdf?t=li5awc</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></li>
<li id="fn: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. <a href="978-1-118-65825-3" target="_blank">978-1-118-65825-3</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></li>
<li id="fn:10">Martin Haenggi (2013). Stochastic Geometry for Wireless Networks. Cambridge University Press. p. 10. ISBN 978-1-107-01469-5. <a href="978-1-107-01469-5" target="_blank">978-1-107-01469-5</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></li>
<li id="fn: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. <a href="978-0-387-21564-8" target="_blank">978-0-387-21564-8</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></li>
<li id="fn:12">Cox, D. R.; Isham, Valerie (1980). Point Processes. CRC Press. p. 3. ISBN 978-0-412-21910-8. <a href="978-0-412-21910-8" target="_blank">978-0-412-21910-8</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></li>
<li id="fn:13">Cox, D. R.; Isham, Valerie (1980). Point Processes. CRC Press. p. 3. ISBN 978-0-412-21910-8. <a href="978-0-412-21910-8" target="_blank">978-0-412-21910-8</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></li>
<li id="fn:14">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. <a href="#fnref:14" class="footnote-back-ref">↩</a></li>
<li id="fn: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. <a href="978-0-08-057041-9" target="_blank">978-0-08-057041-9</a> <a href="#fnref:15" class="footnote-back-ref">↩</a></li>
<li id="fn: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. <a href="978-3-319-10064-7" target="_blank">978-3-319-10064-7</a> <a href="#fnref:16" class="footnote-back-ref">↩</a></li>
<li id="fn: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. <a href="978-0-387-21564-8" target="_blank">978-0-387-21564-8</a> <a href="#fnref:17" class="footnote-back-ref">↩</a></li>
<li id="fn:18">Cox, D. R.; Isham, Valerie (1980). Point Processes. CRC Press. p. 3. ISBN 978-0-412-21910-8. <a href="978-0-412-21910-8" target="_blank">978-0-412-21910-8</a> <a href="#fnref:18" class="footnote-back-ref">↩</a></li>
<li id="fn:19">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. <a href="978-1-118-65825-3" target="_blank">978-1-118-65825-3</a> <a href="#fnref:19" class="footnote-back-ref">↩</a></li>
<li id="fn:20">Daley, D.J, Vere-Jones, D. (1988). An Introduction to the Theory of Point Processes. Springer, New York. ISBN 0-387-96666-8, MR950166. <a href="/wiki/ISBN_(identifier)" target="_blank">/wiki/ISBN_(identifier)</a> <a href="#fnref:20" class="footnote-back-ref">↩</a></li>
<li id="fn:21">Daley, D.J, Vere-Jones, D. (1988). An Introduction to the Theory of Point Processes. Springer, New York. ISBN 0-387-96666-8, MR950166. <a href="/wiki/ISBN_(identifier)" target="_blank">/wiki/ISBN_(identifier)</a> <a href="#fnref:21" class="footnote-back-ref">↩</a></li>
<li id="fn:22">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. <a href="/wiki/CiteSeerX_(identifier)" target="_blank">/wiki/CiteSeerX_(identifier)</a> <a href="#fnref:22" class="footnote-back-ref">↩</a></li>
<li id="fn:23">Moller, J. (2003) Shot noise Cox processes, Adv. Appl. Prob., 35.[page needed] <a href="/wiki/Wikipedia:Citing_sources" target="_blank">/wiki/Wikipedia:Citing_sources</a> <a href="#fnref:23" class="footnote-back-ref">↩</a></li>
<li id="fn:24">Moller, J. and Torrisi, G.L. (2005) "Generalised Shot noise Cox processes", Adv. Appl. Prob., 37. <a href="#fnref:24" class="footnote-back-ref">↩</a></li>
<li id="fn:25">Hellmund, G., Prokesova, M. and Vedel Jensen, E.B. (2008)
"Lévy-based Cox point processes", Adv. Appl. Prob., 40. [page needed] <a href="/wiki/Eva_Vedel_Jensen" target="_blank">/wiki/Eva_Vedel_Jensen</a> <a href="#fnref:25" class="footnote-back-ref">↩</a></li>
<li id="fn:26">Mccullagh,P. and Moller, J. (2006) "The permanental processes", Adv. Appl. Prob., 38.[page needed] <a href="/wiki/Wikipedia:Citing_sources" target="_blank">/wiki/Wikipedia:Citing_sources</a> <a href="#fnref:26" class="footnote-back-ref">↩</a></li>
<li id="fn:27">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 <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:27" class="footnote-back-ref">↩</a></li>
<li id="fn:28">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. <a href="#fnref:28" class="footnote-back-ref">↩</a></li>
<li id="fn:29">Patrick J. Laub, Young Lee, Thomas Taimre, The Elements of Hawkes Processes, Springer, 2022. <a href="#fnref:29" class="footnote-back-ref">↩</a></li>
<li id="fn:30">Lin, Ye (Lam Yeh) (1988). "Geometric processes and replacement problem". Acta Mathematicae Applicatae Sinica. 4 (4): 366–377. doi:10.1007/BF02007241. S2CID 123338120. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:30" class="footnote-back-ref">↩</a></li>
<li id="fn:31">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. <a href="/wiki/CiteSeerX_(identifier)" target="_blank">/wiki/CiteSeerX_(identifier)</a> <a href="#fnref:31" class="footnote-back-ref">↩</a></li>
<li id="fn:32">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. <a href="https://kar.kent.ac.uk/60730/1/JORS_Wu.pdf" target="_blank">https://kar.kent.ac.uk/60730/1/JORS_Wu.pdf</a> <a href="#fnref:32" class="footnote-back-ref">↩</a></li>
<li id="fn:33">Palm, C. (1943). Intensitätsschwankungen im Fernsprechverkehr (German).
Ericsson Technics no. 44, (1943). MR11402 <a href="/wiki/MR_(identifier)" target="_blank">/wiki/MR_(identifier)</a> <a href="#fnref:33" class="footnote-back-ref">↩</a></li>
<li id="fn:34">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. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:34" class="footnote-back-ref">↩</a></li>
<li id="fn:35">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. <a href="/wiki/ISBN_(identifier)" target="_blank">/wiki/ISBN_(identifier)</a> <a href="#fnref:35" class="footnote-back-ref">↩</a></li>
</ol>

Point process open-in-new

Point process