Add to ORKGAbstract. Random walk on the irreducible representations of the symmetric and general linear groups is studied. A separation distance cutoff is proved and the exact separation distance asymptotics are determined. A key tool is a method for writing the multiplicities in the Kronecker tensor powers of a fixed representation as a sum of non-negative terms. Connections are made with the Lagrange-Sylvester interpolation approach to Markov chains
The unifying objective of this thesis is to find the mixing time of the Markov chain on Sn formed by...
The unifying objective of this thesis is to find the mixing time of the Markov chain on $S_n$ formed...
38 pagesInternational audienceConsider $K\geq2$ independent copies of the random walk on the symmetr...
Abstract. We consider a class of random walks introduced by Gessel and Zeilberger for which the refl...
with random walk on a distance-regular graph, which roughly corresponds to nearest-neighbor isotropi...
International audienceIn operator algebra, the linearization trick is a technique that reduces the s...
The classical theory of Random Walks describes the asymptotic behavior of sums of independent identi...
Of central interest in the study of random walks on finite groups are ergodic random walks. Ergodic ...
We use Kashiwara crystal basis theory to associate a random walk W to each irreducible representatio...
This thesis presents two applications of representation theory of locally compact groups. The first...
AbstractThe notions of recurrence time, range, and the limit of probabilities Pk of return to the or...
Let H be a finite group and µ a probability measure on H. This data determines an invariant random w...
We prove a quantitative equidistribution result for linear random walks on the torus, similar to a t...
Let be a finite Weyl group and the corresponding affine Weyl group. A random element of can be ob...
Linear bounds are obtained for the displacement of a random walk in a dynamic random environment giv...
The unifying objective of this thesis is to find the mixing time of the Markov chain on Sn formed by...
The unifying objective of this thesis is to find the mixing time of the Markov chain on $S_n$ formed...
38 pagesInternational audienceConsider $K\geq2$ independent copies of the random walk on the symmetr...
Abstract. We consider a class of random walks introduced by Gessel and Zeilberger for which the refl...
with random walk on a distance-regular graph, which roughly corresponds to nearest-neighbor isotropi...
International audienceIn operator algebra, the linearization trick is a technique that reduces the s...
The classical theory of Random Walks describes the asymptotic behavior of sums of independent identi...
Of central interest in the study of random walks on finite groups are ergodic random walks. Ergodic ...
We use Kashiwara crystal basis theory to associate a random walk W to each irreducible representatio...
This thesis presents two applications of representation theory of locally compact groups. The first...
AbstractThe notions of recurrence time, range, and the limit of probabilities Pk of return to the or...
Let H be a finite group and µ a probability measure on H. This data determines an invariant random w...
We prove a quantitative equidistribution result for linear random walks on the torus, similar to a t...
Let be a finite Weyl group and the corresponding affine Weyl group. A random element of can be ob...
Linear bounds are obtained for the displacement of a random walk in a dynamic random environment giv...
The unifying objective of this thesis is to find the mixing time of the Markov chain on Sn formed by...
The unifying objective of this thesis is to find the mixing time of the Markov chain on $S_n$ formed...
38 pagesInternational audienceConsider $K\geq2$ independent copies of the random walk on the symmetr...