This thesis presents two applications of representation theory of locally compact groups. The first is concerned with random walks, the second with Mackey's Intertwining Number Theorem. Firstly, we consider the random walk on a collection of chambers bounded by hyperplanes in a given subspace E of Rn+1 . Initially, a particular transition probability is used in the first part of this analysis, and the identification of the collection of chambers with a reflection group provides necessary tools for obtaining a criterion for the recurrence of that walk. Next, the techniques of representation theory are used to deal with the generalization of the random walk when transition probability is considered to be a general probability measur...
The unifying objective of this thesis is to find the mixing time of the Markov chain on Sn formed by...
with random walk on a distance-regular graph, which roughly corresponds to nearest-neighbor isotropi...
Let H be a subgroup of a finite group G. We use Markov chains to quantify how large r should be so t...
This thesis presents two applications of representation theory of locally compact groups. The first...
Abstract. We consider a class of random walks introduced by Gessel and Zeilberger for which the refl...
In Chapter 1, we have given a brief account of measure theory on locally compact groups. We have def...
The book contains extended versions of seven short lecture courses given during a semester programme...
AbstractLet G be a locally compact group. Random walks on G, some factorization problems in L1(G) an...
Abstract. Random walk on the irreducible representations of the symmetric and general linear groups ...
Let G be a locally compact group and μ a probability measure on G. Given a unitary representation μ ...
"Locally compact groups arise in many diverse areas of mathematics, the physical sciences, and engin...
International audienceWe introduce several examples of random walks on noncommutative spaces and stu...
The topic of the thesis is related to statistical mechanics and probability theory from one side, an...
An accessible and panoramic account of the theory of random walks on groups and graphs, stressing th...
In this thesis, we investigate the asymptotics of random partitions chosen according to probability ...
The unifying objective of this thesis is to find the mixing time of the Markov chain on Sn formed by...
with random walk on a distance-regular graph, which roughly corresponds to nearest-neighbor isotropi...
Let H be a subgroup of a finite group G. We use Markov chains to quantify how large r should be so t...
This thesis presents two applications of representation theory of locally compact groups. The first...
Abstract. We consider a class of random walks introduced by Gessel and Zeilberger for which the refl...
In Chapter 1, we have given a brief account of measure theory on locally compact groups. We have def...
The book contains extended versions of seven short lecture courses given during a semester programme...
AbstractLet G be a locally compact group. Random walks on G, some factorization problems in L1(G) an...
Abstract. Random walk on the irreducible representations of the symmetric and general linear groups ...
Let G be a locally compact group and μ a probability measure on G. Given a unitary representation μ ...
"Locally compact groups arise in many diverse areas of mathematics, the physical sciences, and engin...
International audienceWe introduce several examples of random walks on noncommutative spaces and stu...
The topic of the thesis is related to statistical mechanics and probability theory from one side, an...
An accessible and panoramic account of the theory of random walks on groups and graphs, stressing th...
In this thesis, we investigate the asymptotics of random partitions chosen according to probability ...
The unifying objective of this thesis is to find the mixing time of the Markov chain on Sn formed by...
with random walk on a distance-regular graph, which roughly corresponds to nearest-neighbor isotropi...
Let H be a subgroup of a finite group G. We use Markov chains to quantify how large r should be so t...