Martin capacity for Markov chains
From MaRDI portal
Abstract: The probability that a transient Markov chain, or a Brownian path, will ever visit a given set Lambda, is classically estimated using the capacity of Lambda with respect to the Green kernel G(x,y). We show that replacing the Green kernel by the Martin kernel G(x,y)/G(0,y) yields improved estimates, which are exact up to a factor of 2. These estimates are applied to random walks on lattices, and also to explain a connection found by R. Lyons between capacity and percolation on trees.
Recommendations
- scientific article; zbMATH DE number 2210795
- scientific article; zbMATH DE number 1342044
- On (r,p)-capacities for Markov processes
- scientific article; zbMATH DE number 4050689
- On Choquet's dichotomy of capacity for Markov processes
- Martin boundaries for discrete Markov chains
- Markov properties of multiparameter processes and capacities
Cited in
(19)- scientific article; zbMATH DE number 2210795 (Why is no real title available?)
- The dimension of the range of a transient random walk
- Hitting estimates on Einstein manifolds and applications
- Brownian sheet images and Bessel-Riesz capacity
- What is the probability of intersecting the set of Brownian double points?
- Variational formula of capacity for asymmetric Markov chains
- Logarithmic corrections to scaling in the four-dimensional uniform spanning tree
- Nodal geometry, heat diffusion and Brownian motion
- The rencontre problem
- Random walks in varying dimensions
- scientific article; zbMATH DE number 912985 (Why is no real title available?)
- Patterns in random walks and Brownian motion
- The scaling limit of loop-erased random walk in three dimensions
- Brownian motion and thermal capacity
- Intersection-equivalence of Brownian paths and certain branching processes
- Brownian motion with variable drift: 0-1 laws, hitting probabilities and Hausdorff dimension
- Ergodic properties of boundary actions and the Nielsen-Schreier theory
- Arbitrary many Walkers meet infinitely often in a subballistic random environment
- Dynamical percolation on general trees
This page was built for publication: Martin capacity for Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1902955)