Corrected mean-field model for random sequential adsorption on random geometric graphs

DOI10.1007/S10955-018-2019-8zbMATH Open1402.05191arXiv1611.05019OpenAlexW3104615795WikidataQ60123398 ScholiaQ60123398MaRDI QIDQ1756547FDOQ1756547

Authors: Souvik Dhara, Johan S. H. van Leeuwaarden, Debankur Mukherjee 

Publication date: 21 December 2018

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Abstract: A notorious problem in mathematics and physics is to create a solvable model for random sequential adsorption of non-overlapping congruent spheres in the $d$-dimensional Euclidean space with $dgeq2$. Spheres arrive sequentially at uniformly chosen locations in space and are accepted only when there is no overlap with previously deposited spheres. Due to spatial correlations, characterizing the fraction of accepted spheres remains largely intractable. We study this fraction by taking a novel approach that compares random sequential adsorption in Euclidean space to the nearest-neighbor blocking on a sequence of clustered random graphs. This random network model can be thought of as a corrected mean-field model for the interaction graph between the attempted spheres. Using functional limit theorems, we characterize the fraction of accepted spheres and its fluctuations.

Full work available at URL: https://arxiv.org/abs/1611.05019

Recommendations

• Generalized random sequential adsorption on Erdős-Rényi random graphs
• Random Sequential Adsorption on Graphs
• Random sequential adsorption on random trees
• Limit theory for random sequential packing and deposition
• Gaussian limits for multidimensional random sequential packing at saturation

zbMATH Keywords

random geometric graphfunctional limit theoremsmean-field analysisrandom sequential adsorptionjamming fraction

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Geometric probability and stochastic geometry (60D05) Equilibrium statistical mechanics (82B99)

Cites Work

• Random Geometric Graphs
• Random heterogeneous materials. Microstructure and macroscopic properties
• Networks. An introduction.
• Title not available (Why is that?)
• Stochastic-Process Limits
• Title not available (Why is that?)
• Title not available (Why is that?)
• Gaussian limits for random measures in geometric probability
• Random parking, sequential adsorption, and the jamming limit
• On analytical approaches to epidemics on networks
• Martingale proofs of many-server heavy-traffic limits for Markovian queues
• Semidefinite Code Bounds Based on Quadruple Distances
• A network with tunable clustering, degree correlation and degree distribution, and an epidemic thereon
• Moderate deviations for stabilizing functionals in geometric probability
• Limit theory for random sequential packing and deposition
• Gaussian limits for multidimensional random sequential packing at saturation
• Moderate deviations for some point measures in geometric probability
• Improved Semidefinite Programming Bound on Sizes of Codes
• How Clustering Affects Epidemics in Random Networks
• High-dimensional random geometric graphs and their clique number
• The jamming constant of uniform random graphs
• The greedy independent set in a random graph with given degrees
• Generalized random sequential adsorption on Erdős-Rényi random graphs
• Scaling limits and generic bounds for exploration processes
• Gaussian fields and random packing
• Large deviations for functionals of spatial point processes with applications to random packing and spatial graphs
• Mesoscopic scales in hierarchical configuration models

Cited In (2)

• Density and correlation in a random sequential adsorption model
• Degree-dependent threshold-based random sequential adsorption on random trees

This page was built for publication: Corrected mean-field model for random sequential adsorption on random geometric graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1756547)