Computing Norms of Group-Invariant Transition Operators-Reference-Cited by-同舟云学术

Computing Norms of Group-Invariant Transition Operators

Published:1996-06 Issue:2 Volume:5 Page:161-178
ISSN:0963-5483
Container-title:Combinatorics, Probability and Computing
language:en
Short-container-title:Combinator. Probab. Comp.

Author:

Saloff-Coste Laurent,Woess Wolfgang

Abstract

We consider transition operators P on a countable set, which are reversible, irreducible and invariant under a group G of permutations of X with compact point stabilizers. We relate the computation of the spectral radius (norm) of P with the spectral radii of certain matrices defined over the factor set G\X. In various cases, this allows easy computation of the norm of P.

Publisher

Cambridge University Press (CUP)

Subject

Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science

Reference20 articles.

1. The spectral radius of the Galois covering of a finite graph

2. On locally compact groups with invariant means

3. On the relation between amenability of locally compact groups and the norms of convolution operators

4. The fundamental group and the spectrum of the laplacian

5. Rough isometries, and combinatorial approximations of geometries of non ∙ compact riemannian manifolds

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Return probabilities on nonunimodular transitive graphs;Electronic Journal of Probability;2022-01-01

2. Phase transitions on nonamenable graphs;Journal of Mathematical Physics;2000-03

3. Transition operators, groups, norms, and spectral radii;Pacific Journal of Mathematics;1997-10-01