20
Views
0
CrossRef citations to date
0
Altmetric
Article

On the dependence structure of the trade/no trade sequence of illiquid assets

Pages 2715-2729 | Received 21 Feb 2022, Accepted 14 Nov 2022, Published online: 21 Nov 2022
 

Abstract

In this paper, we propose to consider the dependence structure of the trade/no trade categorical sequence of individual illiquid stocks returns. The framework considered here is wide as constant and time-varying zero returns probability are allowed. The ability of our approach in highlighting illiquid stock’s features is underlined for a variety of situations. More specifically, we show that long-run effects for the trade/no trade categorical sequence may be spuriously detected in presence of a non-constant zero returns probability. Monte Carlo experiments, and the analysis of stocks taken from the Chilean financial market, illustrate the usefulness of the tools developed in the paper.

JEL Classification:

Proofs

Proof of Proposition 2.1.

Firstly, note that we have a¯P(at=1)=Op(n12), so that n12γ̂a(h)=n12γ¯a(h)+op(1),for allh{1,,m}, where γ¯a(h)=(nh)1t=1+hn(atP(at=1))(athP(at=1)). Let us define A¯m=(γ¯a(1),,γ¯a(m)). From the Central Limit Theorem (CLT) for martingale difference sequences (see Theorem A.3 in Francq and Zakoïan (Citation2019)), we have n12A¯mdN(0,Σ¯), where Σ¯ is a m × m dimensional diagonal matrix, with diagonal component P(at=1)2(1P(at=1))2. On the other hand, it is easy to see that γ̂a(0)a.s.P(at=1)(1P(at=1)). Hence, the result follows from the Slutsky Lemma. □

Proof of Equation(4). Let ξh,t=(atP(at=1))(athP(ath=1)) and Γ˜m(u)=(γ˜a(1,u),,γ˜a(m,u)).

The sequence (ξh,t) is a martingale difference, such that V(ξh,t)=g2(t/n)(1g(t/n))2+O(n1), from the Lipschitz condition with a finite number of breaks in Assumption 1. Then from Theorem 2.1 of Hansen (Citation1992), we obtain Γ˜m(u)d(G(u),,G(u)).

The desired result follows from the Continuous Mapping Theorem. □

Proof of Proposition 2.3.

Note that E{(atP(at=1))(athP(ath=1))}=0. Then using the Central Limit Theorem for independent but heterogeneous sequences, see Davidson (Citation1994), Theorem 23.6, we have n(γ˜a(1,1),,γ˜a(m,1))dN(0,ϖ), where ϖ=01g2(s)(1g2(s))2ds is obtained using some computations, and since (at) is independent. On the other hand, from the Kolmogorov SLLN for independent but non-identically random variables (see, for instance, Sen and Singer (Citation1993), Theorem 2.3.10), we have γ˜a(h,1)a.s.01g(s)(1g(s))ds. Hence, the first result of Proposition 2.3 follows from the Slutsky Lemma. Now, for the convergence of ω̂, using again the Kolmogorov SLLN and some computations, we have n1t=2n(atP(at=1))2(at1P(at1=1))2a.s.01g2(s)(1g2(s))2ds,n1t=1n(atP(at=1))2a.s.01g(s)(1g(s))ds.

Proof of Proposition 2.4.

From the Kolmogorov SLLN for independent but non identically random variables (see, Sen and Singer (Citation1993), Theorem 2.3.10), and using some computations, we have γ˜a(h,1)a.s.01gh(s)ds(01g(s)ds)2,

from the dominated convergence Theorem, and for any h{1,,m}. Hence, under H˜1 the result follows. □

Proof of Proposition 2.5.

In this proof similar arguments to that of the proof of Theorem 2 in Xu and Phillips (Citation2008) are considered. As the break number is finite, we assume that the function g(·) is continuous, without a loss of generality. Let us introduce the short notations p̂t=i=1nwtiai,p¯t=i=1nwtipi,pt=P(at=1),

and zi=aipi. We can write p̂tp¯t=1nbi=1nKtizi1nbj=1nKtj.

From H˜0,(zi) is an independent process, such that E(zi)=0. In addition, from Lemma A(c) in Xu and Phillips (Citation2008), we have (1/nb)i=1nKti1. In view of the above arguments, deduce that E(1nbi=1nKtizi)2=1(nb)2i=1nKti2E(zi2)(1nb)(supiKti)(1nbi=1nKti)=O(1nb), Thus, we write (9) p̂tp¯t=Op(1nb).(9)

On the other hand, we have 1nbi=1nK[nr]ipi=1nbi=1nK([nr]inb)g(in)=1b[1/n2/nK([nr][ns]nb)g([ns]n)ds++1(n+1)/nK([nr][ns]nb)g([ns]n)ds]=1b(1/n(n+1)/nK([nr]nsnb)g(s)ds)+O(1nb)=z=(s¯r)/b(1nr)/b(1+1nr)/bK([nr]n(r+bz)nb)g(r+bz)dz+O(1nb)=K([nr]nrnbz)g(r+bz)dz+O(1nb), where the last equality is obtained for small enough b, and since a compact support is assumed for K(·) in Assumption 2(a). Using the Lipschitz condition in Assumption 1, deduce that (10) 1nbi=1nK[nr]ipi=g(r)+O(b)+O(1nb).(10) Now, writing n12t=1+hn(atp̂t)(athp̂th)n12t=1+hn(atpt)(athpth)=n12t=1+hn(atpt)(pthp¯th)+n12t=1+hn(atpt)(p¯thp̂th)+n12t=1+hn(ptp¯t)(athpth)+n12t=1+hn(ptp¯t)(pthp¯th)+n12t=1+hn(ptp¯t)(p¯thp̂th)+n12t=1+hn(p¯tp̂t)(athpth)+n12t=1+hn(p¯tp̂t)(pthp¯th)+n12t=1+hn(p¯tp̂t)(p¯thp̂th), and using Equation(9) and Equation(10), the desired result follows. □

Notes

1 For u < 0, the function is set constant, that is g(u)=limu0g(u). Throughout the paper, the piecewise Lipschitz condition means: there exists a positive integer p and some mutually disjoint intervals I1,,Ip with I1Ip=(0,1] such that g(u)=l=1pgl(u)1{uIl}, u(0,1], where g(·) is a Lipschitz smooth function on I1,,Ip, respectively.

2 The author is grateful to Andres Celedon for research assistance.

Additional information

Funding

This author acknowledges the ANID funding, Fondecyt 1201898.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.