Abstract
We propose a simple stochastic model for the dynamics of a limit order book, extending the recent work of Cont and de Larrard (SIAM J Financial Math 4(1), 1–25 2013), where the price dynamics are endogenous, resulting from market transactions. We also show that the conditional diffusion limit of the price process is the so-called Brownian meander.
Similar content being viewed by others
References
Abramowitz M, Stegun IE (1972) Handbook of mathematical functions with formulas, graphs, and mathematical tables, volume 55 of applied mathematics series. National bureau of standards, tenth edition
Billingsley P (1995) Probability and measure. Wiley series in probability and mathematical statistics, 3rd edn. Wiley, New York. A Wiley-Interscience Publication
Caravenna F, Chaumont L (2008) Invariance principles for random walks conditioned to stay positive. Ann Inst Henri Poincaré Probab Stat 44(1):170–190
Cartea Á, Jaimungal S, Penalva J (2015) Algorithmic and high-frequency trading. Cambridge University Press, Cambridge
Cont R, de Larrard A (2013) Price dynamics in a Markovian limit order market. SIAM J Financial Math 4(1):1–25
Durrett R (1996) Probability: Theory and examples, 2nd edn. Duxbury Press, Belmont
Durrett RT, Iglehart DL, Miller DR (1977) Weak convergence to Brownian meander and Brownian excursion. Ann Probab 5(1):117–129
Feller W (1971) An introduction to probability theory and its applications, volume II of Wiley series in probability and mathematical statistics, 2nd edn. Wiley, New York
Olver FW, Lozier DW, Boisvert RF, Clark CW (2010) NIST Handbook of mathematical functions. Cambridge University Press, New York
Revuz D, Yor M (1999) Continuous martingales and Brownian motion, volume 293 of Grundlehren der Mathematischen Wissenschaften [Fundamental principles of mathematical sciences], 3rd edn. Springer, Berlin
Smith E, Farmer JD, Gillemot L, Krishnamurthy S (2003) Statistical theory of the continuous double auction. Quantitative Finance 3(6):481–514
Swishchuk A, Cera K, Schmidt J, Hofmeister T (2016) General semi-Markov model for limit order books: theory, implementation and numerics. arXiv:1608.05060
Swishchuk AV, Vadori N (2017) A semi-Markovian modeling of limit order markets. SIAM Journal on Financial Mathematics. (in press)
Van Leeuwaarden JS, Raschel K, et al (2013) Random walks reaching against all odds the other side of the quarter plane. J Appl Probab 50(1):85–102
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This research is supported by the Montreal Institute of Structured Finance and Derivatives, the Natural Sciences and Engineering Research Council of Canada, the Social Sciences and Humanities Research Council of Canada, and the Australian Research Council.
Appendices
Appendix A: Auxiliary Results
Proposition A.1
Suppose thatVn = X1 + ⋯ + Xn, where the variablesXiare i.i.d. with\(xP(X_{i} > x) \stackrel {x\to \infty }{\to } c \in (0,\infty )\).Then\(\frac {V_{n}}{n\log {n}} \stackrel {Pr}{\to } c\), asn →∞.
Proof
First, for any s > 0 and T > 0,
so as s → 0, \( s {\int }_{T}^{\infty } \frac {e^{-sx}}{x} dx \sim -s\log {s}\). Next, for any non negative random variable X and any s ≥ 0,
As a result, if P(X > x) ∼ c/x, as x →∞, then, as s → 0,
Therefore, setting an = n log n, one obtains, for a fixed s > 0,
since \(\frac {ns}{a_{n}} \log (sa_{n}) \to s\) as n →∞. Hence, \(V_{n}/a_{n} \stackrel {Pr}{\to } c\), as n →∞. □
Proposition A.2
Suppose that\(V_{n}/f(n) \stackrel {Pr}{\to } c\), asn →∞, wheref(n) →∞is regularly varying of orderα. DefineNt = max{n ≥ 0; Vn ≤ t} and suppose that for some function g on (0,∞),f ∘ g(t) ∼ g ∘ f(t) ∼ t, ast →∞. Then\(N_{t}/g(t) \stackrel {Pr}{\to } c^{-1/\alpha }\).
Proof
The proof is similar to the proof of the renewal theorem in Durrett (1996)[Theorem 7.3]. By definition, \(V_{N_{t}} \le t < V_{N_{t}+1}\). As a result,
By hypothesis, Vn/f(n) converges in probability to c ∈ (0,∞), as n →∞. Also, since Vn is finite for any \(n\in {\mathbb {N}}\), it follows that Nt converges in probability to + ∞ as t →∞. Next, since f(n + 1)/f(n) → 1 as n →∞, it follows that as t →∞, f(Nt)/t converges in probability to \(\frac {1}{c}\). Also, g is regularly varying of order 1/α, so one may conclude that \(N_{t}/g(t) \stackrel {Pr}{\to } c^{-1/\alpha }\). □
Remark A.3
If f(t) = t log t, then α = 1 and one can take g(t) = t/ log t.
Proposition A.4
Set\(\psi _{\lambda }(t,x) ={\int }_{t}^{\infty } \frac {1}{u}I_{x}(2u\lambda )e^{-2u\lambda }du\), for anyt, x, λ > 0. Then there exists a constant C so that for anyx, λ > 0, and any\(t\ge \frac {1}{2\lambda }\),\( \psi _{\lambda }(t,x) \le \frac {C}{\sqrt {2\lambda t}}. \)
Proof
First, note that ψλ(t, x) = ψ1/2(2λt, x). It is well-known that
Next, set \( E_{1}(u):={\int }_{u}^{\infty }\frac {e^{-w}}{w} dw\), u > 0. Then
According to Olver et al (2010, Section 6.8.1), E1(u) ≤ e−u ln (1 + 1/u) for any u > 0. Furthermore, ln(1 + x) ≤ x and ln(1 + x) ≤ x2/5 for any x ≥ 0. As a result,
for any t ≥ 1, where \(C = \frac {e^{-1}}{2}+ \frac {{\Gamma }\left (\frac {1}{10}\right )}{\pi }\). □
Appendix B: Proofs
Proof of Lemma 3.4
From Olver et al (2010)[Formula 10.30.4], for fixed ν, \( I_{\nu }(z)\sim \frac {e^{z}}{\sqrt {2\pi z}}\) as z →∞. Also, from Abramowitz and Stegun (1972, p. 376), \( I_{n}(z)= \frac {1}{\pi }{\int }_{0}^{\pi } e^{z \cos {\theta }}\cos (n\theta )d\theta \) , so for any \(x\in {\mathbb {N}}\), In(z) ≤ ez. Thus, as T →∞,
Also, for any \(x\in {\mathbb {N}}\),
Consequently, if λ = μ, \({\mathcal {C}}=0\) and
This agrees with the result proved in Cont and de Larrard (2013). However, if λ < μ, using the change of variable \(u = s{\mathcal {C}}\), one gets
To compute the expectation in the case where λ = μ, note that for large enough T, \( \mathbb {E}_{x}\left [\sigma _{Y}\right ]= {\int }_{0}^{\infty } \mathbb {P}_{x}[\sigma _{Y}> t] dt \geq \frac {x}{2\lambda \sqrt {\pi }} {\int }_{T}^{\infty } \frac {1}{\sqrt {t}}dt = \infty \), whereas if λ < μ, for a sufficiently large T, there are finite constants C1 and C2 such that for any \(0 \le \theta <{\mathcal {C}}\),
□
Proof of Proposition 4.1
Let Fn, Q(t; x, y) and Fn, L(t; x, y) denote the cdf of \({S^{n}_{Q}}\) and \({S^{n}_{L}}\), respectively, starting from z0 = (x, y), with densities \(f_{n,\mathcal {Q}}(t;z_{0})\) and \(f_{n,\mathcal {L}}(t;z_{0})\), where Fn, Q(⋅; z0) is the convolution of F1,Q (n − 1) times with F1,Q(⋅; z − 0). The result will be proven by induction. The base case n = 1 is given in Corollary 3.7. Assume the result is true for any \(m\leq n\in \mathbb {N}\). Then by Corollary 3.7 and the induction hypothesis,
Also, by the definition of τn and Vn, under Assumption 2, if z0 = (x, y), then
where we used the fact that for any s ≥ 0, α(n+ 1)(s) = α(s + u) given Vn = u, so \(A^{(n+1)}(t) = {{\int }_{0}^{t}} \alpha (s+u)ds = A_{t+u}-A_{u}\). Furthermore, in the last equality we used the fact that for X and Y, non-negative independent random variables,
with FX and FY denoting the cdfs of X and Y. Furthermore, starting q0 from distribution f, one obtains that \(\mathbb {P}_{{\mathcal {L}}}[V_{n} \le t] = \mathbb {P}_{{\mathcal {Q}}}[V_{n} \le A_{t}]\). □
Rights and permissions
About this article
Cite this article
Chávez-Casillas, J.A., Elliott, R.J., Rémillard, B. et al. A Level-1 Limit Order Book with Time Dependent Arrival Rates. Methodol Comput Appl Probab 21, 699–719 (2019). https://doi.org/10.1007/s11009-019-09715-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11009-019-09715-7