Related papers: The Supermarket Model on a Dynamic Regular Hypergr…
In this work we introduce two variants of multivariate Hawkes models with an explicit dependency on various queue sizes aimed at modeling the stochastic time evolution of a limit order book. The models we propose thus integrate the…
Manufacturing plays a significant role in economic development, production, exports, and job creation, which ultimately contribute to improving the quality of life. The presence of manufacturing defects is, however, inevitable leading to…
We consider an M/M/1 queueing model where customers can strategically decide to enter or leave the queue. We characterize the class of queueing regimes such that, for any parameters of the model, the socially efficient behavior is an…
This paper attempts to find out numerically the distribution of the queue-length ratio in the context of a model of preferential attachment. Here we consider two restaurants only and a large number of customers (agents) who come to these…
We study the load balancing system operating under Join the Shortest Queue (JSQ) in the many-server heavy-traffic regime. If $N$ is the number of servers, we let the difference between the total service rate and the total arrival rate be…
Higher-order networks, naturally described as hypergraphs, are essential for modeling real-world systems involving interactions among three or more entities. Stochastic block models offer a principled framework for characterizing mesoscale…
This paper considers the steady-state performance of load balancing algorithms in a many-server system with distributed queues. The system has $N$ servers, and each server maintains a local queue with buffer size $b-1,$ i.e. a server can…
We consider a single server queue that serves a finite population of $n$ customers that will enter the queue (require service) only once, also known as the $\Delta_{(i)}/G/1$ queue. This paper presents a method for analyzing heavy-traffic…
We consider a switched network, a fairly general constrained queueing network model that has been used successfully to model the detailed packet-level dynamics in communication networks, such as input-queued switches and wireless networks.…
A network epidemic model is studied. The underlying social network has two different types of group structures, households and workplaces, such that each individual belongs to exactly one household and one workplace. The random network is…
Proximity networks are time-varying graphs representing the closeness among humans moving in a physical space. Their properties have been extensively studied in the past decade as they critically affect the behavior of spreading phenomena…
Networks and graphs provide a simple but effective model to a vast set of systems which building blocks interact throughout pairwise interactions. Unfortunately, such models fail to describe all those systems which building blocks interact…
We develop SHOPPER, a sequential probabilistic model of shopping data. SHOPPER uses interpretable components to model the forces that drive how a customer chooses products; in particular, we designed SHOPPER to capture how items interact…
Understanding how delayed information impacts queueing systems is an important area of research. However, much of the current literature neglects one important feature of many queueing systems, namely non-stationary arrivals. Non-stationary…
We empirically study sorting in the evolving data model. In this model, a sorting algorithm maintains an approximation to the sorted order of a list of data items while simultaneously, with each comparison made by the algorithm, an…
We investigate the dynamical stability of the holographic system with two order parameters, which exhibits competition and coexistence of condensations. In the linear regime, we have developed the gauge dependent formalism to calculate the…
We consider a queue to which only a finite pool of $n$ customers can arrive, at times depending on their service requirement. A customer with stochastic service requirement $S$ arrives to the queue after an exponentially distributed time…
We consider a dynamic system with multiple types of customers and servers. Each type of waiting customer or server joins a separate queue, forming a bipartite graph with customer-side queues and server-side queues. The platform can match…
In this paper, we develop a method for studying cycle lengths in hypergraphs. Our method is built on earlier ones used in [21,22,18]. However, instead of utilizing the well-known lemma of Bondy and Simonovits [4] that most existing methods…
We consider the long term behaviour of a Markov chain \xi(t) on \Z^N based on the N station supermarket model. Different routing policies for the supermarket model give different Markov chains. We show that for a general class of local…