Parking on a random tree

DOI10.1007/S10955-008-9589-9MaRDI QIDQ960168zbMATH OpenOpenAlexFDO

Authors S. R. Fleurke, Christof Külske, Herold Dehling

Publication date 16 December 2008

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

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

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

zbMATH Keywords

car parking problemparticle systemsrandom sequential adsorptionrandom tree

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Dynamics of random walks, random surfaces, lattice animals, etc. in time-dependent statistical mechanics (82C41)

Abstract: Consider an infinite tree with random degrees, i.i.d. over the sites, with a prescribed probability distribution with generating function G(s). We consider the following variation of Renyi's parking problem, alternatively called blocking RSA: at every vertex of the tree a particle (or car) arrives with rate one. The particle sticks to the vertex whenever the vertex and all of its nearest neighbors are not occupied yet. We provide an explicit expression for the so-called parking constant in terms of the generating function.

Recommendations

• Parking on a random rooted plane tree
• Sharpness of the phase transition for parking on random trees
• A combinatorial approach for discrete car parking on random labelled trees
• Parking on a random tree
• scientific article; zbMATH DE number 7643620

Cites work

• Blocking and dimer processes on the Cayley tree
• Distances in random graphs with finite mean and infinite variance degrees
• Exact and approximate results for deposition and annihilation processes on graphs
• scientific article; zbMATH DE number 3171475 (Why is no real title available?)
• scientific article; zbMATH DE number 1866312 (Why is no real title available?)
• scientific article; zbMATH DE number 3892344 (Why is no real title available?)

Cited in

(14)

• Parking on a random rooted plane tree
• A combinatorial approach for discrete car parking on random labelled trees
• Parking on transitive unimodular graphs
• Per-site occupancy in the discrete parking problem
• Parking on supercritical Galton-Watson trees
• Generalized random sequential adsorption on Erdős-Rényi random graphs
• Degree-dependent threshold-based random sequential adsorption on random trees
• Parking on a random tree
• scientific article; zbMATH DE number 7643620 (Why is no real title available?)
• Sharpness of the phase transition for parking on random trees
• Greedy maximal independent sets via local limits
• Random sequential adsorption on random trees
• A second-row parking paradox
• Multilayer parking with screening on a random tree

This page was built for publication: Parking on a random tree

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