Trimmed trees and embedded particle systems. (Q1879818)

From MaRDI portal
Revision as of 22:30, 18 April 2024 by Importer (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Trimmed trees and embedded particle systems.
scientific article

    Statements

    Trimmed trees and embedded particle systems. (English)
    0 references
    0 references
    0 references
    15 September 2004
    0 references
    A superprocess \({\mathcal X}=({\mathcal X}_t)_{t\geq 0}\) taking on values in the space \({\mathcal M}(E)\) of finite measures on some space \(E\) can be rather often related with a branching particle process \(X=(X_t)_{t\geq 0}\) by the formula \[ P^{{\mathcal L}(\text{Pois} (\mu))}[X_t\in\cdot]=P^\mu[ \text{Pois} ({\mathcal X}_t)\in\cdot],\quad t\geq 0,\,\mu\in{\mathcal M}(E), \] where \(\text{Pois}({\mathcal X}_t)\) denotes a Poisson point measure with random intensity \({\mathcal X}_t\) and \(P^{{\mathcal L}(\text{Pois} (\mu))} \) denotes the law of the process \(X\) started with the initial law \({\mathcal L}( \text{Pois} (\mu)).\) This relation holds, for instance, when \({\mathcal X}\) is the standard critical continuous super-Brownian motion in \(R^d\) which corresponds to the evolution equation \(\frac{{\partial}}{{\partial} t}u_t=\frac{1}{2} \Delta u_t-u_t^2\) and \(X\) is a system of binary Brownian motions with branching rate 1 and death rate 1. One can say that \(X\) can be obtained from \({\mathcal X}\) by Poissonization. The authors investigate Poissonization relations for a class of continuous superprocesses on compacta with Feller underlying motion and describe conditions under which a superprocess \({\mathcal X}\) and a branching particle system \(X\) can be coupled as processes in such a way that \[ P[X_t\in\cdot\mid ({\mathcal X}_s)_{0\leq s\leq t}]=P[\text{Pois} (h{\mathcal X}_t)\in\cdot\mid {\mathcal X}_t] \text{ a.s. }\forall t\geq 0, \] where \(h\) is a sufficiently smooth density.
    0 references
    (historical) superprocesses
    0 references
    binary branching
    0 references
    Poissonization
    0 references
    embedded particle system
    0 references
    trimmed tree
    0 references
    compensated \(h\)-transform
    0 references
    finite ancestry property
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references