Uniform Representation of the Rate-One Poisson Counting Path on a Bounded Interval: Distinct Points, Poisson Increments, Conditional Law Given the Cell Counts, and Point Insertion
Reason: First version: uniform representation of the rate-one Poisson counting path on a bounded interval, Poisson increments, conditional law given the cell counts, and point insertion (P4.5 / P2.c).
Let R>0 be real, let J≥1 be a natural number, and let 0=b0<b1<⋯<bJ=R be real numbers; the cells are the intervals Ij=(bj−1,bj], 1≤j≤J, with lengths ∣Ij∣=bj−bj−1, so that (0,R] is their disjoint union. Let (Ω,F,P) be a probability space carrying an independent family of random variables
K,(Vi)i∈N,(Uij)1≤j≤J,i∈N,
where K has the Poisson distribution with parameter R, each Vi has distributionν(0,R], and each Uij has distribution νIj (such a family exists on some probability space by Existence of Independent Sequences with Prescribed Distributions, after enumerating the countable index set by a bijection with N, independence of a family being unaffected by reindexing). Put K=K on {K∈N0} and K=0 elsewhere, as in Thinning: Cell Counts of a Poisson Number of Independent Points, so that K=K with probability 1. Write E for the expectation; sums over an empty index range are 0 and finite products over an empty index range are 1. Let Ω0 be the complement of the union of the countably many events {Vi=Vi′} (i=i′), {Uij=Ui′j′} ((j,i)=(j′,i′)), {Vi∈/(0,R]} and {Uij∈/Ij}; on Ω0 all Vi are pairwise distinct and lie in (0,R], and all Uij are pairwise distinct with Uij∈Ij.
Define the uniform Poisson pathp=(pu)u∈[0,R] and, for every y=(y1,…,yJ)∈N0J, the deterministic-count pathp(y)=(pu(y))u∈[0,R] by
and the cell countsCj=∑i=1K1{Vi∈Ij}, C=(C1,…,CJ). Let R[0,R] be the set of all maps [0,R]→R with the cylinder σ-algebraC, the σ-algebra generated by the coordinate maps evu:x↦x(u), u∈[0,R], that is, by the sets evu−1(B) with u∈[0,R] and B∈B(R). For j0∈{1,…,J} let ej0∈N0J be the vector with j0th entry 1 and all other entries 0.
1. (Distinct points)P(Vi=Vi′)=0 for i=i′ and P(Uij=Ui′j′)=0 for (j,i)=(j′,i′). Consequently Ω0 is an event with P(Ω0)=1.
2. (Poisson increments) Every pu, pu(y) and Cj is a random variable with values in N0, and p0=p0(y)=0 on Ω0. For 0≤s<u≤R, pu−ps=∑i=1K1{Vi∈(s,u]}, and for all real 0≤u0<u1<⋯<ur≤R (r≥1) the increments pu1−pu0,…,pur−pur−1 are independent, puq−puq−1 having the Poisson distribution with parameter uq−uq−1. In particular Cj=pbj−pbj−1, the cell counts C1,…,CJ are independent with Cj Poisson with parameter ∣Ij∣, and P(C=y)=∏j=1Jpoi∣Ij∣(yj)>0 for every y∈N0J.
3. (Conditional law given the cell counts) The maps p:Ω→R[0,R] and p(y):Ω→R[0,R] are measurable with respect to F and C, and for every y∈N0J and every F:R[0,R]→[0,∞] measurable with respect to C (in the sense of Lebesgue Integral of a Nonnegative Measurable Function),
E[F(p)1{C=y}]=P(C=y)E[F(p(y))]in [0,∞].
4. (Insertion of m points into a cell) Let y∈N0J, j0∈{1,…,J} and m∈N. Then for every ω∈Ω and u∈[0,R],
Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.