{"paper":{"title":"Stochastic Completeness of Graphs","license":"","headline":"","cross_cats":["math.DG"],"primary_cat":"math.SP","authors_text":"Radoslaw K. Wojciechowski","submitted_at":"2007-12-10T19:14:08Z","abstract_excerpt":"In this thesis, we analyze the stochastic completeness of a heat kernel on graphs which is a function of three variables: a pair of vertices and a continuous time, for infinite, locally finite, connected graphs. For general graphs, a sufficient condition for stochastic completeness is given in terms of the maximum valence on spheres about a fixed vertex. That this result is optimal is shown by studying a particular family of trees. We also prove a lower bound on the bottom of the spectrum for the discrete Laplacian and use this lower bound to show that in certain cases the Laplacian has empty "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0712.1570","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0712.1570/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"}