Related papers: Queueing with neighbours
This survey concerns probabilistic models motivated by cooperative sequential adsorption (CSA) models. CSA models are widely used in physics and chemistry for modelling adsorption processes in which adsorption rates depend on the spatial…
We consider the problem of selfish agents in discrete-time queuing systems, where competitive queues try to get their packets served. In this model, a queue gets to send a packet each step to one of the servers, which will attempt to serve…
In this article, a new mathematical model of human population growth as an autonomous non-Markov queuing system with an unlimited number of servers and two types of applications is proposed. The research of this system was carried out a…
Many complex systems have been shown to share universal properties of organization, such as scale independence, modularity and self-similarity. We borrow tools from statistical physics in order to study structural preferential attachment…
In the classic herding model, agents receive private signals about an underlying binary state of nature, and act sequentially to choose one of two possible actions, after observing the actions of their predecessors. We investigate what…
This paper investigates the asymptotic behaviour of solutions to certain infinite systems of coupled recurrence relations. In particular, we obtain a characterisation of those initial values which lead to a convergent solution, and for…
Given a growth rule which sequentially constructs random permutations of increasing degree, the stochastic process version of the rencontre problem asks what is the limiting proportion of time that the permutation has no fixed points…
The asymptotic behaviour of a closed BCMP network, with $n$ queues and $m_n$ clients, is analyzed when $n$ and $m_n$ become simultaneously large. Our method relies on Berry-Esseen type approximations coming in the Central Limit Theorem. We…
In this paper, we study the asymptotic (large time) behavior of a selection-mutation-competition model for a population structured with respect to a phenotypic trait, when the rate of mutation is very small. We assume that the reproduction…
We consider the processor sharing $M/M/1$-PS queue which also models balking. A customer that arrives and sees $n$ others in the system "balks" (i.e., decides not to enter) with probability $1-b_n$. If $b_n$ is inversely proportional to…
This paper concerns the long term behaviour of a growth model describing a random sequential allocation of particles on a finite cycle graph. The model can be regarded as a reinforced urn model with graph-based interactions. It is motivated…
In this work we consider a size-structured cannibalism model with the model ingredients (fertility, growth, and mortality rate) depending on size (ranging over an infinite domain) and on a general function of the standing population…
We consider a point process $i+\xi_i$, where $i\in \bZ$ and the $\xi_{i}$'s are i.i.d. random variables with variance $\sigma^{2}$. This process, with a suitable rescaling of the distribution of $\xi_i$'s, converges to the Poisson process…
This work studies sequential social learning (also known as Bayesian observational learning), and how private communication can enable agents to avoid herding to the wrong action/state. Starting from the seminal BHW (Bikhchandani,…
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…
We study a single server FIFO queue that offers general service. Each of n customers enter the queue at random time epochs that are inde- pendent and identically distributed. We call this the random scattering traffic model, and the…
We study transport processes on infinite networks. The solution of these processes can be modeled by an operator semigroup on a suitable Banach space. Classically, such semigroups are strongly continuous and therefore their asymptotic…
We consider a discrete time semi-Markov process where the characteristics defining the process depend on a small perturbation parameter. It is assumed that the state space consists of one finite communicating class of states and, in…
Case-cohort design, an outcome-dependent sampling design for censored survival data, is increasingly used in biomedical research. The development of asymptotic theory for a case-cohort design in the current literature primarily relies on…
We study asymptotic behaviour of stochastic approximation procedures with three main characteristics: truncations with random moving bounds, a matrix valued random step-size sequence, and a dynamically changing random regression function.…