Related papers: Approximating Systems Fed by Poisson Processes wit…
We consider the Markov random flight $\bold X(t), \; t>0,$ in the three-dimensional Euclidean space $\Bbb R^3$ with constant finite speed $c>0$ and the uniform choice of the initial and each new direction at random time instants that form a…
We consider a single-server GI/GI/1 queueing system with feedback. We assume the service times distribution to be (intermediate) regularly varying. We find the tail asymptotics for a customer's sojourn time in two regimes: the customer…
This paper presents an exhaustive study on the arrivals process at eight important European airports. Using inbound traffic data, we define, compare, and contrast a data-driven Poisson and PSRA point process. Although, there is sufficient…
This paper discusses infill asymptotics for logistic regression estimators for spatio-temporal point processes whose intensity functions are of log-linear form. We establish strong consistency and asymptotic normality for the parameters of…
We study the long time behavior of isentropic compressible Euler equations with linear damping driven by a white-in-time noise, on a one-dimensional torus. We prove the existence of a statistically stationary solution in the class of weak…
We study a $d$-dimensional stochastic process $\mathbf{X}$ which arises from a L\'evy process $\mathbf{Y}$ by partial resetting, that is the position of the process $\mathbf{X}$ at a Poisson moment equals $c$ times its position right before…
Entropy notions for $\varepsilon$-incremental practical stability and incremental stability of deterministic nonlinear systems under disturbances are introduced. The entropy notions are constructed via a set of points in state space which…
In this paper, we study the dynamics of a linear control system with given state feedback control law in the presence of fast periodic sampling at temporal frequency $1/\delta$ ($0 < \delta \ll 1$), together with small white noise…
We consider the job assignment problem in a multi-server system consisting of $N$ parallel processor sharing servers, categorized into $M$ ($\ll N$) different types according to their processing capacity or speed. Jobs of random sizes…
This article develops a continuous-time asymptotic framework for analyzing adaptive experiments -- settings in which data collection and treatment assignment evolve dynamically in response to incoming information. A key challenge in…
Rate processes are simple and analytically tractable models for many dynamical systems which switch stochastically between a discrete set of quasi stationary states but they may also approximate continuous processes by coarse grained,…
In a wide range of applications, the stochastic properties of the observed time series change over time. The changes often occur gradually rather than abruptly: the properties are (approximately) constant for some time and then slowly start…
This paper considers binomial approximation of continuous time stochastic processes. It is shown that, under some mild integrability conditions, a process can be approximated in mean square sense and in other strong metrics by binomial…
We propose and analyze a specific asymptotic stochastic order for random processes based on the measure of departure discussed in the literature. As applications, we stochastically compare mixtures of order statistics and record values…
We study how stochastic resetting affects first-passage processes in systems of many interacting particles. While resetting is well understood for single-particle dynamics, its consequences for collective behavior remain less clear. We…
We study the Patient Assignment Scheduling (PAS) problem in a random environment that arises in the management of patient flow in the hospital systems, due to the stochastic nature of the arrivals as well as the Length of Stay distribution.…
Queuing systems with an unlimited number of devices with an incoming nonstationary Poisson flow and a random flow controlled by a Markov chain are investigated. The inexpediency of ap-proximation of the birth process by Poisson flows in…
Emerging workloads, such as graph processing and machine learning are approximate because of the scale of data involved and the stochastic nature of the underlying algorithms. These algorithms are often distributed over multiple machines…
We consider the $M/M/1$ queue with processor sharing. We study the conditional sojourn time distribution, conditioned on the customer's service requirement, in various asymptotic limits. These include large time and/or large service…
The cohesive collective motion (flocking, swarming) of autonomous agents is ubiquitously observed and exploited in both natural and man-made settings, thus, minimal models for its description are essential. In a model with continuous space…