Clustering of consecutive numbers in permutations under Mallows distributions and super-clustering under general p-shifted distributions

Abstract

Let A(n)l;k⊂ Sn denote the set of permutations of [n] for which the set of l consecutive numbers \k, k+1,·s, k+l-1\ appears in a set of consecutive positions. Under the uniformly probability measure Pn on Sn, one has Pn(A(n)l;k)l!nl-1 as n∞. In one part of this paper we consider the probability of clustering of consecutive numbers under Mallows distributions Pnq, q>0. Because of a duality, it suffices to consider q∈(0,1). We show that for qn=1- cnα, with c>0 and α∈(0,1), Pnq(A(n)l;kn) is on the order 1nα(l-1), uniformly over all sequences \kn\n=1∞. Thus, letting N(n)l=Σk=1n-l+11A(n)l;k denote the number of sets of l consecutive numbers appearing in sets of consecutive positions, we have equation* n∞ EnqnN(n)l = cases∞,\ if\ l<1+αα;\\ 0,\ if \ l>1+αα. cases. equation* We also consider the cases α=1 and α>1. In the other part of the paper we consider general p-shifted distributions, of which the Mallows distribution is a particular case. We calculate explicitly the quantity l∞ n∞Pnq(A(n)l;kn) = l∞n∞Pnq(A(n)l;kn) in terms of the p-distribution. When this quantity is positive, we say that super-clustering occurs. In particular, super-clustering occurs for the Mallows distribution with parameter q≠1. We also give a new characterization of p-shifted distributions.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…