The combinatorics of random walk with absorbing barriers
From MaRDI portal
Publication:1240974
DOI10.1016/0012-365X(77)90019-XzbMATH Open0364.60105MaRDI QIDQ1240974FDOQ1240974
Authors: C. J. Everett, Paul R. Stein
Publication date: 1977
Published in: Discrete Mathematics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two element lattice permutation numbers and their \(q\)-generalization
- Some remarks on ballot-type sequences of positive integers
Cited In (6)
- Exact two-point resistance, and the simple random walk on the complete graph minus \(N\) edges
- Intersection numbers on Grassmannians, and on the space of holomorphic maps from \(\mathbb{C} P^1\) into \(G_r(\mathbb{C}^n)\)
- Graph evolution by stochastic additions of points and lines
- The number of minimal lattice paths restricted by two parallel lines
- A note on random walks with absorbing barriers and sequential Monte Carlo methods
- Moments of Absorption Time for a Conditioned Random Walk
This page was built for publication: The combinatorics of random walk with absorbing barriers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1240974)