Intersection conductance and canonical alternating paths, methods for general finite Markov chains

Details Intersection conductance and canonical alternating paths, methods for general finite Markov chains Intersection conductance and canonical alternating paths, methods for general finite Markov chains

2006-11-19

arxiv.org/abs/math/0611585v4

Mathematics

Combinatorics

18 pages

Scientific paper

We extend the conductance and canonical paths methods to the setting of
general finite Markov chains, including non-reversible non-lazy walks. The new
path method is used to show that a known bound for mixing time of a lazy walk
on a Cayley graph with symmetric generating set also applies to the non-lazy
non-symmetric case, often even when there is no holding probability.

Affiliated with

Also associated with

No associations

Rating

Intersection conductance and canonical alternating paths, methods for general finite Markov chains does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Intersection conductance and canonical alternating paths, methods for general finite Markov chains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Intersection conductance and canonical alternating paths, methods for general finite Markov chains will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-120697