Harry Crane ; Stephen DeSalvo - Pattern Avoidance for Random Permutations

dmtcs:3213 - Discrete Mathematics & Theoretical Computer Science, December 4, 2018, Vol. 19 no. 2, Permutation Patterns 2016 - https://doi.org/10.23638/DMTCS-19-2-13
Pattern Avoidance for Random PermutationsArticle

Authors: Harry Crane ; Stephen DeSalvo

    Using techniques from Poisson approximation, we prove explicit error bounds on the number of permutations that avoid any pattern. Most generally, we bound the total variation distance between the joint distribution of pattern occurrences and a corresponding joint distribution of independent Bernoulli random variables, which as a corollary yields a Poisson approximation for the distribution of the number of occurrences of any pattern. We also investigate occurrences of consecutive patterns in random Mallows permutations, of which uniform random permutations are a special case. These bounds allow us to estimate the probability that a pattern occurs any number of times and, in particular, the probability that a random permutation avoids a given pattern.

    Volume: Vol. 19 no. 2, Permutation Patterns 2016
    Section: Permutation Patterns
    Published on: December 4, 2018
    Accepted on: August 3, 2018
    Submitted on: March 22, 2017
    Keywords: Mathematics - Combinatorics,Mathematics - Probability,05A05, 05A15, 05A16, 60C05
      Source : OpenAIRE Graph
    • CAREER: Probabilistic Foundations, Statistical Inference, and Invariance Principles for Evolving Combinatorial Structures; Funder: National Science Foundation; Code: 1554092

    Consultation statistics

    This page has been seen 400 times.
    This article's PDF has been downloaded 314 times.