Reversible Markov Chains and Random Walks on Graphs 2.10 Move to other chapters 3.1 Introduction

Chapter 3 Reversible Markov Chains (September 10, 2002)

Chapter 2 ^†^†margin: 9/10/99 versionreviewed some aspects of the elementary theory of general finite irreducible Markov chains. In this chapter we specialize to reversible chains, treating the discrete-time and continuous-time cases in parallel. After Section 3.3 we shall assume that we are dealing with reversible chains without continually repeating this assumption, and shall instead explicitly say “general” to mean not necessarily reversible.

3.1 Introduction
3.2 Reversible chains and weighted graphs
3.3 Electrical networks
3.4 The spectral representation
3.5 Complete monotonicity
3.6 Extremal characterizations of eigenvalues
3.7 Extremal characterizations and mean hitting times
3.8 Notes on Chapter 3

2.10 Move to other chapters Bibliography 3.1 Introduction

Generated on Mon Jun 2 14:23:48 2014 by LaTeXML [LOGO]