English
Related papers

Related papers: Ewens sampling and invariable generation

200 papers

We study the distribution of cycle lengths in models of nonuniform random permutations with cycle weights. We identify several regimes. Depending on the weights, the length of typical cycles grows like the total number $n$ of elements, or a…

Probability · Mathematics 2011-01-06 Volker Betz , Daniel Ueltschi , Yvan Velenik

Dokos et. al. studied the distribution of two statistics over permutations $\mathfrak{S}_n$ of $\{1,2,\dots, n\}$ that avoid one or more length three patterns. A permutation $\sigma\in\mathfrak{S}_n$ contains a pattern…

Combinatorics · Mathematics 2017-09-26 Samantha Dahlberg

We prove a central limit theorem (CLT) for the number of joint orbits of random tuples of commuting permutations. In the uniform sampling case this generalizes the classic CLT of Goncharov for the number of cycles of a single random…

Probability · Mathematics 2026-02-20 Abdelmalek Abdesselam , Shannon Starr

It is a classical fact that for any $\varepsilon > 0$, a random permutation of length $n = (1 + \varepsilon) k^2 / 4$ typically contains a monotone subsequence of length $k$. As a far-reaching generalization, Alon conjectured that a random…

Combinatorics · Mathematics 2020-05-27 Xiaoyu He , Matthew Kwan

A sequence $\pi_1,\pi_2,\dots$ of permutations is said to be "quasirandom" if the induced density of every permutation $\sigma$ in $\pi_n$ converges to $1/|\sigma|!$ as $n\to\infty$. We prove that $\pi_1,\pi_2,\dots$ is quasirandom if and…

Combinatorics · Mathematics 2024-10-07 Gabriel Crudele , Peter Dukes , Jonathan A. Noel

Let $P_n^1,\dots, P_n^d$ be $n\times n$ permutation matrices drawn independently and uniformly at random, and set $S_n^d:=\sum_{\ell=1}^d P_n^\ell$. We show that if $\log^{12}n/(\log \log n)^{4} \le d=O(n)$, then the empirical spectral…

Probability · Mathematics 2018-04-05 Anirban Basak , Nicholas Cook , Ofer Zeitouni

We provide asymptotic expansions for the Stirling numbers of the first kind and, more generally, the Ewens (or Karamata-Stirling) distribution. Based on these expansions, we obtain some new results on the asymptotic properties of the mode…

Probability · Mathematics 2016-09-19 Zakhar Kabluchko , Alexander Marynych , Henning Sulzbach

A simple explicit construction is provided of a partition-valued fragmentation process whose distribution on partitions of $[n]=\{1,...,n\}$ at time $\theta \ge 0$ is governed by the Ewens sampling formula with parameter $\theta$. These…

Probability · Mathematics 2007-05-23 Alexander Gnedin , Jim Pitman

A distributional symmetry is invariance of a distribution under a group of transformations. Exchangeability and stationarity are examples. We explain that a result of ergodic theory provides a law of large numbers: If the group satisfies…

Statistics Theory · Mathematics 2021-11-30 Morgane Austern , Peter Orbanz

In this article, we study a non-uniform distribution on permutations biased by their number of records that we call \emph{record-biased permutations}. We give several generative processes for record-biased permutations, explaining also how…

Probability · Mathematics 2026-04-01 Mathilde Bouvel , Cyril Nicaud , Carine Pivoteau

Let $S_n$ be the set of all permutations of $\{1,2,\ldots,n\}$ and let $\sigma=(\sigma_1,\sigma_2,\ldots,\sigma_n)\in S_n$. The {\it initial longest increasing sequence} (ILIS) in $\sigma$ has length $m$ if, for $1\le m\le n-1$,…

Combinatorics · Mathematics 2025-10-01 Ljuben Mutafchiev

The Ewens-Pitman model refers to a distribution for random partitions of $[n]=\{1,\ldots,n\}$, which is indexed by a pair of parameters $\alpha \in [0,1)$ and $\theta>-\alpha$, with $\alpha=0$ corresponding to the Ewens model in population…

Probability · Mathematics 2024-08-28 Bernard Bercu , Stefano Favaro

We define a generalized Golomb--Dickman constant $\lambda_{\theta}$ as the limiting expected proportion of the longest cycle in random permutations under the Ewens measure with parameter $\theta > 0$. Exploiting the independence properties…

Probability · Mathematics 2026-05-22 José Ricardo G. Mendonça , Luis Jehiel Negret

We provide a family of generating sets $S_{\alpha}$ of the Higman--Thompson groups $V_n$ that are parametrized by certain sequences $\alpha$ of elements in $V_n$. These generating sets consist of $3$ involutions $\sigma$, $\tau$, and…

Group Theory · Mathematics 2024-11-15 Eduard Schesler , Rachel Skipper , Xiaolei Wu

This paper explores the problem of generative modeling, aiming to simulate diverse examples from an unknown distribution based on observed examples. While recent studies have focused on quantifying the statistical precision of popular…

Statistics Theory · Mathematics 2024-06-07 Elen Vardanyan , Sona Hunanyan , Tigran Galstyan , Arshak Minasyan , Arnak Dalalyan

The Ewens-Pitman model is a probability distribution for random partitions of the set $[n]=\{1,\ldots,n\}$, parameterized by $\alpha\in[0,1)$ and $\theta>-\alpha$, with $\alpha=0$ corresponding to the Ewens model in population genetics. The…

Probability · Mathematics 2025-03-11 Bernard Bercu , Stefano Favaro

We consider Markov chains on the space of (countable) partitions of the interval $[0,1]$, obtained first by size biased sampling twice (allowing repetitions) and then merging the parts with probability $\beta_m$ (if the sampled parts are…

Probability · Mathematics 2007-05-23 Eddy Mayer-Wolf , Ofer Zeitouni , Martin P. W. Zerner

We study the characteristic polynomial of random permutation matrices following some measures which are invariant by conjugation, including Ewens' measures which are one-parameter deformations of the uniform distribution on the permutation…

Probability · Mathematics 2018-09-17 Valentin Bahier

We give an example of a long range Bernoulli percolation process on a group non-quasi-isometric with $\mathbb{Z}$, in which clusters are almost surely finite for all values of the parameter. This random graph admits diverse equivalent…

Probability · Mathematics 2020-08-12 Agelos Georgakopoulos , John Haslegrave

A subset S of a finite group G invariably generates G if G = <hsg(s) j s 2 Si > for each choice of g(s) 2 G; s 2 S. We give a tight upper bound on the minimal size of an invariable generating set for an arbitrary finite group G. In response…

Group Theory · Mathematics 2011-07-20 W. M. Kantor , A. Lubotzky , And A. Shalev