Per-site occupancy in the discrete parking problem

DOI10.1016/J.SPL.2016.09.019zbMath1416.60019OpenAlexW2530406766MaRDI QIDQ342772

Mohammad Hasan, M. Dambrine

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

zbMATH Keywords

generating functionswireless networksjamming densityparking problem

Mathematics Subject Classification ID

Combinatorial probability (60C05)

Related Items (2)

Stability conditions for a discrete-time decentralised medium access algorithm ⋮ Asymptotics in Knuth's parking problem for caravans

Cites Work

• Unnamed Item
• The Page-Rényi parking process
• Parking on a random tree
• 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
• 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

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