Random walk generated by random permutations of {1,2,3, ..., n+1}

We study properties of a non-Markovian random walk $X^{(n)}_l$, $l =0,1,2, >...,n$, evolving in discrete time $l$ on a one-dimensional lattice of integers, whose moves to the right or to the left are prescribed by the \text{rise-and-descent} sequences characterizing random permutations $\pi$ of $[n+1] = \{1,2,3, ...,n+1\}$. We determine exactly the probability of finding the end-point $X_n = X^{(n)}_n$ of the trajectory of such a permutation-generated random walk (PGRW) at site $X$, and show that in the limit $n \to \infty$ it converges to a normal distribution with a smaller, compared to the conventional P\'olya random walk, diffusion coefficient. We formulate, as well, an auxiliary stochastic process whose distribution is identic to the distribution of the intermediate points $X^{(n)}_l$, $l < n$, which enables us to obtain the probability measure of different excursions and to define the asymptotic distribution of the number of "turns" of the PGRW trajectories.Comment: text shortened, new results added, appearing in J. Phys.

Asymptotics of characters of symmetric groups, genus expansion and free probability

The convolution of indicators of two conjugacy classes on the symmetric group S_q is usually a complicated linear combination of indicators of many conjugacy classes. Similarly, a product of the moments of the Jucys--Murphy element involves many conjugacy classes with complicated coefficients. In this article we consider a combinatorial setup which allows us to manipulate such products easily: to each conjugacy class we associate a two-dimensional surface and the asymptotic properties of the conjugacy class depend only on the genus of the resulting surface. This construction closely resembles the genus expansion from the random matrix theory. As the main application we study irreducible representations of symmetric groups S_q for large q. We find the asymptotic behavior of characters when the corresponding Young diagram rescaled by a factor q^{-1/2} converge to a prescribed shape. The character formula (known as the Kerov polynomial) can be viewed as a power series, the terms of which correspond to two-dimensional surfaces with prescribed genus and we compute explicitly the first two terms, thus we prove a conjecture of Biane.Comment: version 2: change of title; the section on Gaussian fluctuations was moved to a subsequent paper [Piotr Sniady: "Gaussian fluctuations of characters of symmetric groups and of Young diagrams" math.CO/0501112

Grid classes and the Fibonacci dichotomy for restricted permutations

We introduce and characterise grid classes, which are natural generalisations of other well-studied permutation classes. This characterisation allows us to give a new, short proof of the Fibonacci dichotomy: the number of permutations of length n in a permutation class is either at least as large as the nth Fibonacci number or is eventually polynomial