Dirichlet forms and stochastic completeness of graphs and subgraphs

Mathematics – Functional Analysis

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

27 pages

Scientific paper

We study Laplacians on graphs and networks via regular Dirichlet forms. We give a sufficient geometric condition for essential selfadjointness and explicitly determine the generators of the associated semigroups on all $\ell^p$, $1\leq p < \infty$, in this case. We characterize stochastic completeness thereby generalizing all earlier corresponding results for graph Laplacians. Finally, we study how stochastic completeness of a subgraph is related to stochastic completeness of the whole graph.

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

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

Rate now

     

Profile ID: LFWR-SCP-O-173929

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