Lower bounds for transition probabilities on graphs

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

The paper presents two results. The first one provides separate conditions for the upper and lower estimate of the distribution of the exit time from balls of a random walk on a weighted graph. The main result of the paper is that the lower estimate follows from the elliptic Harnack inequality. The second result is an off-diagonal lower bound for the transition probability of the random walk.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Lower bounds for transition probabilities on graphs 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 Lower bounds for transition probabilities on graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lower bounds for transition probabilities on graphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-156880

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.