Asymptotic Properties of Collective-Rearrangement Algorithms

DOI10.1051/ps/2014026zbMath1348.60028OpenAlexW2076989220MaRDI QIDQ2786479

Volker Schmidt, Christian Hirsch, Gerd Gaiselmann

Publication date: 12 February 2016

Published in: ESAIM: Probability and Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ps/2014026

zbMATH Keywords

asymptoticsconvergence in distributionpoint processstationary particle systemcollective rearrangement algorithmsforce-biased algorithmrandom sphere-packing

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Central limit and other weak theorems (60F05) Stationary stochastic processes (60G10) Interacting particle systems in time-dependent statistical mechanics (82C22) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Stochastic particle methods (65C35)

Cites Work

• Unnamed Item
• Existence and spatial limit theorems for lattice and continuum particle systems
• Packing random intervals on-line
• Limit theory for random sequential packing and deposition
• Stochastic Modeling of a Glass Fiber Reinforced Polymer
• Packing of Spheres: Packing of Equal Spheres
• Random Geometric Graphs
• An Introduction to the Theory of Point Processes
• SIMULATION AND CHARACTERIZATION OF RANDOM SYSTEMS OF HARD PARTICLES
• Statistical Analysis and Modelling of Spatial Point Patterns
• Limit theorems for monolayer ballistic deposition in the continuum