Related papers: The M/M/1 queue is Bernoulli
In this paper we present a martingale related to the exit measures of super-Brownian motion. By changing measure with this martingale in the canonical way we have a new process associated with the conditioned exit measure. This measure is…
We study a single-server priority queue with a finite number of classes, in which the arrivals follow a fractional Poisson process of index $\alpha \in (0,1]$ and the service completions are triggered by an independent fractional Poisson…
We consider a two-node tandem queueing network in which the upstream queue is GI/GI/1 and each job reuses its upstream service requirement when moving to the downstream queue. Both servers employ the first-in-first-out policy. To…
Quantum mechanics states that a particle emitted at point (x_1,t_1) and detected at point (x_2,t_2) does not travel along a definite path between the two points. This conclusion arises essentially from the analysis of the two-slit…
The very old problem of the statistical content of quantum mechanics (QM) is studied in a novel framework. The Born's rule (one of the basic postulates of QM) is derived from theory of classical random signals. We present a measurement…
When driven by a potential bias between two finite reservoirs, the particle current across a quantum system evolves from an initial loading through a coherent, followed by a metastable phase, and ultimately fades away upon equilibration. We…
Bounding the queue length in a multiserver queue is a central challenge in queueing theory. Even for the classical $G/G/n$ queue with homogeneous servers, it is highly non-trivial to derive a simple and accurate bound for the steady-state…
The mathematics of the finite single server queue with Poisson input and semi-Markov service times($M/SM/1/b$) is similar to that used for $BMAP/G/1/b$ systems. This observation results in new analytical formulas for a queue size in the…
Our main goal is to study a class of processes whose increments are generated via a cellular automata rule. Given the increments of a simple biased random walk, a new sequence of (dependent) Bernoulli random variables is produced. It is…
This paper studies the queue length process in series Jackson networks with external input to the first station. We show that its Markov transition probabilities can be written as a finite sum of non-crossing probabilities, so that…
The conventional interpretation of quantum mechanics, though it permits a correspondence to classical physics, leaves the exact mechanism of transition unclear. Though this was only of philosophical importance throughout the twentieth…
In this note, by an elementary use of Girsanov's transform we show that the exit time for either a biased random walk or a drifted Brownian motion on a symmetric interval is stochastically monotone with respect to the drift parameter. In…
In a previous article [1] we presented an argument to obtain (or rather infer) Born's rule, based on a simple set of axioms named "Contexts, Systems and Modalities" (CSM). In this approach there is no "emergence", but the structure of…
It was repeatedly underlined in literature that quantum mechanics cannot be considered a closed theory if the Born Rule is postulated rather than derived from the first principles. In this work the Born Rule is derived from the…
We describe a quantum mechanical measurement as a variational principle including interaction between the system under measurement and the measurement apparatus. Augmenting the action with a nonlocal term (a double integration over the…
In this paper, we analyze the sojourn of an entire batch in a processor sharing $M^{[X]}/M/1$ processor queue, where geometrically distributed batches arrive according to a Poisson process and jobs require exponential service times. By…
A result of Chebyshev (1864) and Hoeffding1956}, on bounding an expectation of a given function with respect to a Bernoulli convolution (also called Poisson binomial law, or law of the number of successes in independent trials) with any…
We introduce and study a new model: 0-automatic queues. Roughly, 0-automatic queues are characterized by a special buffering mechanism evolving like a random walk on some infinite group or monoid. The salient result is that all stable…
The measurement conundrum seems to have plagued quantum mechanics for so long that impressions of an inconsistency amongst its axioms have spawned. A demonstration that such purported inconsistency is fictitious may then be in order and is…
A mean-field extension of the queueing system \(GI/GI/1\) is considered. The process is constructed as a Markov solution of a martingale problem. Uniqueness in distribution is established under a bit different sets of assumptions on…