Related papers: Perfect shuffling by lazy swaps

We consider binary infinite order stochastic chains perturbed by a random noise. This means that at each time step, the value assumed by the chain can be randomly and independently flipped with a small fixed probability. We show that the…

A sorting network is a shortest path from 12...n to n...21 in the Cayley graph of S_n generated by nearest-neighbour swaps. We prove that for a uniform random sorting network, as n->infinity the space-time process of swaps converges to the…

We prove some general results about the asymptotics of the distribution of the number of cycles of given length of a random permutation whose distribution is invariant under conjugation. These results were first established to be applied in…

In this article, we study a model of random permutations, which we call random standardized permutations, based on a sequence of i.i.d. random variables. This model generalizes others, such as the riffle-shuffle and the major-index-biased…

The syntactic structure of a sentence is often represented using syntactic dependency trees. The sum of the distances between syntactically related words has been in the limelight for the past decades. Research on dependency distances led…

We construct a binary minimal subshift whose words of length n form a connected subset of the Hamming graph for each n.

We consider random walks on the set of all words over a finite alphabet such that in each step only the last two letters of the current word may be modified and only one letter may be adjoined or deleted. We assume that the transition…

We examine the open problem of finding the shortest string that contains each of the n! permutations of n symbols as contiguous substrings (i.e., the shortest superpermutation on n symbols). It has been conjectured that the shortest…

In this note a very crude but simple approximation to the set of separable states in an arbitrary simplex of commutative states is given using the fact that on the lines connecting the maximally mixed state and an arbitrary pure state the…

We consider dynamical systems arising from substitutions over a finite alphabet. We prove that such a system is linearly repetitive if and only if it is minimal. Based on this characterization we extend various results from primitive…

In this article we study a small random perturbation of a linear recurrence equation. If all the roots of its corresponding characteristic equation have modulus strictly less than one, the random linear recurrence goes exponentially fast to…

Fix a probability $p\in(0,1)$. Let $s_i$ denote the transposition in the symmetric group $\mathfrak{S}_n$ that swaps $i$ and $i+1$. Given a word $\mathsf{w}$ over the alphabet $\{s_1,\ldots,s_{n-1}\}$, we can generate a random subword by…

A simple permutation is one which maps no proper non-singleton interval onto an interval. We consider the enumeration of simple permutations from several aspects. Our results include a straightforward relationship between the ordinary…

We consider uniform random permutations in proper substitution-closed classes and study their limiting behavior in the sense of permutons. The limit depends on the generating series of the simple permutations in the class. Under a mild…

The structure of a sentence can be represented as a network where vertices are words and edges indicate syntactic dependencies. Interestingly, crossing syntactic dependencies have been observed to be infrequent in human languages. This…

The probabilistic interpretation of Laplace transforms is used to help to describe the Laplace Transform $L(s)$ of improper random variables. In particular, busy periods in queueing models are examined. The value of $L(0)$ is explained in…

Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. Using an analysis of the probability that two overlapping consecutive $k$-permutations are order isomorphic, the authors of a recent paper showed that the expected number of…

Random substitutions are a natural generalisation of their classical `deterministic' counterpart, whereby at every step of iterating the substitution, instead of replacing a letter with a predetermined word, every letter is independently…

Randomness (in the sense of being generated in an IID fashion) and exchangeability are standard assumptions in nonparametric statistics and machine learning, and relations between them have been a popular topic of research. This short paper…

There are many randomness notions. On the classical account, many of them are about whether a given infinite binary sequence is random for some given probability. If so, this probability turns out to be the same for all these notions, so…