TheoremBase

Moment Bounds for the Aggregate Compensated Counters of the Controlled N-Agent Dynamics

Statement

Adopt the setting of the compensated counters of the controlled NN-agent dynamics with NN agents, ll states, l~\tilde{l} observation channels, and control dimension mm: a transition-rate family β\beta with rate bound BB, an observation-rate family β~\tilde{\beta} with rate bound B~\tilde{B}, a horizon T>0T>0, an NN-agent driving system (Ω,F,P)(\Omega,\mathcal{F},P), an observation-driven control policy hh, a solution on [0,T][0,T] with regular event Ω0\Omega_0, counters Nti,σγN^{i,\sigma\gamma}_t, consumed clock times Tti,σγ\mathcal{T}^{i,\sigma\gamma}_t, and system filtration (Ftsys)t∈[0,T](\mathcal{F}^{\mathrm{sys}}_t)_{t\in[0,T]}, and the compensated counters Mti,σγ=Nti,σγ−Tti,σγM^{i,\sigma\gamma}_t=N^{i,\sigma\gamma}_t-\mathcal{T}^{i,\sigma\gamma}_t of that lemma. Write E\mathbb{E} for the expectation. For each ordered pair (σ,γ)(\sigma,\gamma) of distinct states define the aggregate counter, the aggregate consumed clock time, and the aggregate compensated counter

Ntσγ=∑i=1NNti,σγ,Atσγ=∑i=1NTti,σγ,Mtσγ=Ntσγ−Atσγ=∑i=1NMti,σγ(t∈[0,T]);\mathcal{N}^{\sigma\gamma}_t=\sum_{i=1}^{N}N^{i,\sigma\gamma}_t,\qquad \mathfrak{A}^{\sigma\gamma}_t=\sum_{i=1}^{N}\mathcal{T}^{i,\sigma\gamma}_t,\qquad \mathfrak{M}^{\sigma\gamma}_t=\mathcal{N}^{\sigma\gamma}_t-\mathfrak{A}^{\sigma\gamma}_t=\sum_{i=1}^{N}M^{i,\sigma\gamma}_t\qquad(t\in[0,T]);

the fraktur Aσγ\mathfrak{A}^{\sigma\gamma}, a sum of consumed clock times, is unrelated to the calligraphic control-energy symbol A\mathcal{A} used in companion results of this series. Then, for every ordered pair (σ,γ)(\sigma,\gamma) of distinct states:

(a) (Martingale, counting-path, and compensator properties.) (Mtσγ)t∈[0,T](\mathfrak{M}^{\sigma\gamma}_t)_{t\in[0,T]} is a square-integrable martingale with respect to (Ftsys)t∈[0,T](\mathcal{F}^{\mathrm{sys}}_t)_{t\in[0,T]} with M0σγ=0\mathfrak{M}^{\sigma\gamma}_0=0; almost surely, t↦Ntσγt\mapsto\mathcal{N}^{\sigma\gamma}_t agrees on [0,T][0,T] with a counting path; and at every ω∈Ω\omega\in\Omega and all 0≤r≤t≤T0\le r\le t\le T,

0 ≤ Atσγ−Arσγ ≤ N B (t−r).0\ \le\ \mathfrak{A}^{\sigma\gamma}_t-\mathfrak{A}^{\sigma\gamma}_r\ \le\ N\,B\,(t-r).

(b) (Second and fourth moments.) For every t∈[0,T]t\in[0,T], the powers (Mtσγ)2(\mathfrak{M}^{\sigma\gamma}_t)^2 and (Mtσγ)4(\mathfrak{M}^{\sigma\gamma}_t)^4 are integrable, and

E[(Mtσγ)2]=E[Atσγ]≤N B t,E[(Mtσγ)4]≤6 (N B t+(N B t)2).\mathbb{E}\big[(\mathfrak{M}^{\sigma\gamma}_t)^2\big]=\mathbb{E}\big[\mathfrak{A}^{\sigma\gamma}_t\big]\le N\,B\,t,\qquad\qquad \mathbb{E}\big[(\mathfrak{M}^{\sigma\gamma}_t)^4\big]\le 6\,\big(N\,B\,t+(N\,B\,t)^2\big).

(c) (Aggregate state martingale.) Let Mt=(Mtγ)γ∈{1,…,l}M_t=(M^\gamma_t)_{\gamma\in\{1,\dots,l\}} be as in the martingale decomposition (the superscript shapes distinguish the per-clock compensated counters Mi,σγM^{i,\sigma\gamma}, the aggregate compensated counters Mσγ\mathfrak{M}^{\sigma\gamma}, and the state martingales MγM^\gamma), and write ∣⋅∣|\cdot| for the Euclidean norm (Euclidean distance to the origin) and N\sqrt{N} for the nonnegative square root. Then, almost surely, for every γ∈{1,…,l}\gamma\in\{1,\dots,l\} and every t∈[0,T]t\in[0,T],

N Mtγ=∑σ:σ≠γ(Mtσγ−Mtγσ),N\,M^\gamma_t=\sum_{\sigma:\sigma\neq\gamma}\Big(\mathfrak{M}^{\sigma\gamma}_t-\mathfrak{M}^{\gamma\sigma}_t\Big),

the sum running over σ∈{1,…,l}\sigma\in\{1,\dots,l\} with σ≠γ\sigma\neq\gamma; and consequently, for every t∈[0,T]t\in[0,T],

E[∣N Mt∣4] ≤ 6 l2 (2(l−1))4 (B tN+(B t)2) ≤ 6 l2 (2(l−1))4 (B t+(B t)2).\mathbb{E}\big[|\sqrt{N}\,M_t|^4\big]\ \le\ 6\,l^2\,\big(2(l-1)\big)^4\,\Big(\frac{B\,t}{N}+(B\,t)^2\Big)\ \le\ 6\,l^2\,\big(2(l-1)\big)^4\,\big(B\,t+(B\,t)^2\big).

Proofs

Log in to submit a proof.

Loading...

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…