Fourier Analysis on Groups, Random Walks and Markov Chains

Kenneth W. Johnson

Research output: Chapter in Book/Report/Conference proceedingChapter


In Chap. 1 it is explained that if p is a probability on a finite group G the group matrix XG(p) is a transition matrix for a random walk on G. If f is an arbitrary function on G the process of transforming XG(f) into a block diagonal matrix is equivalent to the obtaining the Fourier transform of f. This chapter explains the connections with harmonic analysis and the group matrix. Most of the discussion is on probability theory and random walks. The fusion of characters discussed in Chap. 4 becomes relevant, and also the idea of fission of characters is introduced, especially those fissions which preserve diaonalizability of the corresponding group matrix. As an example of how the group matrix and group determinant can be used as tools, their application to random walks which become uniform after a finite number of steps is examined.

Original languageEnglish (US)
Title of host publicationLecture Notes in Mathematics
PublisherSpringer Verlag
Number of pages40
StatePublished - 2019

Publication series

NameLecture Notes in Mathematics
ISSN (Print)0075-8434
ISSN (Electronic)1617-9692

All Science Journal Classification (ASJC) codes

  • Algebra and Number Theory


Dive into the research topics of 'Fourier Analysis on Groups, Random Walks and Markov Chains'. Together they form a unique fingerprint.

Cite this