arXiv Analytics

Sign in

arXiv:1812.00726 [math.PR]AbstractReferencesReviewsResources

Averaging Principle and Shape Theorem for a Growth Model with Memory

Amir Dembo, Pablo Groisman, Ruojun Huang, Vladas Sidoravicius

Published 2018-12-03Version 1

We present a general approach to study a class of random growth models in $n$-dimensional Euclidean space. These models are designed to capture basic growth features which are expected to manifest at the mesoscopic level for several classical self-interacting processes originally defined at the microscopic scale. It includes once-reinforced random walk with strong reinforcement, origin-excited random walk, and few others, for which the set of visited vertices is expected to form a "limiting shape". We prove an averaging principle that leads to such shape theorem. The limiting shape can be computed in terms of the invariant measure of an associated Markov chain.

Related articles: Most relevant | Search more
arXiv:1804.05716 [math.PR] (Published 2018-04-16)
Random growth models: shape and convergence rate
arXiv:1003.0881 [math.PR] (Published 2010-03-03, updated 2010-03-13)
Random Growth Models
arXiv:math/0505039 [math.PR] (Published 2005-05-02, updated 2006-02-28)
Random growth models with polygonal shapes