A combinatorial approach for discrete car parking on random labelled trees

DOI10.1016/j.jcta.2020.105233zbMath1435.05180OpenAlexW3006365036MaRDI QIDQ2306005

Alois Panholzer

Publication date: 20 March 2020

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2020.105233

zbMATH Keywords

random treesdimer modelrandom sequential adsorptionblocking modellimiting distribution resultsRenyi's car parking

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

Surprising identities for the greedy independent set on Cayley trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parking functions for mappings
• A bijective enumeration of labeled trees with given indegree sequence
• Random sequential adsorption on random trees
• The Page-Rényi parking process
• Parking on a random tree
• Bijections for Cayley trees, spanning trees, and their q-analogues
• On convergence rates in the central limit theorems for combinatorial structures
• Exact and approximate results for deposition and annihilation processes on graphs
• Random unfriendly seating arrangement in a dining table
• Discrete Spacings

This page was built for publication: A combinatorial approach for discrete car parking on random labelled trees