SearcharxivSearch

arXiv · 1605.01551

Rigorous results for the Stigler-Luckock model for the evolution of an order book

Abstract

In 1964, G.J. Stigler introduced a stochastic model for the evolution of an order book on a stock market. This model was independently rediscovered and generalized by H. Luckock in 2003. In his formulation, traders place buy and sell limit orders of unit size according to independent Poisson processes with possibly different intensities. Newly arriving buy (sell) orders are either immediately matched to the best available matching sell (buy) order or stay in the order book until a matching order arrives. Assuming stationarity, Luckock showed that the distribution functions of the best buy and sell order in the order book solve a differential equation, from which he was able to calculate the position of two prices $J^{\rm c}_-<J^{\rm c}_+$ such that buy orders below $J^{\rm c}_-$ and sell orders above $J^{\rm c}_+$ stay in the order book forever while all other orders are eventually matched. We extend Luckock's model by adding market orders, i.e., with a certain rate traders arrive at the market that take the best available buy or sell offer in the order book, if there is one, and do nothing otherwise. We give necessary and sufficient conditions for such an extended model to be positive recurrent and show how these conditions are related to the prices $J^{\rm c}_-$ and $J^{\rm c}_+$ of Luckock.

Explore related subjects

Keep this discovery

BibTeXRIS

Jan M. Swart. 2016-05-05. Rigorous results for the Stigler-Luckock model for the evolution of an order book. https://arxiv.org/abs/1605.01551

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR