Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Point process

From Wikipedia, the free encyclopedia
Random set of points on a space with random number and random position

Instatistics andprobability theory, apoint process orpoint field is a set of a random number ofmathematical points randomly located on a mathematical space such as thereal line orEuclidean 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 aGeiger counter, location of radio stations in atelecommunication network[4] or of searches on theworld-wide web.

General point processes on a Euclidean space can be used forspatial 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 arandom counting measure or a random set,[9][10] and different notations. The notations are described in detail on thepoint 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 orn{\displaystyle n}-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 arandom element whose values are "point patterns" on asetS. While in the exact mathematical definition a point pattern is specified as alocally finitecounting measure, it is sufficient for more applied purposes to think of a point pattern as acountable subset ofS that has nolimit points.[clarification needed]

Definition

[edit]

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}})} whereS{\displaystyle S} is alocally compactsecond countableHausdorff space andS{\displaystyle {\mathcal {S}}} is itsBorel σ-algebra. 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Ω×SZ+{\displaystyle \Omega \times {\mathcal {S}}\mapsto \mathbb {Z} _{+}} such that:

  1. For everyωΩ{\displaystyle \omega \in \Omega },ξ(ω,){\displaystyle \xi (\omega ,\cdot )} is a (integer-valued)locally finite measure onS{\displaystyle S}.
  2. For everyBS{\displaystyle B\in {\mathcal {S}}},ξ(,B):ΩZ+{\displaystyle \xi (\cdot ,B):\Omega \to \mathbb {Z} _{+}} is a random variable overZ+{\displaystyle \mathbb {Z} _{+}}.

This kernel defines arandom measure 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}})}),whereM(S){\displaystyle {\mathcal {M}}({\mathcal {S}})} is the set of all locally finite measures onS{\displaystyle S}.Now, to make this mapping measurable, we need to define aσ{\displaystyle \sigma }-field overM(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)}, whereBS{\displaystyle B\in {\mathcal {S}}} isrelatively compact,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 overS{\displaystyle S}.

Now, bya point process onS{\displaystyle S} we simply meanan integer-valued random measure (or equivalently, integer-valuedkernel)ξ{\displaystyle \xi } constructed as above.The most common example for the state spaceS is the Euclidean spaceRn 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 ofRn, in which caseξ is usually referred to as aparticle process.

Despite the namepoint process sinceS might not be a subset of the real line, as it might suggest that ξ is astochastic process.

Representation

[edit]

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

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

whereδ{\displaystyle \delta } denotes theDirac measure,n is an integer-valued random variable andXi{\displaystyle X_{i}} are random elements ofS. IfXi{\displaystyle X_{i}}'s arealmost surely distinct (or equivalently, almost surelyξ(x)1{\displaystyle \xi (x)\leq 1} for allxRd{\displaystyle x\in \mathbb {R} ^{d}}), then the point process is known assimple.

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 anN(t){\displaystyle N(t)} function, a continuous function which takes integer values:N:RZ0+{\displaystyle N:{\mathbb {R} }\rightarrow {\mathbb {Z} _{0}^{+}}}:

N(t1,t2)=t1t2ξ(t)dt{\displaystyle N(t_{1},t_{2})=\int _{t_{1}}^{t_{2}}\xi (t)\,dt}

which is the number of events in the observation interval(t1,t2]{\displaystyle (t_{1},t_{2}]}. It is sometimes denoted byNt1,t2{\displaystyle N_{t_{1},t_{2}}}, andNT{\displaystyle N_{T}} orN(T){\displaystyle N(T)} meanN0,T{\displaystyle N_{0,T}}.

Expectation measure

[edit]
Main article:Intensity measure

Theexpectation measure (also known asmean measure) of a point process ξ is a measure onS that assigns to every Borel subsetB ofS the expected number of points ofξ inB. That is,

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

Laplace functional

[edit]

TheLaplace functionalΨN(f){\displaystyle \Psi _{N}(f)} of a point processN is amap from the set of all positive valued functionsf on the state space ofN, 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 thecharacteristic functions forrandom variable. One important theorem says that: two point processes have the same law if their Laplace functionals are equal.

Moment measure

[edit]
Main article:Moment measure

Then{\displaystyle n}th power of a point process,ξn,{\displaystyle \xi ^{n},} is defined on the product spaceSn{\displaystyle S^{n}} as follows :

