Every k entries in a permutation can have one of k! different relative orders, called patterns. How many times does each pattern occur in a large random permutation? The distribution of this vector of pattern densities was studied by Janson, Nakamura, and Zeilberger (2015). We use representations of the symmetric group, and the theory of U-statistics to further analyze this distribution. The talk will include some relevant background on these tools, and applications to nonparametric statistics.
Mon, 26/03/2018 - 11:00 to 12:30
IIAS, room 130, Feldman Building, Givat Ram