Papers
Topics
Authors
Recent
Search
2000 character limit reached

Square permutations are typically rectangular

Published 5 Apr 2019 in math.PR and math.CO | (1904.03080v3)

Abstract: We describe the limit (for two topologies) of large uniform random square permutations, i.e., permutations where every point is a record. The starting point for all our results is a sampling procedure for asymptotically uniform square permutations. Building on that, we first describe the global behavior by showing that these permutations have a permuton limit which can be described by a random rectangle. We also explore fluctuations about this random rectangle, which we can describe through coupled Brownian motions. Second, we consider the limiting behavior of the neighborhood of a point in the permutation through local limits. As a byproduct, we also determine the random limits of the proportion of occurrences (and consecutive occurrences) of any given pattern in a uniform random square permutation.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.