Related papers: Descent-Inversion Statistics in Riffle Shuffles
In this thesis the properties of two kinds of non-uniform random recursive trees are studied. In the first model weights are assigned to each node, thus altering the attachment probabilities. We will call these trees weighted recursive…
Representing distributions over permutations can be a daunting task due to the fact that the number of permutations of $n$ objects scales factorially in $n$. One recent way that has been used to reduce storage complexity has been to exploit…
We investigate the probability of observing a given pattern of $n$ rises and falls in a random stationary data series. The data are modelled as a sequence of $n+1$ independent and identically distributed random numbers. This probabilistic…
There have been multiple attempts to resolve various inflection matching problems in information retrieval. Stemming is a common approach to this end. Among many techniques for stemming, statistical stemming has been shown to be effective…
We introduce a new method for studying murmurations, based on random matrix theory. With this method, we exhibit murmurations or similar phenomena: assuming ratios conjectures, for elliptic curves ordered by height, quadratic twists of a…
We study (asymmetric) $U$-statistics based on a stationary sequence of $m$-dependent variables; moreover, we consider constrained $U$-statistics, where the defining multiple sum only includes terms satisfying some restrictions on the gaps…
In the first part of the paper, we study the inversion statistic of random permutations under the family $(\mathbb{P}_\theta^{(n)})_{\theta \ge 0}$ of Ewens sampling distributions on $S_n$. We obtain a rather simple exact formula for the…
The descent set D(w) of a permutation w of 1,2,...,n is a standard and well-studied statistic. We introduce a new statistic, the connectivity set C(w), and show that it is a kind of dual object to D(w). The duality is stated in terms of the…
Given a permutation statistic $\operatorname{st}$, define its inverse statistic $\operatorname{ist}$ by $\operatorname{ist}(\pi):=\operatorname{st}(\pi^{-1})$. We give a general approach, based on the theory of symmetric functions, for…
Consider a permutation $\sigma\in S_n$ as a deck of cards numbered from 1 to $n$ and laid out in a row, where $\sigma_j$ denotes the number of the card that is in the $j$-th position from the left.\rm\ We define two cyclic to random…
We introduce and study new refinements of inversion statistics for permutations, such as k-step inversions, (the number of inversions with fixed position differences) and non-inversion sums (the sum of the differences of positions of the…
A Gilbert-Shannon-Reeds (GSR) shuffle is performed on a deck of $N$ cards by cutting the top $n\sim Bin(N,1/2)$ cards and interleaving the two resulting piles uniformly at random. The celebrated "Seven shuffles suffice" theorem of…
Random Reshuffling (RR) is an algorithm for minimizing finite-sum functions that utilizes iterative gradient descent steps in conjunction with data reshuffling. Often contrasted with its sibling Stochastic Gradient Descent (SGD), RR is…
Let $\mathcal{SS}_k(n)$ be the family of {\it shuffle squares} in $[k]^{2n}$, words that can be partitioned into two disjoint identical subsequences. Let $\mathcal{RSS}_k(n)$ be the family of {\it reverse shuffle squares} in $[k]^{2n}$,…
In this note, convergence of random variables will be revisited. We will give the answers to 5 questions among the 6 open questions introduced in (Convergence rates in the law of large numbers and new kinds of convergence of random…
We study how the order of N independent random walks in one dimension evolves with time. Our focus is statistical properties of the inversion number m, defined as the number of pairs that are out of sort with respect to the initial…
In this article pattern statistics of typical cubical cut and project sets are studied. We give estimates for the rate of convergence of appearances of patches to their asymptotic frequencies. We also give bounds for repetitivity and…
Define a permutation to be any sequence of distinct positive integers. Given two permutations p and s on disjoint underlying sets, we denote by p sh s the set of shuffles of p and s (the set of all permutations obtained by interleaving the…
We prove some general results about the asymptotics of the distribution of the number of cycles of given length of a random permutation whose distribution is invariant under conjugation. These results were first established to be applied in…
Long-range correlations are found in symbolic sequences from human language, music and DNA. Determining the span of correlations in dolphin whistle sequences is crucial for shedding light on their communicative complexity. Dolphin whistles…