2004
DOI: 10.1214/ejp.v9-170
|View full text |Cite
|
Sign up to set email alerts
|

An asymptotic expansion for the discrete harmonic potential

Abstract: ABSTRACT. We give two algorithms that allow to get arbitrary precision asymptotics for the harmonic potential of a random walk.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
37
0

Year Published

2010
2010
2020
2020

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 26 publications
(37 citation statements)
references
References 7 publications
0
37
0
Order By: Relevance
“…Moreover, g(z) > 0 for all z = 0. Exact values of g near the origin can be computed using the McCrea-Whipple algorithm, described in [KS04]. In particular,…”
Section: The Discrete Harmonic Function H ζ (Z)mentioning
confidence: 99%
“…Moreover, g(z) > 0 for all z = 0. Exact values of g near the origin can be computed using the McCrea-Whipple algorithm, described in [KS04]. In particular,…”
Section: The Discrete Harmonic Function H ζ (Z)mentioning
confidence: 99%
“…In particular, we would like to know the asymptotic order of the Green function g(x) when x is far from the origin. It turns out [22,36,67] that…”
Section: Laplacian Growth Sandpiles and Scaling Limits 361mentioning
confidence: 99%
“…Proof of (10): The proof is based on an asymptotic expansion of the potential function of the random walk (cf. [3], [12], [7]) from which an application of the reflection principle immediately yields…”
Section: Thus (V) Is Provedmentioning
confidence: 99%