A central limit theorem for a new statistic on permutations

DOI10.1007/s13226-017-0246-3zbMath1390.60082arXiv1608.01666OpenAlexW2963790315MaRDI QIDQ1745671

Sourav Chatterjee, Persi Diaconis

Publication date: 18 April 2018

Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.01666

zbMATH Keywords

Stein's methoddescentsmetrics on permutations

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Permutations, words, matrices (05A05)

Related Items

Optimizing the JSM Program, A central limit theorem for descents of a Mallows permutation and its inverse, Martingales and descent statistics, Modified log-Sobolev inequalities and two-level concentration, On the central limit theorem for the two-sided descent statistics in Coxeter groups, Asymptotics of a locally dependent statistic on finite reflection groups, Natural quasirandomness properties, Distribution of descents in matchings, An Ising model having permutation spin motivated by a permutation complexity measure, Homomesies on permutations: An analysis of maps and statistics in the FindStat database, A natural idempotent in the descent algebra of a finite Coxeter group, Central limit theorem for descents in conjugacy classes of \(S_n\), An asymptotic distribution theory for Eulerian recurrences with applications, Counting inversions and descents of random elements in finite Coxeter groups, A central limit theorem for the two-sided descent statistic on Coxeter groups, Diophantine problems and \(p\)-adic period mappings, Arcsine laws for random walks generated from random permutations with applications to genomics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumeration of permutations by descents, idescents, imajor index, and basic components
• A new method of normal approximation
• Metric methods for analyzing partially ranked data
• Permutation statistics and partitions
• Descent identities, Hessenberg varieties, and the Weil conjectures
• Probabilistic bounds on the coefficients of polynomials with only real zeros
• Normal approximation under local dependence.
• Central and local limit theorems applied to asymptotic enumeration
• Two-Sided Eulerian Numbers via Balls in Boxes
• The number of readings of non-equiprobable files under stable sorting
• On adding a list of numbers (and other one-dependent determinantal processes)
• Random Multiplicative Functions in Short Intervals
• Eulerian Numbers and Polynomials
• Estimating Serial Correlation by Visual Inspection of Diagnostic Plots
• Permutations and sequences with repetitions by number of increases
• Limit theorems for the number of ascending segments in random permutations generated by sorting algorithms
• Peaks and Eulerian numbers in a random sequence
• The numbers of ascending segments in a random permutation and in the inverse to it are asymptotically independent
• Eulerian Numbers
• Stirling Behavior is Asymptotically Normal