Related papers: A fixed-point approximation for a routing model in…
We carry out an analytic investigation of stochastic oscillations in a susceptible-infected-recovered model of disease spread on a network of $n$ cities. In the model a fraction $f_{jk}$ of individuals from city $k$ commute to city $j$,…
In this paper, we consider a queueing network with $N$ nodes, each of which has a fixed number $k$ of neighboring nodes, referred to as the $N$ node network with local balancing. We assume that to each of the $N$ nodes, an incoming job (or…
Biological machines like molecular motors and enzymes operate in dynamic cycles representable as stochastic flows on networks. Current stochastic dynamics describes such flows on fixed networks. Here, we develop a scalable approach to…
We propose a learning algorithm for cell-load approximation in wireless networks. The proposed algorithm is robust in the sense that it is designed to cope with the uncertainty arising from a small number of training samples. This scenario…
This paper studies a discrete-time version of the Lucas-Uzawa endogenous growth model with physical and human capital in the presence of externalities. Existence of an optimal equilibrium is proved using tools from dynamic programming with…
In asymptotic regimes, both in time and space (network size), the derivation of network capacity results is grossly simplified by brushing aside queueing behavior in non-Jackson networks. This simplifying double-limit model, however, lends…
In the supermarket model there are n queues, each with a unit rate server. Customers arrive in a Poisson process at rate \lambda n, where 0<\lambda <1. Each customer chooses d > 2 queues uniformly at random, and joins a shortest one. It is…
Route-level travel time reliability requires characterizing the distribution of total travel time across correlated segments -- a problem where existing methods either assume independence (fast but miscalibrated) or model dependence via…
Queueing networks are notoriously difficult to analyze sans both Markovian and stationarity assumptions. Much of the theoretical contribution towards performance analysis of time-inhomogeneous single class queueing networks has focused on…
A simple analytical solution is proposed for the stationary loss system of two parallel queues with finite capacity $K$, in which new customers join the shortest queue, or one of the two with equal probability if their lengths are equal.…
We propose a dynamical process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of individuals are linked by a short chain of acquaintances computable…
We present a possible kind of generalization of the notion of ordered pairs of cyclic maps and coupled fixed points and its application in modelling of equilibrium in oligopoly markets. We have obtained sufficient conditions for the…
Given two probability measures on sequential data, we investigate the transport problem with time-inconsistent preferences in a discrete-time setting. Motivating examples are nonlinear objectives, state-dependent costs, and regularized…
We consider the problem of balancing load items (tokens) in networks. Starting with an arbitrary load distribution, we allow nodes to exchange tokens with their neighbors in each round. The goal is to achieve a distribution where all nodes…
We analyze an idealized model for the transmission or flow of particles, or discrete packets of information, in a weight bearing branching hierarchical 2-D networks, and its variants. The capacities add hierarchically down the clusters.…
In this paper, we study the trade-off between reliability and latency in machine type communication (MTC), which consists of single transmitter and receiver in the presence of Rayleigh fading channel. We assume that the transmitter does not…
The present work provides a definitive answer to the problem of quantifying relaxation to equilibrium of the solution to the spatially homogeneous Boltzmann equation for Maxwellian molecules. The beginning of the story dates back to a…
We propose a unified approach to establishing diffusion approximations for queues with impatient customers within a general framework of scaling customer patience time. The approach consists of two steps. The first step is to show that the…
Performance analysis of queueing networks is one of the most challenging areas of queueing theory. Barring very specialized models such as product-form type queueing networks, there exist very few results which provide provable…
We study a discrete time queueing system where deterministic arrivals have i.i.d. exponential delays $\xi_{i}$. The standard deviation $\sigma$ of the delay is finite, but its value is much larger than the deterministic unit service time.…