A version with an appendix containing detailed computations is available on arXiv:math.PR/0512391.International audienceConsider the braid group B3 = and the nearest neighbor random walk defined by a probability measure supported by a,b, and inverses. The rate of escape of the walk is explicitly expressed in function of the unique solution of a set of eight polynomial equations of degree three over eight indeterminates. We also explicitly describe the harmonic measure of the induced random walk on B3 quotiented by its center. The method and results apply, mutatis mutandis, to nearest neighbor random walks on dihedral Artin groups
In the book [3], original methods were proposed to determine the invariant measure of random walks i...
with random walk on a distance-regular graph, which roughly corresponds to nearest-neighbor isotropi...
24 pages; 5 figures; v3: version to appear in European J. CombinatoricsInternational audienceWe prov...
We investigate the statistical properties of random walks on the simplest nontrivial braid group B3,...
This paper announces results which have been later developped in three articles: 1. "Random walks on...
International audienceIn operator algebra, the linearization trick is a technique that reduces the s...
An accessible and panoramic account of the theory of random walks on groups and graphs, stressing th...
AbstractSince the braid group was discovered by Artin (1947), the question of its conjugacy problem ...
We consider the symplectic representation $\rho_n$ of a braid group $B(n)$ in $Sp(2l,\mathbb{Z})$, f...
Abstract. The affine group of a homogeneous tree is the group of all its isometries fixing an end of...
Of central interest in the study of random walks on finite groups are ergodic random walks. Ergodic ...
International audienceWe study the discrete quantum groups Gamma whose group algebra has an inner fa...
Analysing statistical properties of the normal forms of random braids, we observe that, except for a...
This monograph aims to promote original mathematical methods to determine the invariant measure of t...
Random walk polynomials and random walk measures play a prominent role in the analysis of a class of...
In the book [3], original methods were proposed to determine the invariant measure of random walks i...
with random walk on a distance-regular graph, which roughly corresponds to nearest-neighbor isotropi...
24 pages; 5 figures; v3: version to appear in European J. CombinatoricsInternational audienceWe prov...
We investigate the statistical properties of random walks on the simplest nontrivial braid group B3,...
This paper announces results which have been later developped in three articles: 1. "Random walks on...
International audienceIn operator algebra, the linearization trick is a technique that reduces the s...
An accessible and panoramic account of the theory of random walks on groups and graphs, stressing th...
AbstractSince the braid group was discovered by Artin (1947), the question of its conjugacy problem ...
We consider the symplectic representation $\rho_n$ of a braid group $B(n)$ in $Sp(2l,\mathbb{Z})$, f...
Abstract. The affine group of a homogeneous tree is the group of all its isometries fixing an end of...
Of central interest in the study of random walks on finite groups are ergodic random walks. Ergodic ...
International audienceWe study the discrete quantum groups Gamma whose group algebra has an inner fa...
Analysing statistical properties of the normal forms of random braids, we observe that, except for a...
This monograph aims to promote original mathematical methods to determine the invariant measure of t...
Random walk polynomials and random walk measures play a prominent role in the analysis of a class of...
In the book [3], original methods were proposed to determine the invariant measure of random walks i...
with random walk on a distance-regular graph, which roughly corresponds to nearest-neighbor isotropi...
24 pages; 5 figures; v3: version to appear in European J. CombinatoricsInternational audienceWe prov...