§4.4, pp. 37–38 — λT P(j₁ > b(λT)x) → x^{−α} for every x > 0
DisprovedNetTraffic.PoissonStable.tail_j1heavy-tailsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1point-processesregular-variation
Throughout, is a probability law on satisfying (2.8): for with and slowly varying; ; is the quantile function (2.9); the connection rate is a non-decreasing function of (§3.1), and means evaluated at . Let with and let have the law (4.4): the second marginal of restricted to .
If Condition 1 holds, then for every
This tail limit identifies the Lévy measure on of the limiting totally skewed stable law.
Formalization Note The statement is deterministic: it concerns , and the law (4.4) only.
Preamble
import Mathlib import Definitions.Def_NetTraffic_PoissonStable_Setting
Formal statement
namespace NetTraffic.PoissonStable
open MeasureTheory ProbabilityTheory Filter Topology
theorem tail_j1
{Fon : Measure ℝ} [IsProbabilityMeasure Fon] {α : ℝ} (hF : HeavyTail Fon α)
{lam : ℝ → ℝ} (hlam : ∀ T, 0 < lam T) (hmono : Monotone lam)
(hC1 : Condition1 Fon lam) :
∀ x : ℝ, 0 < x →
Tendsto (fun T => lam T * T * (j1Law Fon T).real (Set.Ioi (b Fon (lam T * T) * x)))
atTop (𝓝 (x ^ (-α))) := by sorry
end NetTraffic.PoissonStable
Source
Mikosch, Resnick, Rootzén and Stegeman, Is network traffic approximated by stable Lévy motion or fractional Brownian motion?, Ann. Appl. Probab. 12 (2002), pp. 37–38, §4.4, display "λT P(j₁ > b(λT)x) … ∼ x^{−α}"
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.