Pith. sign in

REVIEW 1 cited by

Stochastic Completeness of Graphs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 0712.1570 v2 pith:6EL4ZI4Q submitted 2007-12-10 math.SP math.DG

classification math.SPmath.DG
keywords graphscompletenessstochasticboundlaplacianlowerspectrumanalyze
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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 essential spectrum.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. The generalized porous medium equation on graphs: well-posedness, extinction, and mass conservation

    math.AP 2026-07 conditional novelty 7.0 of 10

    On infinite weighted graphs, porous-medium solutions extinguish in finite time in the fast-diffusion range m < 2/ν, smooth into every ℓ^q for m > 2/ν, and satisfy an exact mass balance under stochastic completeness at...

Pith tools