arXiv (All)
open access
Sharpness and critical scaling of parking
In the parking model, each site of the $d$-dimensional lattice independently starts with one car with probability $p$ or one parking spot with probability $1-p$. Cars move according to independent discrete-time simple random walks and park at the first spot they find free. We prove that in the criti
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Sharpness and critical scaling of parking#920711
- Rigidity of one-dimensional point processes via optimal transport#1050774
- A Policy-Sensitive Model of Parking Choice for Commercial Vehicles in Urban Areas#449311
- A Superdiffusive Local Limit Theorem for the Elephant Random Walk and the Breakdown of Log-Concavity#1084677
- Central limit theorem in Rényi divergence for lattice random variables#620557
Record · ID 924945
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive