Amenability, unimodularity, and the spectral radius of random walks on infinite graphs (Q908466)

From MaRDI portal





scientific article; zbMATH DE number 4134774
Language Label Description Also known as
default for all languages
No label defined
    English
    Amenability, unimodularity, and the spectral radius of random walks on infinite graphs
    scientific article; zbMATH DE number 4134774

      Statements

      Amenability, unimodularity, and the spectral radius of random walks on infinite graphs (English)
      0 references
      0 references
      0 references
      1990
      0 references
      Consider a locally finite, infinite connected graph \(G\) and a vertex-transitive group \(\Gamma\) of automorphisms of \(G\), closed with respect to pointwise convergence. The transition operator \(\mathcal P\) of the simple random walk on \(G\) has norm (spectral radius) \(\| \mathcal P\| =1\) if and only if \(\Gamma\) is both amenable and unimodular. If \(G\) has more than two ends, then \(\| \mathcal P\| <1\). If \(\Gamma\) is amenable then an explicit formula for \(\| \mathcal P\|\) is available even for more general transition operators. This allows, for example, easy calculation of the norm of radial transition operators on a homogeneous tree.
      0 references
      vertex-transitive group of automorphisms
      0 references
      locally finite, infinite connected graph
      0 references
      simple random walk
      0 references
      spectral radius
      0 references
      amenable
      0 references
      unimodular
      0 references
      norm
      0 references
      radial transition operators
      0 references
      homogeneous tree
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references