Volume 19, 2015
|Page(s)||236 - 250|
|Published online||01 September 2015|
Asymptotic Properties of Collective-Rearrangement Algorithms
Institute of Stochastics, Ulm University, 89069 Ulm, Germany.
Revised: 26 August 2014
We analyze asymptotic properties of collective-rearrangement algorithms being a class of dense packing algorithms. Traditionally, they transform finite systems of (possibly overlapping) particles into non-overlapping configurations by collective rearrangement of particles in finitely many steps. We consider the convergence of such algorithms for not necessarily finite input data, which means that the configuration of particles in any bounded sampling window remains unchanged after finitely many rearrangement steps. More precisely, we derive sufficient conditions implying the convergence of such algorithms when a stationary process of particles is used as input. We also provide numerical results and present an application in computational materials science.
Mathematics Subject Classification: 60K35 / 60D05 / 82C22
Key words: Asymptotics / force-biased algorithm / collective rearrangement / random sphere-packing / stationary particle system
© EDP Sciences, SMAI 2015
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.