Dynamic Space Packing

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Dandekar, Rahul, Krapivsky, P. L.
Format: Preprint
Veröffentlicht: 2023
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866916385170391040
author Dandekar, Rahul
Krapivsky, P. L.
author_facet Dandekar, Rahul
Krapivsky, P. L.
contents Dynamic space packing (DSP) is a random process with sequential addition and removal of identical objects into space. In the lattice version, objects are particles occupying single lattice sites, and adding a particle to a lattice site leads to the removal of particles on neighboring sites. We show that the model is solvable and determine the steady-state occupancy, correlation functions, desorption probabilities, and other statistical features for the DSP of hyper-cubic lattices. We also solve a continuous DSP of balls into $\mathbb{R}^d$.
format Preprint
id arxiv_https___arxiv_org_abs_2306_14358
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Dynamic Space Packing
Dandekar, Rahul
Krapivsky, P. L.
Statistical Mechanics
Disordered Systems and Neural Networks
Probability
Dynamic space packing (DSP) is a random process with sequential addition and removal of identical objects into space. In the lattice version, objects are particles occupying single lattice sites, and adding a particle to a lattice site leads to the removal of particles on neighboring sites. We show that the model is solvable and determine the steady-state occupancy, correlation functions, desorption probabilities, and other statistical features for the DSP of hyper-cubic lattices. We also solve a continuous DSP of balls into $\mathbb{R}^d$.
title Dynamic Space Packing
topic Statistical Mechanics
Disordered Systems and Neural Networks
Probability
url https://arxiv.org/abs/2306.14358