English
Related papers

Related papers: Poisson approximation for large permutation groups

200 papers

Let $n\geq 1$ and $X_{n}$ be the random variable representing the size of the smallest component of a random combinatorial object made of $n$ elements. A combinatorial object could be a permutation, a monic polynomial over a finite field, a…

Combinatorics · Mathematics 2023-08-15 Claude Gravel , Daniel Panario

The Poisson distribution of order $k$ is a special case of a compound Poisson distribution. For $k=1$ it is the standard Poisson distribution. Although its probability mass function (pmf) is known, what is lacking is a $visual$…

Probability · Mathematics 2023-09-26 S. R. Mane

We prove a conjecture dating back to a 1978 paper of D.R.\ Musser~\cite{musserirred}, namely that four random permutations in the symmetric group $\mathcal{S}_n$ generate a transitive subgroup with probability $p_n > \epsilon$ for some…

Probability · Mathematics 2014-12-12 Robin Pemantle , Yuval Peres , Igor Rivin

Many random combinatorial objects have a component structure whose joint distribution is equal to that of a process of mutually independent random variables, conditioned on the value of a weighted sum of the variables. It is interesting to…

Probability · Mathematics 2013-08-16 Richard Arratia , Simon Tavare

We study scaling limits of random permutations ("permutons") constrained by having fixed densities of a finite number of patterns. We show that the limit shapes are determined by maximizing entropy over permutons with those constraints. In…

Combinatorics · Mathematics 2015-09-01 Richard Kenyon , Daniel Kral , Charles Radin , Peter Winkler

An approach to modelling random sets with locally finite perimeter as random elements in the corresponding subspace of $L^1$ functions is suggested. A Crofton formula for flat sections of the perimeter is shown. Finally, random processes of…

Probability · Mathematics 2017-02-14 Jan Rataj

Elkies and McMullen [Duke Math.J.~123 (2004) 95--139] have shown that the gaps between the fractional parts of \sqrt n for n=1,\ldots,N, have a limit distribution as N tends to infinity. The limit distribution is non-standard and differs…

Number Theory · Mathematics 2013-06-28 Daniel El-Baz , Jens Marklof , Ilya Vinogradov

A general explicit upper bound is obtained for the proportion $P(n,m)$ of elements of order dividing $m$, where $n-1 \le m \le cn$ for some constant $c$, in the finite symmetric group $S_n$. This is used to find lower bounds for the…

Group Theory · Mathematics 2014-05-05 Alice C. Niemeyer , Cheryl E. Praeger

Let $X_1,X_2,...,X_n$ be a sequence of independent or locally dependent random variables taking values in $\mathbb{Z}_+$. In this paper, we derive sharp bounds, via a new probabilistic method, for the total variation distance between the…

Statistics Theory · Mathematics 2010-10-11 Michael V. Boutsikas , Eutichia Vaggelatou

In this article, we provide an extension of the Chen-Stein inequality for Poisson approximation in the total variation distance for sums of independent Bernoulli random variables in two ways. We prove that we can improve the rate of…

Probability · Mathematics 2022-10-26 Pierre-Loïc Méliot , Ashkan Nikeghbali , Gabriele Visentin

The time evolution of a bounded quantum system is considered in the framework of the orthogonal, unitary and symplectic circular ensembles of random matrix theory. For an $N$ dimensional Hilbert space we prove that in the large $N$ limit…

Mesoscale and Nanoscale Physics · Physics 2008-02-03 P. Leboeuf , G. Iacomelli

The Poisson boundary of a group G with a probability measure \mu is the space of ergodic components of the time shift in the path space of the associated random walk. Via a generalization of the classical Poisson formula it gives an…

Dynamical Systems · Mathematics 2007-05-23 Vadim A. Kaimanovich

We investigate the asymptotic properties of permutations drawn from the Luce model, a natural probabilistic framework in which permutations are generated sequentially by sampling without replacement, with selection probabilities…

Probability · Mathematics 2025-10-07 Jacopo Borga , Sourav Chatterjee , Persi Diaconis

If we treat the symmetric group $S_n$ as a probability measure space where each element has measure $1/n!$, then the number of cycles in a permutation becomes a random variable. The Cycle Length Lemma describes the expected values of…

Category Theory · Mathematics 2025-04-21 John C. Baez

Let $K$ be a subgroup of a finite group $G$. The probability that an element of $G$ commutes with an element of $K$ is denoted by $Pr(K,G)$. Assume that $Pr(K,G)\geq\epsilon$ for some fixed $\epsilon>0$. We show that there is a normal…

Group Theory · Mathematics 2021-05-04 Eloisa Detomi , Pavel Shumyatsky

We study random surfaces constructed by glueing together $N/k$ filled $k$-gons along their edges, with all $(N-1)!! = (N-1)(N-3)...3\cdot 1$ pairings of the edges being equally likely. (We assume that lcm $\{2,k\}$ divides $N$.) The Euler…

Probability · Mathematics 2009-02-23 Kevin Fleming , Nicholas Pippenger

Using the recently developed notion of permutation limits this paper derives the limiting distribution of the number of fixed points and cycle structure for any convergent sequence of random permutations, under mild regularity conditions.…

Probability · Mathematics 2016-07-14 Sumit Mukherjee

Define the scaled empirical point process on an independent and identically distributed sequence $\{Y_i: i\le n\}$ as the random point measure with masses at $a_n^{-1} Y_i$. For suitable $a_n$ we obtain the weak limit of these point…

Probability · Mathematics 2016-08-16 André Dabrowski , Gail Ivanoof , Rafal Kulik

We present new, exceptionally efficient proofs of Poisson--Dirichlet limit theorems for the scaled sizes of irreducible components of random elements in the classic combinatorial contexts of arbitrary assemblies, multisets, and selections,…

Probability · Mathematics 2014-01-09 Richard Arratia , Fred Kochman

Let P be a Poisson process of intensity one in a square S_n of area n. For a fixed integer k, join every point of P to its k nearest neighbours, creating an undirected random geometric graph G_{n,k}. We prove that there exists a critical…

Probability · Mathematics 2007-08-30 Paul Balister , Bela Bollobas , Amites Sarkar , Mark Walters