Search

An edge flipping is a non-reversible Markov chain on a given connected graph, as defined in Chung and Graham (2012). In the same paper, edge flipping eigenvalues and stationary distributions for some classes of graphs were identified. We further study edge flipping spectral properties to show a lower bound for the rate of convergence in the case of regular graphs. Moreover, we show by a coupling argument that a cutoff occurs at $\frac{1}{4} n \log n$ for the edge flipping on the complete graph. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to study a statistic that is used to compare the similarity between two strings, which is first introduced by Michael Steele in 1982. It was proposed as an alternative to the length of the longest common subsequences, for which the variance problem is still open. Our results include moment asymptotics and distributional asymptotics for Steele's statistic and a variation of it in random words. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to answer a question of Fulman on the asymptotic normality of the number of inversions in riffle shuffles. We will also study asymptotics for the number of descents and the length of the longest alternating subsequences in the same shuffling scheme. [ABSTRACT FROM AUTHOR]

We obtain an explicit formula for the variance of the number of k-peaks in a uniformly random permutation. This is then used to obtain an asymptotic formula for the variance of the length of longest k-alternating subsequence in random permutations. Also a central limit is proved for the latter statistic. [ABSTRACT FROM AUTHOR]