Parking on the integers

DOI10.1214/22-AAP1836MaRDI QIDQ6103991zbMATH OpenOpenAlexFDO

Authors Michał Przykucki, Alexander Roberts, Alex Scott

Publication date 5 June 2023

Published in The Annals of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

Cayley graphsparking problemsrandom walks

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Phase transitions (general) in equilibrium statistical mechanics (82B26) Interacting particle systems in time-dependent statistical mechanics (82C22)

Abstract: Models of parking in which cars are placed randomly and then move according to a deterministic rule have been studied since the work of Konheim and Weiss in the 1960s. Recently, Damron, Gravner, Junge, Lyu, and Sivakoff introduced a model in which cars are both placed and move at random. Independently at each point of a Cayley graph $G$, we place a car with probability $p$, and otherwise an empty parking space. Each car independently executes a random walk until it finds an empty space in which to park. In this paper we introduce three new techniques for studying the model, namely the space-based parking model, and the strategies for parking and for car removal. These allow us to study the original model by coupling it with models where parking behaviour is easier to control. Applying our methods to the one-dimensional parking problem in $mathbbZ$, we improve on previous work, showing that for $p<1/2$ the expected journey length of a car is finite, and for $p=1/2$ the expected journey length by time $t$ grows like $t^{3/4}$ up to a polylogarithmic factor.

Recommendations

• Parking on transitive unimodular graphs
• The Page-Rényi parking process
• Generalizations of the parking problem
• Parking on a random rooted plane tree
• Stretched exponential decay for subcritical parking times on

Cites work

• Absorbing-state phase transition for driven-dissipative stochastic dynamics on Z
• Activated Random Walks on \(\mathbb{Z}^d\)
• An Occupancy Discipline and Applications
• Asymptotic behavior of densities for two-particle annihilating random walks
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• Non-equilibrium phase transitions: activated random walks at criticality
• Parking functions for mappings
• Parking on a random tree
• Parking on transitive unimodular graphs
• Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
• Probability on trees and networks
• Site recurrence for annihilating random walks on Z^ n.
• Some problems on random intervals and annihilating particles

Cited in

(6)

• Parking on the infinite binary tree
• One-sided selfish parking
• On Parking Functions and The Tower of Hanoi
• Particle density in diffusion-limited annihilating systems
• The golf model on \(\mathbb{Z}/n \mathbb{Z}\) and on \(\mathbb{Z}\)
• Diffusion-limited annihilating-coalescing systems

This page was built for publication: Parking on the integers

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