Parking on a random tree

DOI10.1007/S10955-008-9589-9zbMATH Open1151.82390arXiv0711.4061OpenAlexW2166063893MaRDI QIDQ960168FDOQ960168

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)

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.

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

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

zbMATH Keywords

random treeparticle systemsrandom sequential adsorptioncar parking problem

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Distances in random graphs with finite mean and infinite variance degrees
• Title not available (Why is that?)
• Exact and approximate results for deposition and annihilation processes on graphs
• Blocking and dimer processes on the Cayley tree

Cited In (11)

• Sharpness of the phase transition for parking on random trees
• Multilayer parking with screening on a random tree
• A combinatorial approach for discrete car parking on random labelled trees
• Per-site occupancy in the discrete parking problem
• Greedy maximal independent sets via local limits
• Random sequential adsorption on random trees
• A second-row parking paradox
• Parking on transitive unimodular graphs
• Degree-dependent threshold-based random sequential adsorption on random trees
• Title not available (Why is that?)
• Generalized random sequential adsorption on Erdős-Rényi random graphs

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)