Related papers: Non-Markovian state dependent networks in critical…
Let $(X_t, Y_t)_{t\in T}$ be a discrete or continuous-time Markov process with state space $X \times R^d$ where $X$ is an arbitrary measurable set. Its transition semigroup is assumed to be additive with respect to the second component,…
Aggregated Markov models provide a flexible framework for stochastic dynamics that develops on multiple timescales. For example, Markov models for ion channels often consist of multiple open and closed state to account for "slow" and "fast"…
We consider a stochastic, dynamic job scheduling problem, formulated as a queueing control problem, in which a single server processes jobs of different types that arrive according to independent Poisson processes. The problem is defined on…
In order to obtain Markov heavy-traffic approximations for infinite-server queues with general non-exponential service-time distributions and general arrival processes, possibly with time-varying arrival rates, we establish heavy-traffic…
We develop a notion of stochastic quantum trajectories. First, we construct a basis set of trajectories, called elementary trajectories, and go on to show that any quantum dynamical process, including those that are non-Markovian, can be…
We study normal approximations for a class of discrete-time occupancy processes, namely, Markov chains with transition kernels of product Bernoulli form. This class encompasses numerous models which appear in the complex networks…
Non-recurrent congestion is a major problem in traffic networks that causes unexpected delays during travels. In such a scenario, it is preferable to use adaptive paths or policies where next link decisions on reaching junctions are…
We prove the existence of limiting distributions for a large class of Markov chains on a general state space in a random environment. We assume suitable versions of the standard drift and minorization conditions. In particular, the system…
Queueing networks are gaining attraction for the performance analysis of parallel computer systems. A Jackson network is a set of interconnected servers, where the completion of a job at server i may result in the creation of a new job for…
We study the transport properties of the Fano-Anderson model with a Lorentzian-shaped density of states in one of the electronic reservoirs. We explicitly show that the energy dependence of the density of states can cause non-Markovian…
Motivated by application in wireless networks, cloud computing, data centers etc, Stochastic Processing Networks have been studied in the literature under various asymptotic regimes. In the heavy-traffic regime, the steady state mean queue…
We develop a model-free approach to optimally control stochastic, Markovian systems subject to a reach-avoid constraint. Specifically, the state trajectory must remain within a safe set while reaching a target set within a finite time…
We introduce the {\Delta}(i)/GI/1 queue, a new queueing model. In this model, customers from a given population independently sample a time to arrive from some given distribution F. Thus, the arrival times are an ordered statistics, and the…
We consider a GI/H/n queueing system. In this system, there are multiple servers in the queue. The inter-arrival time is general and independent, and the service time follows hyper-exponential distribution. Instead of stochastic…
In this paper we explore the evolution of transport capacity on networks with stochastic incidence of damage and accumulation of faults in their connections. For each damaged configuration of the network, we analyze a Markovian random…
Dynamical systems governed by priority rules appear in the modeling of emergency organizations and road traffic. These systems can be modeled by piecewise linear time-delay dynamics, specifically using Petri nets with priority rules. A…
We consider a regulated multi-class instantaneous matching system with reneging, in which each event requires $K \geq 2$ distinct impatient agents who wait in their respective queues. Each agent class is subject to a buffer capacity,…
An infinite buffer batch service vacation queue has been studied where service rate of the batch is dependent on the size of the batch and vacation rate is dependent on the queue size at vacation initiation epoch. The arrivals follow the…
We study the problem of learning the Markov order in categorical sequences that represent paths in a network, i.e. sequences of variable lengths where transitions between states are constrained to a known graph. Such data pose challenges…
We consider multi-class single-server queueing networks that have a product form stationary distribution. A new limit result proves a sequence of such networks converges weakly to a stochastic flow level model. The stochastic flow level…