Related papers: Random Words, Toeplitz Determinants and Integrable…
The data on 13 typologically different languages have been processed using a two-parameter word length model, based on 1-displaced uniform Poisson distribution. Statistical dependencies of the 2nd parameter on the 1st one are revealed for…
This paper describes the probabilistic behaviour of a random Sturmian word. It performs the probabilistic analysis of the recurrence function which can be viewed as a waiting time to discover all the factors of length $n$ of the Sturmian…
We study the distribution of the length of longest monotone subsequences in random (fixed-point free) involutions of $n$ integers as $n$ grows large, establishing asymptotic expansions in powers of $n^{-1/6}$ in the general case and in…
In analogy to the KP theory, the second Poisson structure for the dispersionless KP hierarchy can be defined on the space of commutative pseudodifferential operators $L=p^n+\sum_{j=-\infty}^{n-1}u_j p^j$. The reduction of the Poisson…
Using the free fermions technique and bosonization rules we introduce the multicomponent DKP hierarchy as a generating bilinear integral equation for the tau-function. A number of bilinear equations of the Hirota-Miwa type are obtained as…
Explicit expressions for restricted partition function $W(s,{\bf d}^m)$ and its quasiperiodic components $W_j(s,{\bf d}^m)$ (called {\em Sylvester waves}) for a set of positive integers ${\bf d}^m = \{d_1, d_2, ..., d_m\}$ are derived. The…
A subsequence of a word $w$ is a word $u$ such that $u = w[i_1] w[i_2] \cdots w[i_k]$, for some set of indices $1 \leq i_1 < i_2 < \dots < i_k \leq \vert w \vert$. A word $w$ is \emph{$k$-subsequence universal} over an alphabet $\Sigma$ if…
This paper introduces some new characterizations of COM-Poisson random variables. First, it extends Moran-Chatterji characterization and generalizes Rao-Rubin characterization of Poisson distribution to COM-Poisson distribution. Then, it…
An L-system (for lossless compression) is a CPD0L-system extended with two parameters $d$ and $n$, which determines unambiguously a string $w = \tau(\varphi^d(s))[1:n]$, where $\varphi$ is the morphism of the system, $s$ is its axiom, and…
We consider discrete orthogonal polynomial ensembles which are discrete analogues of the orthogonal polynomial ensembles in random matrix theory. These ensembles occur in certain problems in combinatorial probability and can be thought of…
We consider the gap probability for the Pearcey and Airy processes; we set up a Riemann--Hilbert approach (different from the standard one) whereby the asymptotic analysis for large gap/large time of the Pearcey process is shown to…
We study the new problem of Huffman-like codes subject to individual restrictions on the code-word lengths of a subset of the source words. These are prefix codes with minimal expected code-word length for a random source where additionally…
We investigate a recursively generated sequence of random variables that begins with an Exponential random variable with parameter (i.e., inverse-mean) 1, and continues with additional Exponentials, each of whose random parameter possesses…
In this article, we solve the problem of the long time behaviour of transition probabilities of time-inhomogeneous Markov processes and give a unified approach to stochastic differential equations (SDEs) with periodic, quasi-periodic,…
This paper introduces a convenient strategy for coding and predicting sequences of independent, identically distributed random variables generated from a large alphabet of size $m$. In particular, the size of the sample is allowed to be…
Words in natural language follow a Zipfian distribution whereby some words are frequent but most are rare. Learning representations for words in the "long tail" of this distribution requires enormous amounts of data. Representations of rare…
Structure and properties of families of critical points for classes of functions $W(z,\bar{z})$ obeying the elliptic Euler-Poisson-Darboux equation $E(1/2,1/2)$ are studied. General variational and differential equations governing the…
Selecting N random points in a unit square corresponds to selecting a random permutation. By putting 5 types of symmetry restrictions on the points, we obtain subsets of permutations : involutions, signed permutations and signed…
A new multivariate integer-valued Generalized AutoRegressive Conditional Heteroscedastic process based on a multivariate Poisson generalized inverse Gaussian distribution is proposed. The estimation of parameters of the proposed…
We study the partition function from random matrix theory using a well known connection to orthogonal polynomials, and a recently developed Riemann-Hilbert approach to the computation of detailed asymptotics for these orthogonal…