ξn(A1××An)=i=1nξ(Ai){\displaystyle \xi ^{n}(A_{1}\times \cdots \times A_{n})=\prod _{i=1}^{n}\xi (A_{i})}

Bymonotone class theorem, this uniquely defines the product measure on(Sn,B(Sn)).{\displaystyle (S^{n},B(S^{n})).} The expectationEξn(){\displaystyle E\xi ^{n}(\cdot )} is calledthen{\displaystyle n} thmoment measure. The first moment measure is the mean measure.

LetS=Rd{\displaystyle S=\mathbb {R} ^{d}} . Thejoint intensities of a point processξ{\displaystyle \xi } w.r.t. theLebesgue measure are functionsρ(k):(Rd)k[0,){\displaystyle \rho ^{(k)}:(\mathbb {R} ^{d})^{k}\to [0,\infty )} such that for any disjoint bounded Borel subsetsB1,,Bk{\displaystyle B_{1},\ldots ,B_{k}}

E(iξ(Bi))=B1××Bkρ(k)(x1,,xk)dx1dxk.{\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 thatmoments of arandom 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ξRd{\displaystyle \xi \subset \mathbb {R} ^{d}} is said to bestationary ifξ+x:=i=1NδXi+x{\displaystyle \xi +x:=\sum _{i=1}^{N}\delta _{X_{i}+x}} has the same distribution asξ{\displaystyle \xi } for allxRd.{\displaystyle x\in \mathbb {R} ^{d}.} For a stationary point process, the mean measureEξ()=λ{\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 theintensity of the point process. A stationary point process onRd{\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.[2] Stationarity has been defined and studied for point processes in more general spaces thanRd{\displaystyle \mathbb {R} ^{d}}.

Transformations

[edit]
Main article:Point process operation

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 inRd.{\displaystyle \mathbb {R} ^{d}.}

Poisson point process

[edit]
Main article:Poisson point process

The simplest and most ubiquitous example of a point process is thePoisson point process, which is a spatial generalisation of thePoisson 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 aPoisson distribution. 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)ξ(B1),,ξ(Bn){\displaystyle \xi (B_{1}),\ldots ,\xi (B_{n})} are independent for disjoint subsetsB1,,Bn.{\displaystyle B_{1},\ldots ,B_{n}.}

2) For any bounded subsetB{\displaystyle B},ξ(B){\displaystyle \xi (B)} has aPoisson distribution with parameterλB,{\displaystyle \lambda \|B\|,} where{\displaystyle \|\cdot \|} denotes theLebesgue measure.

The two conditions can be combined and written as follows : For any disjoint bounded subsetsB1,,Bn{\displaystyle B_{1},\ldots ,B_{n}} and non-negative integersk1,,kn{\displaystyle k_{1},\ldots ,k_{n}} we have that

Pr[ξ(Bi)=ki,1in]=ieλBi(λBi)kiki!.{\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. Aninhomogeneous Poisson process is defined as above but by replacingλB{\displaystyle \lambda \|B\|} withBλ(x)dx{\displaystyle \int _{B}\lambda (x)\,dx} whereλ{\displaystyle \lambda } is a non-negative function onRd.{\displaystyle \mathbb {R} ^{d}.}

Cox point process

[edit]

ACox process (named afterSir David Cox) is a generalisation of the Poisson point process, in that we userandom measures in place ofλB{\displaystyle \lambda \|B\|}. More formally, letΛ{\displaystyle \Lambda } be arandom measure. A Cox point process driven by therandom measureΛ{\displaystyle \Lambda } is the point processξ{\displaystyle \xi } with the following two properties :

  1. GivenΛ(){\displaystyle \Lambda (\cdot )},ξ(B){\displaystyle \xi (B)} is Poisson distributed with parameterΛ(B){\displaystyle \Lambda (B)} for any bounded subsetB.{\displaystyle B.}
  2. For any finite collection of disjoint subsetsB1,,Bn{\displaystyle B_{1},\ldots ,B_{n}} and conditioned onΛ(B1),,Λ(Bn),{\displaystyle \Lambda (B_{1}),\ldots ,\Lambda (B_{n}),} we have thatξ(B1),,ξ(Bn){\displaystyle \xi (B_{1}),\ldots ,\xi (B_{n})} 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 isEξ()=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 theintensity measure. Further, ifΛ(){\displaystyle \Lambda (\cdot )} has a (random) density (Radon–Nikodym derivative)λ(){\displaystyle \lambda (\cdot )} i.e.,

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

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

By Jensen's inequality, one can verify that Cox point processes satisfy the following inequality: for all bounded Borel subsetsB{\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 calledclustering orattractive property of the Cox point process.

Determinantal point processes

[edit]

An important class of point processes, with applications tophysics,random matrix theory, andcombinatorics, is that ofdeterminantal point processes.[25]

Hawkes (self-exciting) processes

[edit]
Main article:Hawkes process

A Hawkes processNt{\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ν(ts)dNs=μ(t)+Tk<tν(tTk){\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 eventsTi{\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{Ti:Ti<Ti+1}R{\displaystyle \{T_{i}:T_{i}<T_{i+1}\}\in \mathbb {R} } is the time of occurrence of thei-th event of the process.[26]

Geometric processes

[edit]

Given a sequence of non-negative random variables{Xk,k=1,2,}{\textstyle \{X_{k},k=1,2,\dots \}}, if they are independent and the cdf ofXk{\displaystyle X_{k}} is given byF(ak1x){\displaystyle F(a^{k-1}x)} fork=1,2,{\displaystyle k=1,2,\dots }, wherea{\displaystyle a} is a positive constant, then{Xk,k=1,2,}{\displaystyle \{X_{k},k=1,2,\ldots \}} is called a geometric process (GP).[27]

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

Point processes on the real half-line

[edit]

Historically the first point processes that were studied had the real half lineR+ = [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 onR+ 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

Xk=j=1kTjfor k1.{\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 arenewal process.

Intensity of a point process

[edit]

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

λ(tHt)=limΔt01ΔtPr(One event occurs in the time-interval[t,t+Δt]Ht),{\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 timet but can also correspond to other filtrations (for example in the case of a Cox process).

In theN(t){\displaystyle N(t)}-notation, this can be written in a more compact form:

λ(tHt)=limΔt01ΔtPr(N(t+Δt)N(t)=1Ht).{\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}).}

Thecompensator of a point process, also known as thedual-predictable projection, is the integrated conditional intensity function defined by

Λ(s,u)=suλ(tHt)dt{\displaystyle \Lambda (s,u)=\int _{s}^{u}\lambda (t\mid H_{t})\,\mathrm {d} t}

Related functions

[edit]

Papangelou intensity function

[edit]

ThePapangelou intensity function of a point processN{\displaystyle N} in then{\displaystyle n}-dimensional Euclidean spaceRn{\displaystyle \mathbb {R} ^{n}}is defined as

λp(x)=limδ01|Bδ(x)|P{One event occurs in Bδ(x)σ[N(RnBδ(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))]\},}

whereBδ(x){\displaystyle B_{\delta }(x)} is the ball centered atx{\displaystyle x} of a radiusδ{\displaystyle \delta }, andσ[N(RnBδ(x))]{\displaystyle \sigma [N(\mathbb {R} ^{n}\setminus B_{\delta }(x))]} denotes the information of the point processN{\displaystyle N}outsideBδ(x){\displaystyle B_{\delta }(x)}.

Likelihood function

[edit]

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

lnL(N(t)t[0,T])=0T(1λ(s))ds+0Tlnλ(s)dNs{\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}}[31]

Point processes in spatial statistics

[edit]

The analysis of point pattern data in a compact subsetS ofRn is a major object of study withinspatial 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 exhibitcomplete spatial randomness (i.e. are a realization of a spatialPoisson process) as opposed to exhibiting either spatial aggregation or spatial inhibition.

In contrast, many datasets considered in classicalmultivariate 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 instochastic geometry. Research has also focussed extensively on various models built on point processes such asVoronoi tessellations,random geometric graphs, andBoolean 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,MR 0854102.
  2. ^abcDaley, D.J, Vere-Jones, D. (1988).An Introduction to the Theory of Point Processes. Springer, New York.ISBN 0-387-96666-8,MR 0950166.
  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,MR 1353912
  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. ^abcCox, 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. andVedel 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 Learningdoi: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).MR 0011402
  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.
Discrete time
Continuous time
Both
Fields and other
Time series models
Financial models
Actuarial models
Queueing models
Properties
Limit theorems
Inequalities
Tools
Disciplines
Retrieved from "https://en.wikipedia.org/w/index.php?title=Point_process&oldid=1306036492"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp