Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
120 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
3 tokens/sec
DeepSeek R1 via Azure Pro
51 tokens/sec
2000 character limit reached

A Stochastic Model of Order Book Dynamics using Bouncing Geometric Brownian Motions (1511.04096v2)

Published 12 Nov 2015 in q-fin.TR and q-fin.MF

Abstract: We consider a limit order book, where buyers and sellers register to trade a security at specific prices. The largest price buyers on the book are willing to offer is called the market bid price, and the smallest price sellers on the book are willing to accept is called the market ask price. Market ask price is always greater than market bid price, and these prices move upwards and downwards due to new arrivals, market trades, and cancellations. We model these two price processes as "bouncing geometric Brownian motions (GBMs)", which are defined as exponentials of two mutually reflected Brownian motions. We then modify these bouncing GBMs to construct a discrete time stochastic process of trading times and trading prices, which is parameterized by a positive parameter $\delta$. Under this model, it is shown that the inter-trading times are inverse Gaussian distributed, and the logarithmic returns between consecutive trading times follow a normal inverse Gaussian distribution. Our main results show that the logarithmic trading price process is a renewal reward process, and under a suitable scaling, this process converges to a standard Brownian motion as $\delta\to 0$. We also prove that the modified ask and bid processes approach the original bouncing GBMs as $\delta\to0$. Finally, we derive a simple and effective prediction formula for trading prices, and illustrate the effectiveness of the prediction formula with an example using real stock price data.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.