How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Poisson and Cox point processes
Definition
Let be as in Random measures and locally finite point processes. A Poisson point process with locally finite, sigma-finite intensity measure is a point process such that for every finite pairwise-disjoint family of Borel sets , the counts are independent random elements (Independent random elements) and has the scalar Poisson law of mean (The scalar Poisson count law, Normalization, moments, and generating function of the Poisson count law). If , the extended count convention is almost surely. Here sigma-finite means that is a countable union of Borel sets of finite -measure (Finite, sigma-finite, and semifinite measures); for the stated , local finiteness also implies sigma-finiteness by the compact exhaustion in Second-countable locally compact Hausdorff spaces admit compact exhaustions.
Let be the evaluation-measurable space of locally finite Borel measures. A Cox point process directed by a random measure consists of a point process , a random locally finite measure , and a supplied probability kernel from to such that is a regular conditional law of given (Conditional law given a random element) and, for -almost every , is the law of a Poisson point process of intensity . The kernel is part of the model data; this definition does not assert that such a kernel exists for every . The mean measure of is , a measure by Mean measures and measurable nonnegative integrals of random measures.
Both definitions permit multiplicities. They do not assert that diffuse directing measures yield simple processes or that a Cox law determines the law of its directing measure.
Depends on
- Random measures and locally finite point processes
- Mean measures and measurable nonnegative integrals of random measures
- The scalar Poisson count law
- Normalization, moments, and generating function of the Poisson count law
- Measure kernel and probability kernel
- Conditional law given a random element
- Independent random elements
- Finite, sigma-finite, and semifinite measures
- Second-countable locally compact Hausdorff spaces admit compact exhaustions
Used by
- Finite-window Gibbs density relative to a Poisson reference Definition
- A CLE can assign negative density near an empty population Example
- A finite-window Poisson process that terminates at time one Example
- Exact and pseudo likelihoods for finite-window Poisson and Strauss models Example
- Homogeneous Poisson likelihood and a Hawkes intensity specification Example
- Poisson and Cox counts with the same mean on a finite window Example
- A finite Poisson process with atomless intensity is simple Lemma
- Finite-window homogeneous Poisson construction and ordered event-time density Lemma
- First and second moments of a Poisson random integral Lemma
- Mecke identity for a finite-intensity Poisson point process Lemma
- Campbell, Laplace, Mecke, and Cox moment formulas Theorem
- Dominating thinning has the prescribed reaction law Theorem
- Existence of a locally finite Poisson point process Theorem
- Finite-intensity Poisson-process existence and mixed-binomial law Theorem
- Finite-window spatial Poisson likelihood relative to unit rate Theorem
- Mecke identity for locally finite Poisson point processes Theorem
- Ripley K for a homogeneous Poisson process is Euclidean ball volume Theorem
Dependency tree · two levels
45 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Gunter Last and Mathew Penrose, Lectures on the Poisson Process, author-hosted 2017 version (standard reference, not scraped)
- Adrian Baddeley, Spatial Point Processes and their Applications, complete lecture notes (standard reference, not scraped)