اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLow-traffic limit and first-passage times for a simple model of the continuous double auction
288
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider a simplified model of the continuous double auction where prices are integers varying from $1$ to $N$ with limit orders and market orders, but quantity per order limited to a single share. For this model, the order process is equivalent to two $M/M/1$ queues. We study the behaviour of the auction in the low-traffic limit where limit orders are immediately transformed into market orders. In this limit, the distribution of prices can be computed exactly and gives a reasonable approximation of the price distribution when the ratio between the rate of order arrivals and the rate of order executions is below $1/2$. This is further confirmed by the analysis of the first passage time in $1$ or $N$.
قيم البحث
اقرأ أيضاً
We study a phenomenological model for the continuous double auction, equivalent to two independent $M/M/1$ queues. The continuous double auction defines a continuous-time random walk for trade prices. The conditions for ergodicity of the auction are
derived and, as a consequence, three possible regimes in the behavior of prices and logarithmic returns are observed. In the ergodic regime, prices are unstable and one can observe an intermittent behavior in the logarithmic returns. On the contrary, non-ergodicity triggers stability of prices, even if two different regimes can be seen.
Many events in biology are triggered when a diffusing searcher finds a target, which is called a first passage time (FPT). The overwhelming majority of FPT studies have analyzed the time it takes a single searcher to find a target. However, the more
relevant timescale in many biological systems is the time it takes the fastest searcher(s) out of many searchers to find a target, which is called an extreme FPT. In this paper, we apply extreme value theory to find a tractable approximation for the full probability distribution of extreme FPTs of diffusion. This approximation can be easily applied in many diverse scenarios, as it depends on only a few properties of the short time behavior of the survival probability of a single FPT. We find this distribution by proving that a careful rescaling of extreme FPTs converges in distribution as the number of searchers grows. This limiting distribution is a type of Gumbel distribution and involves the LambertW function. This analysis yields new explicit formulas for approximations of statistics of extreme FPTs (mean, variance, moments, etc.) which are highly accurate and are accompanied by rigorous error estimates.
The time it takes the fastest searcher out of $Ngg1$ searchers to find a target determines the timescale of many physical, chemical, and biological processes. This time is called an extreme first passage time (FPT) and is typically much faster than t
he FPT of a single searcher. Extreme FPTs of diffusion have been studied for decades, but little is known for other types of stochastic processes. In this paper, we study the distribution of extreme FPTs of piecewise deterministic Markov processes (PDMPs). PDMPs are a broad class of stochastic processes that evolve deterministically between random events. Using classical extreme value theory, we prove general theorems which yield the distribution and moments of extreme FPTs in the limit of many searchers based on the short time distribution of the FPT of a single searcher. We then apply these theorems to some canonical PDMPs, including run and tumble searchers in one, two, and three space dimensions. We discuss our results in the context of some biological systems and show how our approach accounts for an unphysical property of diffusion which can be problematic for extreme statistics.
In this paper we study first-passge percolation models on Delaunay triangulations. We show a sufficient condition to ensure that the asymptotic value of the rescaled first-passage time, called the time constant, is strictly positive and derive some u
pper bounds for fluctuations. Our proofs are based on renormalization ideas and on the method of bounded increments.
The first-passage-time problem for a Brownian motion with alternating infinitesimal moments through a constant boundary is considered under the assumption that the time intervals between consecutive changes of these moments are described by an altern
ating renewal process. Bounds to the first-passage-time density and distribution function are obtained, and a simulation procedure to estimate first-passage-time densities is constructed. Examples of applications to problems in environmental sciences and mathematical finance are also provided.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
