Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Discrete random walk with barriers on a locally infinite graph

Abstract : We obtain expected number of arrivals, absorption probabilities and expected time before absorption for an asymmetric discrete random walk on a locally infinite graph in the presence of multiple function barriers
Complete list of metadata

https://hal.inria.fr/hal-01048601
Contributor : Theo van Uem <>
Submitted on : Friday, July 25, 2014 - 10:11:12 AM
Last modification on : Wednesday, November 29, 2017 - 10:25:16 AM

Links full text

Identifiers

  • HAL Id : hal-01048601, version 1
  • ARXIV : 0811.3682

Collections

Citation

Theo van Uem. Discrete random walk with barriers on a locally infinite graph. 2008. ⟨hal-01048601⟩

Share

Metrics

Record views

84