{"paper":{"title":"Dirichlet forms and stochastic completeness of graphs and subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.FA","authors_text":"Daniel Lenz, Matthias Keller","submitted_at":"2009-04-20T09:24:42Z","abstract_excerpt":"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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.2985","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}