Related papers: T\'oth's buses and the "detachment process''
We introduce an extension of the M/M/1 queueing process with a spatial structure and excluded- volume effect. The rule of particle hopping is the same as for the totally asymmetric simple exclusion process (TASEP). A stationary-state…
A microscopic, stochastic, minimal model for collective and cohesive motion of identical self-propelled particles is introduced. Even though the particles interact strictly locally in a very noisy manner, we show that cohesion can be…
We consider the follow-the-leader model for traffic flow. The position of each car $z_i(t)$ satisfies an ordinary differential equation, whose speed depends only on the relative position $z_{i+1}(t)$ of the car ahead. Each car perceives a…
In the Hammersley-Aldous-Diaconis process infinitely many particles sit in R and at most one particle is allowed at each position. A particle at x$ whose nearest neighbor to the right is at y, jumps at rate y-x to a position uniformly…
The stiff problem is concerned with a thermal conduction model with a singular barrier of zero volume. In this paper, we shall build the phase transitions for the stiff problems in one-dimensional space. It turns out that every phase…
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.…
We consider the behaviour of branching-selection particle systems in the large population limit. The dynamics of these systems is the combination of the following three components: (a) Motion: particles move on the real line according to a…
We study a system composed of two parallel totally asymmetric simple exclusion processes with open boundaries, where the particles move in the two lanes in opposite directions and are allowed to jump to the other lane with rates inversely…
We study the synchronization behavior of discrete-time Markov chains on countable state spaces. Representing a Markov chain in terms of a random dynamical system, which describes the collective dynamics of trajectories driven by the same…
Motivated by a recent finding of an exact solution of the relativistic Boltzmann equation in a Friedmann-Robertson-Walker spacetime, we implement this metric into the newly developed transport approach Simulating Many Accelerated…
The aim of the dispersion problem is to place a set of $k(\leq n)$ mobile robots in the nodes of an unknown graph consisting of $n$ nodes such that in the final configuration each node contains at most one robot, starting from any arbitrary…
We consider a Markov process $ X(t) $ on the nonnegative integers $E= S \cup \{0\}$, where $S=\{1,2,...\}$ is an irreducible class and 0 is an absorbing state. In this paper, we investigate conditions under which the quasi-stationary…
Public transit passengers need guidance during service disruptions. This study proposes an individual-based path (IPR) recommendation model. The model decides which paths to recommend for each passenger with the objective of minimizing…
We study an open discrete-time queueing network that models the collection of data in a multi-hop sensor network. We assume data is generated at the sensor nodes as a discrete-time Bernoulli process. All nodes in the network maintain a…
We generalise the construction of multivariate Hawkes processes to a possibly infinite network of counting processes on a directed graph $\mathbb G$. The process is constructed as the solution to a system of Poisson driven stochastic…
We consider one-dimensional asymmetric exclusion processes with a simple attractive interaction, where the distance between consecutive particles is not allowed to exceed a certain limit and investigate the consequences of this coupling on…
Filtration, flow in narrow channels and traffic flow are examples of processes subject to blocking when the channel conveying the particles becomes too crowded. If the blockage is temporary, which means that after a finite time the channel…
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 study convergence to equilibrium for a large class of Markov chains in random environment. The chains are sparse in the sense that in every row of the transition matrix $P$ the mass is essentially concentrated on few entries. Moreover,…
Motivated by uncertainty quantification in natural transport systems, we investigate an individual-based transport process involving particles undergoing a random walk along a line of point sinks whose strengths are themselves independent…