Related papers: Optimizing the Throughput of Particulate Streams S…
This work introduces capacity limits for molecular timing (MT) channels, where information is modulated in the release timing of small information particles, and decoded from the time of arrivals at the receiver. It is shown that the random…
We introduce an optimum principle for a vehicular traffic network with road bottlenecks. This network breakdown minimization (BM) principle states that the network optimum is reached, when link flow rates are assigned in the network in such…
We propose a scheme of the exact fast-forwarding of standard quantum dynamics for a charged particle. The present idea allows the acceleration of both the amplitude and phase of the wave function throughout the fast-forward time range and…
Tunneling of a quasibound state is a non-smooth process in the entangled many-body case. Using time-evolving block decimation, we show that repulsive (attractive) interactions speed up (slow down) tunneling, which occurs in bursts. While…
Using a time operator, we define a tunneling time for a particle going through a barrier. This tunneling time is the average of the phase time introduced by other authors. In addition to the delay time caused by the resonances over the…
We study the random acceleration model, which is perhaps one of the simplest, yet nontrivial, non-Markov stochastic processes, and is key to many applications. For this non-Markov process, we present exact analytical results for the…
We examine a two-dimensional system of sterically repulsive interacting disks where each particle runs in a random direction. This system is equivalent to a run-and-tumble dynamics system in the limit where the run time is infinite. At low…
We consider the problem of optimal probing of states of a channel by transmitter and receiver for maximizing rate of reliable communication. The channel is discrete memoryless (DMC) with i.i.d. states. The encoder takes probing actions…
Laboratory experiments were conducted to study particle migration and flow properties of non- Brownian, non-colloidal suspensions ranging from 10% to 40% particle volume fraction in a pressure-driven flow over and through a porous structure…
We study a model for flocking given by a $n$-particle system under which each particle jumps forward by a random amount, independently sampled from a given distribution $\theta$, with rate given by a non-increasing function $w$ of its…
This is an expository review paper illustrating the ``martingale method'' for proving many-server heavy-traffic stochastic-process limits for queueing models, supporting diffusion-process approximations. Careful treatment is given to an…
A dynamical system is considered, which comprises an $n$-dimensional lattice $N_1 \times N_2 \times \dots \times N_n$ with periodic boundary conditions. Particles traverse this lattice following a variant of the Biham--Middleton--Levine…
We study a system of reflected Brownian motions on the positive half-line in which each particle has a drift toward the origin determined by the local times at the origin of all the particles. If this local time drift is too strong, such…
We study a class of random processes on $N$ particles which can be interpreted as stochastic model of luminescence. Each particle can stay in one of two states: Excited state or ground state. Any particle at ground state is excited with a…
This paper studies the diffusion limit for a network of infinite-server queues operating under Markov modulation (meaning that the system's parameters depend on an autonomously evolving background process). In previous papers on (primarily…
Exact queueing analysis of erasure networks with network coding in a finite buffer regime is an extremely hard problem due to the large number of states in the network. In such networks, packets are lost due to either link erasures or due…
The master equation and, more generally, Markov processes are routinely used as models for stochastic processes. They are often justified on the basis of randomization and coarse-graining assumptions. Here instead, we derive n-th order…
In this paper, we study the dynamics of a system of $n$ coupled, self-propelled particles: $\ddot r_k = (\alpha-\beta |\dot r_k|^2)\dot r_k - \frac{\gamma}{n}\sum_{m=1}^n(r_k-r_m)$, $r_k\in \mathbb R^2.$ Numerical experiments indicate that,…
We consider scheduling in a quantum switch with stochastic entanglement generation, finite quantum memories, and decoherence. The objective is to design a scheduling algorithm with polynomial-time computational complexity that stabilizes a…
Motivated by queues with many servers, we study Brownian steady-state approximations for continuous time Markov chains (CTMCs). Our approximations are based on diffusion models (rather than a diffusion limit) whose steady-state, we prove,…