Related papers: A State-Dependent Polling Model with Markovian Rou…
The parameters of a discrete stationary Markov model are transition probabilities between states. Traditionally, data consist in sequences of observed states for a given number of individuals over the whole observation period. In such a…
For the voter model, we study the effect of a memory-dependent transition rate. We assume that the transition of a spin into the opposite state decreases with the time it has been in its current state. Counter-intuitively, we find that the…
The growth of Machine-Type Communication (MTC) increases the relevance of queuing scenarios with deterministic service times. In this letter, we present a model for queues without waiting lines and with degenerate service time distributions…
Motivated by timeouts in Internet services, we consider networks of infinite server queues in which routing decisions are based on deadlines. Specifically, at each node in the network, the total service time equals the minimum of several…
We explore two notions of stationary processes. The first is called a random-step Markov process in which the stationary process of states, $(X_i)_{i \in \mathbb{Z}}$ has a stationary coupling with an independent process on the positive…
We consider a stochastic fluid queue served by a constant rate server and driven by a process which is the local time of a certain Markov process. Such a stochastic system can be used as a model in a priority service system, especially when…
We present a broad literature survey of parameter and state estimation for queueing systems. Our approach is based on various inference activities, queueing models, observations schemes, and statistical methods. We categorize these into…
We consider the voter model with $M$ states initially in the system. Using generating functions, we pose the spectral problem for the Markov transition matrix and solve for all eigenvalues and eigenvectors exactly. With this solution, we…
We consider the so-called GI/GI/N queueing network in which a stream of jobs with independent and identically distributed service times arrive according to a renewal process to a common queue served by $N$ identical servers in a…
We analyse the effect of agent-dependent heavy-tailed waiting times in the voter model on the complete graph with $N$ vertices. We derive a novel scaling limit and show the existence of a limiting infinite voter model on the slowest…
The performance of non-preemptive M/M/1 queueing system with two priority is analyzed. By using complementary variable method to make vector Markov process and analyzing the state-change equations of the queueing system, the generating…
Queueing systems with a single server in which customers wait to be served at a finite number of distinct locations (buffers/queues) are called discrete polling systems. Polling systems in which arrivals of users occur anywhere in a…
The stochastic dynamics of the multi-state voter model is investigated on a class of complex networks made of non-overlapping cliques, each hosting a political candidate and interacting with the others via Erd\H{o}s-R\'enyi links. Numerical…
A graph-theoretic analysis of the steady-state behavior of an open Jackson queueing network is developed. In particular, a number of queueing-network performance metrics are shown to exhibit a spatial dependence on local drivers (e.g.…
A periodically modulated N-state model whose dynamics is governed by a time-convoluted generalized master equation is theoretically analyzed. It is shown that this non-Markovian master equation can be converted to a Markovian master…
By the methods of multitype branching processes in random environment counted by random characteristics we study the tail distribution of busy periods and some other characteristics of the branching type polling systems in which the service…
To ensure the effective and objective development of transportation networks, it is crucial to identify performance limitations across various subsystems. A timetable-independent assessment of infrastructure capacity at railway junctions is…
In this paper, we analyze a polling system on a circle with. Random batches of customers arrive at a circle, where each customer, independently, obtains a location according to a general distribution. A single server cyclically travels over…
Motivated by queueing systems with heterogeneous parallel servers, we consider a class of structured multi-dimensional Markov processes whose state space can be partitioned into two parts: a finite set of boundary states and a structured…
We study the ordering dynamics of nonlinear voter models with multiple states, also providing a discussion of the two-state model. The rate with which an individual adopts an opinion scales as the $q$-th power of the number of the…