Related papers: Optimizing the Throughput of Particulate Streams S…
In this paper we consider the problem of maximum throughput for tandem queueing system. We modeled this system as a Quasi-Birth-Death process. In order to do this we named level the number of customers waiting in the first buffer (including…
We use Stokesian Dynamics simulations to study the microscopic motion of particles suspended in fluids passing through porous media. We construct model porous media with fixed spherical particles, and allow mobile ones to move through this…
Quantum tunnelling, a hallmark phenomenon of quantum mechanics, allows particles to pass through the classically forbidden region. It underpins fundamental processes ranging from nuclear fusion and photosynthesis to the operation of…
The Fleming-Viot process describes a system of $N$ particles diffusing on a graph with an absorbing site. Whenever one of the particles is absorbed, it is replaced by a new particle at the position of one of the $N-1$ remaining particles.…
We consider a gas of independent Brownian particles on a bounded interval in contact with two particle reservoirs at the endpoints. Due to the Brownian nature of the particles, infinitely many particles enter and leave the system in each…
This note introduces a piecewise-deterministic queueing (PDQ) model to study the stability of traffic queues in parallel-link transportation systems facing stochastic capacity fluctuations. The saturation rate (capacity) of the PDQ model…
We develop a new variant of the wave-packet analysis and solve the tunneling time problem for one particle. Our approach suggests an individual asymptotic description of the quantum subensembles of transmitted and reflected particles both…
We study the optimal provision of information for two natural performance measures of queuing systems: throughput and makespan. A set of parallel links is equipped with deterministic capacities and stochastic travel times where the latter…
We introduce and analyze two general dynamical models for unidirectional movement of particles along a circular chain and an open chain of sites. The models include a soft version of the simple exclusion principle, that is, as the density…
The first arrivals among $N$ Brownian particles is ubiquitous in the life sciences, as it often trigger cellular processes from the molecular level. We study here the case where stochastic particles, which represent molecules, proteins or…
We consider a finite or countable collection of one-dimensional Brownian particles whose dynamics at any point in time is determined by their rank in the entire particle system. Using Transportation Cost Inequalities for stochastic…
We consider an elementary model for self-organised criticality, the activated random walk on the complete graph. We introduce a discrete time Markov chain as follows. At each time step, we add an active particle at a random vertex and let…
We consider traffic flow dynamics for a network of signalized intersections, where the outflow from every link is constrained to be equal to a given capacity function if the queue length is positive, and equal to the minimum of cumulative…
The escape rate of a Brownian particle over a potential barrier is accurately described by the Kramers theory. A quantitative theory explicitly taking the activity of Brownian particles into account has been lacking due to the inherently…
The transport of independent active Brownian particles within a two-dimensional narrow channel, modeled as an open-wedge, is studied both numerically and theoretically. We show that the active force tends to localize the particles near the…
Consider the continuous-time Markov Branching Process. In critical case we consider a situation when the generating function of intensity of transformation of particles has the infinite second moment, but its tail regularly varies in sense…
In this paper we revisit the Markovian queueing system with a single server, infinite capacity queue and the special queue skipping policy. Customers arrive in batches, but are served one by one according to any conservative discipline. The…
We consider a stochastic queueing system modelling the behaviour of a wireless network with nodes employing a discrete-time version of the standard decentralised medium access algorithm. The system is {\em unsaturated} -- each node receives…
Given two independent point processes and a certain rule for matching points between them, what is the fraction of matched points over infinitely long streams? In many application contexts, e.g., secure networking, a meaningful matching…
Herein, we analyze an efficient branching particle method for asymptotic solutions to a class of continuous-discrete filtering problems. Suppose that $t\to X_t$ is a Markov process and we wish to calculate the measure-valued process…