9 research outputs found

    Propagation of Memory Parameter from Durations to Counts

    Get PDF
    We establish sufficient conditions on durations that are stationary with finite variance and memory parameter d∈[0,1/2)d \in [0,1/2) to ensure that the corresponding counting process N(t)N(t) satisfies VarN(t)∼Ct2d+1\textmd{Var} N(t) \sim C t^{2d+1} (C>0C>0) as t→∞t \to \infty, with the same memory parameter d∈[0,1/2)d \in [0,1/2) that was assumed for the durations. Thus, these conditions ensure that the memory in durations propagates to the same memory parameter in counts and therefore in realized volatility. We then show that any utoregressive Conditional Duration ACD(1,1) model with a sufficient number of finite moments yields short memory in counts, while any Long Memory Stochastic Duration model with d>0d>0 and all finite moments yields long memory in counts, with the same dd

    Graph theory : flows, matrices

    No full text
    Indeks. *** *** Bibliografi hlm. 273-276x, 280 hlm. :il. ;21 cm
    corecore