REVIEW 1 cited by
Parking on transitive unimodular graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
Place a car independently with probability $p$ at each site of a graph. Each initially vacant site is a parking spot that can fit one car. Cars simultaneously perform independent random walks. When a car encounters an available parking spot it parks there. Other cars can still drive over the site, but cannot park there. For a large class of transitive and unimodular graphs, we show that the root is almost surely visited infinitely many times when $p \geq 1/2$, and only finitely many times otherwise.
Forward citations
Cited by 1 Pith paper
-
Two-type annihilating systems on the complete and star graph
Two-type annihilating random walks on complete and star graphs have extinction times asymptotically larger than one-type annihilation, with near-matching upper and lower bounds for symmetric and asymmetric speeds.
Discussion (0). Continue with ORCID to comment.