Volume growth and stochastic completeness of graphs

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Given the variable-speed random walk on a weighted graph and a metric adapted to the structure of the random walk, we construct a Brownian motion on a closely related metric graph which behaves similarly to the VSRW and for which the associated intrinsic metric has certain desirable properties. Jump probabilities and moments of jump times for Brownian motion on metric graphs with varying edge lengths, jump conductances, and edge densities are computed. We use these results together with a theorem of Sturm for stochastic completeness, or non-explosiveness, on local Dirichlet spaces to prove sharp volume growth criteria in adapted metrics for stochastic completeness of graphs.

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

Volume growth and stochastic completeness of 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 Volume growth and stochastic completeness of graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Volume growth and stochastic completeness of graphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-257075

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