We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure [email protected]
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Internal diffusion-limited aggregation (IDLA) is a stochastic growth model on a graph G which describes the formation of a random set of vertices growing from the origin (some fixed vertex) of G. Particles start at the origin and perform simple random walks; each particle moves until it lands on a site which was not previously visited by other particles. This random set of occupied sites in G is called the IDLA cluster. In this paper we consider IDLA on Sierpinski gasket graphs, and show that the IDLA cluster fills balls (in the graphmetric) with probability 1.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.