SearcharxivSearch

arXiv subjects

K. A. Borovkov

Publications and source records attributed to K. A. Borovkov.

7 recordsLinked to original sources

On large deviation principles for general random processes

Let $Z=\{Z(t): t\in \mathbb R\}$ be a stochastic process with trajectories in space $\mathbb D (\mathbb R)$. It is assumed that there exists an essentially smooth function $A:\mathbb R\to (-\infty, \infty] $ such that, for all $α\in \mathbb R, $ $ μ\in \mbox{dom}\, A$, one has \begin{equation*} \frac1{T} \ln {\mathbf E} \big( e^{μ(Z(T)-αT)} \big|Z(s), \ s\le 0 \big) = A(μ) +o(1) \end{equation*} uniformly on the event $C(T):=\{|Z(0)/T - α|< η_T \} $, where $ η_T \to 0$ as $T\to\infty.$ Under this condition, a uniform conditional local large deviation principle (l.l.d.p.) is established: for any fixed $α, β\in \mathbb R$ and a positive function $η_T=o(1)$, for $\varepsilon_T \to 0$ sufficiently slowly as $T\to\infty,$ one has \begin{equation*} \lim_{T\to\infty}\frac1T \ln {\mathbf P} \big( {Z(T)}/T-α \in (β-\varepsilon_T, β+\varepsilon_T) \big| Z(s), \ s\le 0\big) = - D(β) \end{equation*} uniformly on $C(T)$, where $D$ is the Legendre transform of the function $A$. This result is used to establish a conditional l.l.d.p. for the finite-dimen\-sional distributions of the process $ \{ z_T(s) = Z(sT)/T: s\in [0,1]\}$. Under additional conditions on the magnitude of oscillations of the trajectories $z_T$, a functional l.l.d.p. is obtained for the asymptotics of $\ln {\mathbf P} (z_T\in (f)_{\varepsilon_T})$ as $T\to\infty$, where $f\in \mathbb D(0,1),$ $(f)_\varepsilon$ is the $\varepsilon$-neighborhood of $f$ in the space $ \mathbb D(0,1)$ with respect to the uniform metric, and $\varepsilon_T \to 0$ sufficiently slowly. The obtained results can be extended to a more general triangular array scheme where the process itself $Z=Z^{(T)}$ also depends on the parameter $T$.

math.PR

On Rice's formula for stationary multivariate piecewise smooth processes

Let $X=\{X_t: t\ge 0\}$ be a stationary piecewise continuous $\R^d$-valued process that moves between jumps along the integral curves of a given continuous vector field, and let $S\subset\R^d$ be a smooth surface. The aim of this paper is to derive a multivariate version of Rice's formula, relating the intensity of the point process of (localized) continuous crossings of $S$ by $X$ to the distribution of $X_0$. Our result is illustrated by examples relating to queueing networks and stress release network models.

math.PR

On an Extension of the Concept of Slowly Varying Function with Applications to Large Deviation Limit Theorems

Karamata's integral representation for slowly varying functions is extended to a broader class of the so-called $ψ$-locally constant functions, i.e. functions $f(x)>0$ having the property that, for a given non-decreasing function $ψ(x)$ and any fixed $v$, $f (x+vψ(x))/f(x) \to 1 $ as $x\to\infty$. We consider applications of such functions to extending known results on large deviations of sums of random variables with regularly varying distribution tails.

math.PR

On the Expectations of Maxima of Sets of Independent Random Variables

Let $X^1, ..., X^k$ and $Y^1, ..., Y^m$ be jointly independent copies of random variables $X$ and $Y$, respectively. For a fixed total number $n$ of random variables, we aim at maximising $M(k,m):= E \max \{X^1, ..., X^k, Y^1, >..., Y^{m} \}$ in $k = n-m\ge 0$, which corresponds to maximising the expected lifetime of an $n$-component parallel system whose components can be chosen from two different types. We show that the lattice $\{M(k,m): k, m\ge 0\}$ is concave, give sufficient conditions on $X$ and $Y$ for M(n,0) to be always or ultimately maximal and derive a bound on the number of sign changes in the sequence $M(n,0)-M(0,n)$, $n\ge 1$. The results are applied to a mixed population of Bienayme-Galton-Watson processes, with the objective to derive the optimal initial composition to maximise the expected time to extinction.

math.PR

On the ruin time distribution for a Sparre Andersen process with exponential claim sizes

We derive a closed-form (infinite series) representation for the distribution of the ruin time for the Sparre Andersen model with exponentially distributed claims. This extends a recent result of Dickson et al. (2005) for such processes with Erlang inter-claim times. We illustrate our result in the cases of gamma and mixed exponential inter-claim time distributions.

math.PR

On level crossings for a general class of piecewise-deterministic Markov processes

We consider a piecewise-deterministic Markov process governed by a jump intensity function, a rate function that determines the behaviour between jumps, and a stochastic kernel describing the conditional distribution of jump sizes. We study the point process of upcrossings of a level $b$ by the Markov process. Our main result shows that, under a suitable scaling $ν(b)$, the point process converges, as $b$ tends to infinity, weakly to a geometrically compound Poisson process. We also prove a version of Rice's formula relating the stationary density of the process to level crossing intensities. This formula provides an interpretation of the scaling factor $ν(b)$. While our proof of the limit theorem requires additional assumptions, Rice's formula holds whenever the (stationary) overall intensity of jumps is finite.

math.PR

Simulation Studies of Some Voronoi Point Processes

We introduce a new class of dynamic point process models with simple and intuitive dynamics that are based on the Voronoi tessellations generated by the processes. Under broad conditions, these processes prove to be ergodic and produce, on stabilisation, a wide range of clustering patterns. In the paper, we present results of simulation studies of three statistical measures (Thiel's redundancy, van Lieshout and Baddeley's $J$-function and the empirical distribution of the Voronoi nearest neighbours' numbers) for inference on these models from the clustering behaviour in the stationary regime. In particular, we make comparisons with the area-interaction processes of Baddeley and van Lieshout.

math.PR