Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
131 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Upper bounds on the growth rate of Diffusion Limited Aggregation (1705.06095v1)

Published 17 May 2017 in math.PR, math-ph, and math.MP

Abstract: We revisit Kesten's argument for the upper bound on the growth rate of DLA. We are able to make the argument robust enough so that it applies to many graphs, where only control of the heat kernel is required. We apply this to many examples including transitive graphs of polynomial growth, graphs of exponential growth, non-amenable graphs, super-critical percolation on Zd, high dimensional pre-Sierpinski carpets. We also observe that a careful analysis shows that Kesten's original bound on Z3 can be improved from t{2/3} to (t log t){1/2}.

Summary

We haven't generated a summary for this paper yet.