Related papers: Waiting Time Distribution for the Emergence of Sup…
We consider the distribution of the duration time, the time elapsed since it began, of a diffusion process given its present position, under the assumption that the process began at the origin. For unbiased diffusion, the distribution does…
In probability theory, there is a tendency to treat one random variable with a given distribution as being just as good as any other. By and large this is fine because probability is (mostly) concerned with distributional properties of…
Tight bounds on the block entropy of patterns of sequences generated by independent and identically distributed (i.i.d.) sources are derived. A pattern of a sequence is a sequence of integer indices with each index representing the order of…
We study the statistics of quantum transmission through a one-dimensional disordered system modelled by a sequence of independent scattering units. Each unit is characterized by its length and by its action, which is proportional to the…
We survey the theory of increasing and decreasing subsequences of permutations. Enumeration problems in this area are closely related to the RSK algorithm. The asymptotic behavior of the expected value of the length is(w) of the longest…
Frequent pattern mining is a flagship problem in data mining. In its most basic form, it asks for the set of substrings of a given string $S$ of length $n$ that occur at least $\tau$ times in $S$, for some integer $\tau\in[1,n]$. We…
The factor analysis model is a statistical model where a certain number of hidden random variables, called factors, affect linearly the behaviour of another set of observed random variables, with additional random noise. The main assumption…
Successive pairs of pseudo-random numbers generated by standard linear congruential transformations display ordered patterns of parallel lines. We study the ``ordered'' and ``chaotic'' distribution of such pairs by solving the eigenvalue…
Undirected graphs are often used to describe high dimensional distributions. Under sparsity conditions, the graph can be estimated using $\ell_1$ penalization methods. However, current methods assume that the data are independent and…
This paper considers the mean waiting times in discrete-time preemptive-resume and nonpreemptive priority single-server queues fed by K independent batch Markovian arrival streams with geometrically distributed idle periods. While being…
A sorting network is a shortest path from 12..n to n..21 in the Cayley graph of the symmetric group S(n) generated by nearest-neighbor swaps. A pattern is a sequence of swaps that forms an initial segment of some sorting network. We prove…
Complex nonequilibrium systems are often effectively described by a `statistics of a statistics', in short, a `superstatistics'. We describe how to proceed from a given experimental time series to a superstatistical description. We argue…
We consider queueing models, where customers arrive according to a continuous-time binomial process on a finite interval. In this arrival process, a total of $K$ customers arrive in the finite time interval $[0,T]$, where arrival times of…
We studied two probabilistic models of the distribution of primes in the natural number [1].The paper considers the third probabilistic model of the distribution of primes in the natural number. The author proved that the results obtained…
Super-stability and strong stability are properties of a matching in the stable matching problem with ties. In this paper, we introduce a common generalization of super-stability and strong stability, which we call non-uniform stability.…
Consider a random permutation $\pi\in{\cal S}_n$. In this paper, perhaps best classified as a contribution to discrete probability distribution theory, we study the {\it first} occurrence $X=X_n$ of a I-II-III-pattern, where "first" is…
We consider random graphs sampled uniformly from a structured class of graphs, such as the class of graphs embeddable in a given surface. We sharpen and extend earlier results on pendant appearances, concerning for example numbers of…
Let $X_1,X_2,\ldots$ be independent identically distributed nonnegative random variables. Wald's identity states that the random sum $S_T:=X_1+\cdots+X_T$ has expectation $E(T)) E(X_1)$ provided $T$ is a stopping time. We prove here that…
We consider a sequence of quantized Lorentzian pulses of non-interacting electrons impinging on a quantum point contact (QPC) and study the waiting time distribution (WTD), for any transmission and any number of pulses. As the degree of…
For a variety of pattern-avoiding classes, we describe the limiting distribution for the number of fixed points for involutions chosen uniformly at random from that class. In particular we consider monotone patterns of arbitrary length as…