Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Journal of Theoretic...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Journal of Theoretical Probability
Article . 1991 . Peer-reviewed
License: Springer TDM
Data sources: Crossref
versions View all 1 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

The martin boundary for general isotropic random walks in a tree

Authors: Stanley Sawyer; Donald I. Cartwright;

The martin boundary for general isotropic random walks in a tree

Abstract

LetT=T a+1 be a homogeneous tree of degreea+1. Anisotropic random walk onT is a Markov chain{X n } such thatp(x,y)=A d =P[X n+1=y|X n=x] depends only on the number of edgesd=d(x,y) betweenx andy. Assuming only thatA d>0 for some oddd, the Martin boundary is characterized, and it is proven that nonnegativep-harmonic functions onT are the same as nearest-neighbor harmonic functions, i.e.,u(x)=∑ y∈T p(x,y)u(y) for allx ∈ T if and only ifu(x)=∑ d(x,y)=1 u(y)/(a)+1 for allx ∈ T. Examples are given where the Martin boundary forp is not the same as in the nearest-neighbor case. A non-Abelian renewal theory is developed such that Tauberian conditions onA * =P[d(X 1,x)=d|X]0=x] guarantee the equivalence of the Martin boundary. For example, the Martin boundary and Martin kernel are the same forp as for nearest-neighbor random walk if ∑dA * <∞ or if lim supA d+1 * /A d * <−1. The same techniques show the existence of renewal sequences{u n } such thatf k+1/f k 1 but limu n+1/u n does not exist.

Related Organizations
  • BIP!
    Impact byBIP!
    citations
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    12
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Top 10%
Powered by OpenAIRE graph
Found an issue? Give us feedback
citations
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
12
Average
Top 10%
Top 10%
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!