arXiv (All)
open access
Flow decomposition and stochastic completeness of weighted graphs
We give a new proof by flow decomposition of the known Grigor'yan type integral criterion for stochastic completeness of weighted graphs. The main ingredient is a finite-domain estimate relating the mass of a killed $1$-resolvent and the current reaching the boundary to relative capacities of intrin
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Stability of compensator integrals and nonlinear operators under canonical p-th power variation convergence#1049833
- Central Limit Theorems for Drift and Entropy of Random Walks on Free Products#1104899
- Tightness Analysis of First Passage Times of $d$-Dimensional Branching Random Walk#128311
- Complex paths for real stochastic processes#1014662
- Large deviations for reducible Markov chains#364128
Record · ID 1062040
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive