TheoremBase

Transition Labels and Aggregate Transition Clocks

Statement

Let l≥2l\ge2 be a natural number. A transition label on ll states is an ordered pair c=(σ,γ)c=(\sigma,\gamma) of elements of {1,…,l}\{1,\dots,l\} with σ≠γ\sigma\neq\gamma; the transition labels form the index set of a transition-rate family on ll states.

Let (Ω,F,P)(\Omega,\mathcal{F},P) be a probability space. A family of aggregate transition clocks on ll states over (Ω,F,P)(\Omega,\mathcal{F},P) is a family P=(Pc)\mathsf{P}=(\mathsf{P}^{c}), indexed by the transition labels cc on ll states, of stochastic processes Pc=(Puc)u≥0\mathsf{P}^{c}=(\mathsf{P}^{c}_u)_{u\ge0} on (Ω,F,P)(\Omega,\mathcal{F},P) such that:

1. each Pc\mathsf{P}^{c} is a homogeneous Poisson process with rate 11;

2. for every cc and every ω∈Ω\omega\in\Omega the path u↦Puc(ω)u\mapsto\mathsf{P}^{c}_u(\omega) is a counting path;

3. the family of σ\sigma-algebras σ(Puc:u≥0)\sigma(\mathsf{P}^{c}_u:u\ge0) generated by the individual clocks, indexed by the transition labels, is independent.

For ω∈Ω\omega\in\Omega we write P(ω)\mathsf{P}(\omega) for the family of counting paths (u↦Puc(ω))(u\mapsto\mathsf{P}^{c}_u(\omega)) indexed by the transition labels.

Citations

Loading…

Dependencies

Loading…

Related

0 relations

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.

No relations recorded yet.

Comments

Log in to comment.

Loading…