Related papers: Logical limit laws for Mallows random permutations

Driven by the interest of reasoning about probabilistic programming languages, we set out to study a notion of unicity of normal forms for them. To provide a tractable proof method for it, we define a property of distribution confluence…

For a word $\pi$ and integer $i$, we define $L^i(\pi)$ to be the length of the longest subsequence of the form $i(i+1)\cdots j$, and we let $L(\pi):=\max_i L^i(\pi)$. In this paper we estimate the expected values of $L^1(\pi)$ and $L(\pi)$…

We analyze the asymptotic behavior of random variables $x(n,x\_0)$ defined by $x(0,x\_0)=x\_0$ and $x(n+1,x\_0)=A(n)x(n,x\_0)$, where $\sAn$ is a stationary and ergodic sequence of random matrices with entries in the semi-ring…

Zipf's law of abbreviation, the tendency of more frequent words to be shorter, is one of the most solid candidates for a linguistic universal, in the sense that it has the potential for being exceptionless or with a number of exceptions…

A permutation sequence $(\sigma_n)_{n \in \mathbb{N}}$ is said to be convergent if, for every fixed permutation $\tau$, the density of occurrences of $\tau$ in the elements of the sequence converges. We prove that such a convergent sequence…

Let $P(n)$ be the probability that two independent, uniformly random permutations of $[n]$ have the same order, and let $K(n)$ be the probability that they are in the same conjugacy class. Answering a question of Thibault Godin, we prove…

We introduce a general random model of a combinatorial optimization problem with geometric structure that encapsulates both linear programming and integer linear programming. Let $Q$ be a bounded set called the feasible set, $E$ be an…

We study the $q$-deformation of the Demazure product model from arXiv:2407.21653. Consider the longest element $w_0$ in $S_n$ written as a reduced word in simple transpositions. Independently delete each transposition with probability $1-p$…

Can autoregressive large language models (LLMs) learn consistent probability distributions when trained on sequences in different token orders? We prove formally that for any well-defined probability distribution, sequence perplexity is…

A zero-one language L is a regular language whose asymptotic probability converges to either zero or one. In this case, we say that L obeys the zero-one law. We prove that a regular language obeys the zero-one law if and only if its…

Let $r=r(n)$ be a sequence of integers such that $r\leq n$ and let $X_1,\ldots,X_{r+1}$ be independent random points distributed according to the Gaussian, the Beta or the spherical distribution on $\mathbb{R}^n$. Limit theorems for the…

We consider a minimal model of one-dimensional discrete-time random walk with step-reinforcement, introduced by Harbola, Kumar, and Lindenberg (2014): The walker can move forward (never backward), or remain at rest. For each $n=1,2,\cdots$,…

We introduce and study a new random permutation model that generalizes the $k$-card minimum model defined by Travers and the Mallows model. We calculate the permuton limit of such a sequence of random permutations. As a corollary, we deduce…

We consider permutations avoiding a pattern of length three under the family of Mallows distributions. In particular, for any pattern $\tau\in S_3-\{321\}$, we obtain rather precise results on the asymptotic probability as $n\to\infty$ that…

This article studies the limit of binary search trees drawn from Mallows permutations under various topologies. The main result, pertaining to the standard local topology for graphs, requires the introduction of a generalization of binary…

Consider a complex random $n\times n$ matrix ${\bf X}_n=(x_{ij})_{n\times n}$, whose entries $x_{ij}$ are independent random variables with zero means and unit variances. It is well-known that Tao and Vu (Ann Probab 38: 2023-2065, 2010)…

We show that the exponent in the inverse power law of word frequencies for the monkey-at-the-typewriter model of Zipf's law will tend towards -1 under broad conditions as the alphabet size increases to infinity and the letter probabilities…

Bercovici and Pata showed that the correspondence between classically, freely, and Boolean infinitely divisible distributions holds on the level of limit theorems. We extend this correspondence also to distributions infinitely divisible…

Zipf's law is just one out of many universal laws proposed to describe statistical regularities in language. Here we review and critically discuss how these laws can be statistically interpreted, fitted, and tested (falsified). The modern…

The Mahonian statistic is the number of inversions in a permutation of a multiset with $a_i$ elements of type $i$, $1\le i\le m$. The counting function for this statistic is the $q$ analog of the multinomial coefficient…