Convergence of Markov processes near saddle fixed points

Abstract

We consider sequences $(X_t^N{)}_{t\ge 0}$ of Markov processes in two dimensions whose fluid limit is a stable solution of an ordinary differential equation of the form ${\dot{x}}_t=b(x_t)$, where $b(x)={\pmatrix{-μ0 0 λ}}x+τ(x)$ for some $\lambda ,\mu >0$ and $\tau (x)=O(|x{|}^2)$. Here the processes are indexed so that the variance of the fluctuations of $X_t^N$ is inversely proportional to N. The simplest example arises from the OK Corral gunfight model which was formulated by Williams and McIlroy [Bull. London Math. Soc. 30 (1998) 166--170] and studied by Kingman [Bull. London Math. Soc. 31 (1999) 601--606]. These processes exhibit their most interesting behavior at times of order $\log N$ so it is necessary to establish a fluid limit that is valid for large times. We find that this limit is inherently random and obtain its distribution. Using this, it is possible to derive scaling limits for the points where these processes hit straight lines through the origin, and the minimum distance from the origin that they can attain. The power of N that gives the appropriate scaling is surprising. For example if T is the time that $X_t^N$ first hits one of the lines y=x or y=-x, then \[N^{μ/{(2(λ+μ))}}|X_T^N|\Rightarrow |Z|^{μ/{(λ+μ)}},\] for some zero mean Gaussian random variable Z.

Published at http://dx.doi.org/10.1214/009117906000000836 in the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org)

References in corpus (1)

• Structure of large random hypergraphs

Cited by in corpus (4)

• Differential equation approximations for Markov chains
• A quantitative investigation into the accumulation of rounding errors in the numerical solution of ODEs
• Sharp approximation for density dependent Markov chains
• Nonlinear Markov Processes in Big Networks