Per-site occupancy in the discrete parking problem

DOI10.1016/J.SPL.2016.09.019zbMATH Open1416.60019OpenAlexW2530406766MaRDI QIDQ342772FDOQ342772

Authors: V. Shneer, Peter M. van de Ven 

Publication date: 18 November 2016

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/25286

Recommendations

• Saturation in a Markovian parking process
• A second-row parking paradox
• A combinatorial approach for discrete car parking on random labelled trees
• Parking with density
• The Page-Rényi parking process

zbMATH Keywords

generating functionswireless networksjamming densityparking problem

Mathematics Subject Classification ID

Combinatorial probability (60C05)

Cites Work

• Random maximal independent sets and the unfriendly theater seating arrangement problem
• Packing random intervals on-line
• Exact and approximate results for deposition and annihilation processes on graphs
• Random unfriendly seating arrangement in a dining table
• Title not available (Why is that?)
• Asymptotic normality in vacancies on a line
• Packet Switching in Radio Channels: Part I--Carrier Sense Multiple-Access Modes and Their Throughput-Delay Characteristics
• Discrete Spacings
• The Page-Rényi parking process
• Parking on a random tree

Cited In (8)

• Parking cars with spin but no length
• Stability conditions for a discrete-time decentralised medium access algorithm
• Asymptotics in Knuth's parking problem for caravans
• A combinatorial approach for discrete car parking on random labelled trees
• Fluctuations of the occupation density for a parking process
• Saturation in a Markovian parking process
• De Bruijn’s Short Route to Rényi’s Parking Constant
• On generalizations of the parking permit problem and network leasing problems

This page was built for publication: Per-site occupancy in the discrete parking problem

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