Related papers: On The Waiting Time for A M/M/1 Queue with Impatie…
We study some mesoscopic properties of electron transport by employing one-dimensional chains and Anderson tight-binding model. Principal attention is paid to the resistance of finite-length chains with disordered white-noise potential. We…
The paper studies asymptotic behavior of the loss probability for the $GI/M/m/n$ queueing system as $n$ increases to infinity. The approach of the paper is based on applications of classic results of Tak\'acs (1967) and the Tauberian…
Based on the Langevin description of the Continuous Time Random Walk (CTRW), we consider a generalization of CTRW in which the waiting times between the subsequent jumps are correlated. We discuss the cases of exponential and slowly…
A pattern is encountered in a word if some infix of the word is the image of the pattern under some non-erasing morphism. A pattern $p$ is unavoidable if, over every finite alphabet, every sufficiently long word encounters $p$. A theorem by…
We solve the secretary problem in the case that the ranked items arrive in a statistically biased order rather than in uniformly random order. The bias is given by a Mallows distribution with parameter $q\in(0,1)$, so that higher ranked…
Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. The authors of [2] showed that the expected number of distinct consecutive patterns of all lengths $k\in\{1,2,\ldots,n\}$ in $\pi_n$ was $\frac{n^2}{2}(1-o(1))$ as $n\to\infty$,…
We address a question and a conjecture on the expected length of the longest common subsequences of two i.i.d.$\ $random permutations of $[n]:=\{1,2,...,n\}$. The question is resolved by showing that the minimal expectation is not attained…
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…
An infinte word w avoids a pattern p with the involution t if there is no substitution for the variables in p and no involution t such that the resulting word is a factor of w. We investigate the avoidance of patterns with respect to the…
We consider the first passage percolation model on the ${\bf Z}^d$ lattice. In this model, we assign independently to each edge $e$ a non-negative passage time $t(e)$ with a common distribution $F$. Let $a_{0,n}$ be the passage time from…
Heavy-traffic limit theory deals with queues that operate close to criticality and face severe queueing times. Let $W$ denote the steady-state waiting time in the ${\rm GI}/{\rm G}/1$ queue. Kingman (1961) showed that $W$, when…
The emergence of discourse-like tokens such as "wait" and "therefore" in large language models (LLMs) has offered a unique window into their reasoning processes. However, systematic analyses of how such signals vary across training…
We consider the on-time transmissions of a sequence of packets over a fading channel.Different from traditional in-time communications, we investigate how many packets can be received $\delta$-on-time, meaning that the packet is received…
We study a generalization of the $M/G/1$ system (denoted by $rM/G/1$) with independent and identically distributed (iid) service times and with an arrival process whose arrival rate $\lambda_0f(r)$ depends on the remaining service time $r$…
We study message transport on a $1-d$ ring of nodes and randomly distributed hubs. Messages are deposited on the network at a constant rate. When the rate at which messages are deposited on the lattice is very high, messages start…
We consider a reaction-diffusion process with retardation. The particles, immersed in traps initially, remain inactive until another particle is annihilated spontaneously with a rate $\lambda$ at a certain point $\vec x$. In that case the…
In this work, we consider the case where a source with bursty traffic can adjust the transmission duration in order to increase the reliability. The source is equipped with a queue in order to store the arriving packets. We model the system…
We study a sequence of single server queues with customer abandonment (GI/GI/1+GI) under heavy traffic. The patience time distributions vary with the sequence, which allows for a wider scope of applications. It is known ([20, 18]) that the…
We consider a random permutation drawn from the set of 132-avoiding permutations of length $n$ and show that the number of occurrences of another pattern $\sigma$ has a limit distribution, after scaling by $n^{\lambda(\sigma)/2}$ where…
We evaluate the average waiting time between observing the price of financial markets and the next price change, especially in an on-line foreign exchange trading service for individual customers via the internet. Basic technical idea of…