Scaling limits and generic bounds for exploration processes
From MaRDI portal
Publication:683323
DOI10.1007/s10955-017-1902-zzbMath1387.82008arXiv1612.09347OpenAlexW2568364429MaRDI QIDQ683323
Matthieu Jonckheere, Jaron Sanders, Paola Bermolen
Publication date: 6 February 2018
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.09347
Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Related Items
Large deviations of the greedy independent set algorithm on sparse random graphs ⋮ Large Deviation Principle for the Greedy Exploration Algorithm over Erd\"os-R\'enyi Graphs ⋮ Generalized random sequential adsorption on Erdős-Rényi random graphs ⋮ Scaling limits and generic bounds for exploration processes ⋮ Corrected mean-field model for random sequential adsorption on random geometric graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized random sequential adsorption on Erdős-Rényi random graphs
- Scaling limits and generic bounds for exploration processes
- Differential equation approximations for Markov chains
- Strong approximation theorems for density dependent Markov chains
- Connected components in random graphs with given expected degree sequences
- Limit theory for random sequential packing and deposition
- The jamming constant of uniform random graphs
- Komlós-Major-Tusnády approximation under dependence
- A Random Graph Model for Power Law Graphs
- An approximation of partial sums of independent RV's, and the sample DF. II
- An approximation of partial sums of independent RV'-s, and the sample DF. I
- Random Geometric Graphs
- The Average Distance in a Random Graph with Given Expected Degrees
- Random parking, sequential adsorption, and the jamming limit
This page was built for publication: Scaling limits and generic bounds for exploration processes