Corrected mean-field model for random sequential adsorption on random geometric graphs
From MaRDI portal
Publication:1756547
DOI10.1007/s10955-018-2019-8zbMath1402.05191arXiv1611.05019OpenAlexW3104615795WikidataQ60123398 ScholiaQ60123398MaRDI QIDQ1756547
Souvik Dhara, Debankur Mukherjee, Johan S. H. van Leeuwaarden
Publication date: 21 December 2018
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.05019
functional limit theoremsrandom geometric graphmean-field analysisrandom sequential adsorptionjamming fraction
Geometric probability and stochastic geometry (60D05) Random graphs (graph-theoretic aspects) (05C80) Equilibrium statistical mechanics (82B99)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- High-dimensional random geometric graphs and their clique number
- Generalized random sequential adsorption on Erdős-Rényi random graphs
- Scaling limits and generic bounds for exploration processes
- Moderate deviations for some point measures in geometric probability
- On analytical approaches to epidemics on networks
- Martingale proofs of many-server heavy-traffic limits for Markovian queues
- Mesoscopic scales in hierarchical configuration models
- Gaussian limits for random measures in geometric probability
- Gaussian fields and random packing
- Limit theory for random sequential packing and deposition
- A network with tunable clustering, degree correlation and degree distribution, and an epidemic thereon
- Moderate deviations for stabilizing functionals in geometric probability
- The jamming constant of uniform random graphs
- Large deviations for functionals of spatial point processes with applications to random packing and spatial graphs
- Gaussian limits for multidimensional random sequential packing at saturation
- Stochastic-Process Limits
- How Clustering Affects Epidemics in Random Networks
- Random Geometric Graphs
- The Greedy Independent Set in a Random Graph with Given Degrees
- Semidefinite Code Bounds Based on Quadruple Distances
- Improved Semidefinite Programming Bound on Sizes of Codes
- Networks
- Random parking, sequential adsorption, and the jamming limit
- Random heterogeneous materials. Microstructure and macroscopic properties
